About the Execution of ITS-Tools for DLCround-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 329472.00 | 0.00 | 0.00 | TTTFTFTTTTTTFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067000226.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 DLCround-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067000226
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 660K 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 DLCround-PT-10a-CTLFireability-2023-12
FORMULA_NAME DLCround-PT-10a-CTLFireability-2023-13
FORMULA_NAME DLCround-PT-10a-CTLFireability-2023-14
FORMULA_NAME DLCround-PT-10a-CTLFireability-2023-15
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-00
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-01
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-02
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-03
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-04
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-05
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-06
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-07
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-08
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-09
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-10
FORMULA_NAME DLCround-PT-10a-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748677022746
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 07:37:03] [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-05-31 07:37:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:37:04] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2025-05-31 07:37:04] [INFO ] Transformed 337 places.
[2025-05-31 07:37:04] [INFO ] Transformed 2605 transitions.
[2025-05-31 07:37:04] [INFO ] Found NUPN structural information;
[2025-05-31 07:37:04] [INFO ] Parsed PT model containing 337 places and 2605 transitions and 10130 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 247 transitions
Reduce redundant transitions removed 247 transitions.
FORMULA DLCround-PT-10a-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 137 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 2358/2358 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 326 transition count 2194
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 326 transition count 2194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 326 transition count 2192
Drop transitions (Redundant composition of simpler transitions.) removed 746 transitions
Redundant transition composition rules discarded 746 transitions
Iterating global reduction 1 with 746 rules applied. Total rules applied 770 place count 326 transition count 1446
Applied a total of 770 rules in 107 ms. Remains 326 /337 variables (removed 11) and now considering 1446/2358 (removed 912) transitions.
[2025-05-31 07:37:04] [INFO ] Flow matrix only has 205 transitions (discarded 1241 similar events)
// Phase 1: matrix 205 rows 326 cols
[2025-05-31 07:37:04] [INFO ] Computed 213 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:05] [INFO ] Implicit Places using invariants in 865 ms returned [128, 131, 132, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 147, 151, 152, 153, 156, 158, 160, 161, 162, 163, 164, 166, 168, 170, 172, 174, 176, 181, 182, 184, 185, 186, 187, 188, 189, 190, 191, 193, 194, 195, 197, 198, 199, 200, 202, 203, 204, 206, 207, 208, 210, 211, 212, 214, 216, 218, 220, 222, 223, 227, 229, 232, 234, 236, 237, 238, 240, 241, 242, 243, 245, 248, 249, 250, 253, 254, 255, 256, 258, 259, 260, 262, 264, 266, 269, 271, 272, 273, 274, 276, 277, 278, 279, 280, 281, 283, 284, 286, 287, 288, 289, 290, 291, 297, 298, 300, 301, 302, 303, 306, 308, 309, 310, 311, 312, 315, 316, 318, 320, 322, 323, 325]
Discarding 127 places :
Ensure Unique test removed 695 transitions
Reduce isomorphic transitions removed 695 transitions.
Implicit Place search using SMT only with invariants took 905 ms to find 127 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/337 places, 751/2358 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 476 transitions
Redundant transition composition rules discarded 476 transitions
Iterating global reduction 0 with 476 rules applied. Total rules applied 476 place count 199 transition count 275
Applied a total of 476 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 275/751 (removed 476) transitions.
[2025-05-31 07:37:05] [INFO ] Flow matrix only has 205 transitions (discarded 70 similar events)
// Phase 1: matrix 205 rows 199 cols
[2025-05-31 07:37:05] [INFO ] Computed 86 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:05] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-31 07:37:05] [INFO ] Flow matrix only has 205 transitions (discarded 70 similar events)
[2025-05-31 07:37:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:37:05] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 199/337 places, 275/2358 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1190 ms. Remains : 199/337 places, 275/2358 transitions.
Support contains 137 out of 199 places after structural reductions.
[2025-05-31 07:37:05] [INFO ] Flatten gal took : 37 ms
[2025-05-31 07:37:05] [INFO ] Flatten gal took : 18 ms
[2025-05-31 07:37:06] [INFO ] Input system was already deterministic with 275 transitions.
RANDOM walk for 5222 steps (0 resets) in 293 ms. (17 steps per ms) remains 0/80 properties
[2025-05-31 07:37:06] [INFO ] Flatten gal took : 12 ms
[2025-05-31 07:37:06] [INFO ] Flatten gal took : 11 ms
[2025-05-31 07:37:06] [INFO ] Input system was already deterministic with 275 transitions.
Computed a total of 72 stabilizing places and 1 stable transitions
Graph (complete) has 360 edges and 199 vertex of which 128 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 134 transition count 275
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 84 place count 115 transition count 237
Iterating global reduction 1 with 19 rules applied. Total rules applied 103 place count 115 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 115 transition count 235
Applied a total of 105 rules in 6 ms. Remains 115 /199 variables (removed 84) and now considering 235/275 (removed 40) transitions.
[2025-05-31 07:37:06] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
// Phase 1: matrix 184 rows 115 cols
[2025-05-31 07:37:06] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-31 07:37:06] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2025-05-31 07:37:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:37:06] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-05-31 07:37:06] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2025-05-31 07:37:06] [INFO ] Invariant cache hit.
[2025-05-31 07:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 6/115 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/298 variables, 115/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 1/299 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/299 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 137 constraints, problems are : Problem set: 0 solved, 234 unsolved in 12171 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 6/115 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/298 variables, 115/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 1/299 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 0/299 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 371 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10552 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22781ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 22789ms
Starting structural reductions in LTL mode, iteration 1 : 115/199 places, 235/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22908 ms. Remains : 115/199 places, 235/275 transitions.
[2025-05-31 07:37:29] [INFO ] Flatten gal took : 11 ms
[2025-05-31 07:37:29] [INFO ] Flatten gal took : 6 ms
[2025-05-31 07:37:29] [INFO ] Input system was already deterministic with 235 transitions.
[2025-05-31 07:37:29] [INFO ] Flatten gal took : 7 ms
[2025-05-31 07:37:29] [INFO ] Flatten gal took : 6 ms
[2025-05-31 07:37:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5416037998909302590.gal : 3 ms
[2025-05-31 07:37:29] [INFO ] Time to serialize properties into /tmp/CTLFireability12906749552453083149.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/CTLFireability5416037998909302590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12906749552453083149.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,5.36871e+12,0.033189,4584,2,323,5,1293,6,0,627,930,0
Converting to forward existential form...Done !
original formula: A(((p37==1)&&(p141==1)) U ((AX(AG((((p107==1)&&(p293==1))||((p47==1)&&(p278==1))))) + EF((EF(EG(((p45==1)&&(p241==1)))) + !(AF(((p28==1)&...196
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(!(E(TRUE U !((((p107==1)&&(p293==1))||((p47==1)&&(p278==1))))))))) + E(TRUE U (E(TRUE ...683
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.111942,7656,1,0,11,18373,40,3,2784,5003,17
FORMULA DLCround-PT-10a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 135 transition count 275
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 80 place count 119 transition count 243
Iterating global reduction 1 with 16 rules applied. Total rules applied 96 place count 119 transition count 243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 119 transition count 241
Applied a total of 98 rules in 3 ms. Remains 119 /199 variables (removed 80) and now considering 241/275 (removed 34) transitions.
[2025-05-31 07:37:29] [INFO ] Flow matrix only has 187 transitions (discarded 54 similar events)
// Phase 1: matrix 187 rows 119 cols
[2025-05-31 07:37:29] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 07:37:29] [INFO ] Flow matrix only has 187 transitions (discarded 54 similar events)
[2025-05-31 07:37:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:37:29] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2025-05-31 07:37:29] [INFO ] Flow matrix only has 187 transitions (discarded 54 similar events)
[2025-05-31 07:37:29] [INFO ] Invariant cache hit.
[2025-05-31 07:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 7/119 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 186/305 variables, 119/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 1/306 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 142 constraints, problems are : Problem set: 0 solved, 240 unsolved in 12271 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 7/119 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 186/305 variables, 119/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 240/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 382 constraints, problems are : Problem set: 0 solved, 240 unsolved in 11170 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23461ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 23461ms
Starting structural reductions in LTL mode, iteration 1 : 119/199 places, 241/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23612 ms. Remains : 119/199 places, 241/275 transitions.
[2025-05-31 07:37:53] [INFO ] Flatten gal took : 10 ms
[2025-05-31 07:37:53] [INFO ] Flatten gal took : 7 ms
[2025-05-31 07:37:53] [INFO ] Input system was already deterministic with 241 transitions.
[2025-05-31 07:37:53] [INFO ] Flatten gal took : 7 ms
[2025-05-31 07:37:53] [INFO ] Flatten gal took : 7 ms
[2025-05-31 07:37:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1403195392051859009.gal : 2 ms
[2025-05-31 07:37:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6388687485180146247.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/CTLFireability1403195392051859009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6388687485180146247.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,7.64412e+12,0.027845,4848,2,334,5,1342,6,0,643,960,0
Converting to forward existential form...Done !
original formula: (AX(A((p103==1) U ((AG((((p49==1)&&(p250==1))||((p38==1)&&(p144==1)))) + !(E(((p86==1)&&(p281==1)) U ((p131==1)&&(p330==1))))) + EX(((p13...241
=> equivalent forward existential formula: (([(FwdU((((FwdU(EY(Init),!(((!(E(TRUE U !((((p49==1)&&(p250==1))||((p38==1)&&(p144==1)))))) + !(E(((p86==1)&&(p...753
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.089402,7536,1,0,11,16502,25,6,2835,2564,14
FORMULA DLCround-PT-10a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 138 transition count 275
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 122 transition count 243
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 122 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 122 transition count 242
Applied a total of 94 rules in 5 ms. Remains 122 /199 variables (removed 77) and now considering 242/275 (removed 33) transitions.
[2025-05-31 07:37:53] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
// Phase 1: matrix 188 rows 122 cols
[2025-05-31 07:37:53] [INFO ] Computed 25 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:53] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-31 07:37:53] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
[2025-05-31 07:37:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:37:53] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-05-31 07:37:53] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
[2025-05-31 07:37:53] [INFO ] Invariant cache hit.
[2025-05-31 07:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 10/122 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 187/309 variables, 122/147 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 1/310 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 148 constraints, problems are : Problem set: 0 solved, 241 unsolved in 12399 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 10/122 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 187/309 variables, 122/147 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 241/388 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 1/310 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 389 constraints, problems are : Problem set: 0 solved, 241 unsolved in 11335 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23754ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 23755ms
Starting structural reductions in LTL mode, iteration 1 : 122/199 places, 242/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23872 ms. Remains : 122/199 places, 242/275 transitions.
[2025-05-31 07:38:17] [INFO ] Flatten gal took : 12 ms
[2025-05-31 07:38:17] [INFO ] Flatten gal took : 7 ms
[2025-05-31 07:38:17] [INFO ] Input system was already deterministic with 242 transitions.
[2025-05-31 07:38:17] [INFO ] Flatten gal took : 6 ms
[2025-05-31 07:38:17] [INFO ] Flatten gal took : 6 ms
[2025-05-31 07:38:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14965910157927955746.gal : 2 ms
[2025-05-31 07:38:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11871099149568494365.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/CTLFireability14965910157927955746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11871099149568494365.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.15373e+12,0.028431,4872,2,340,5,1362,6,0,647,971,0
Converting to forward existential form...Done !
original formula: ((A(!(AG(((EX(((p37==1)&&(p237==1))) * (p96==1)) * (p188==1)))) U !(A((((p9==1)&&(p141==1))&&((p67==1)||((p88==1)&&(p180==1)))) U ((((p76...452
=> equivalent forward existential formula: ((([(((FwdU(Init,!(!(!((E(!(((((p76==1)&&(p268==1))||((p72==1)&&(p268==1)))||((p99==1)||((p36==1)&&(p235==1)))))...1499
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 229/19/13
(forward)formula 0,1,0.14079,8584,1,0,22,24024,45,9,3106,7204,29
FORMULA DLCround-PT-10a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Graph (trivial) has 271 edges and 199 vertex of which 126 / 199 are part of one of the 15 SCC in 2 ms
Free SCC test removed 111 places
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Graph (complete) has 104 edges and 88 vertex of which 18 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 5 transition count 6
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 5 transition count 6
Applied a total of 28 rules in 10 ms. Remains 5 /199 variables (removed 194) and now considering 6/275 (removed 269) transitions.
[2025-05-31 07:38:17] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
// Phase 1: matrix 4 rows 5 cols
[2025-05-31 07:38:17] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:38:17] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-31 07:38:17] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2025-05-31 07:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:38:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:38:17] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-05-31 07:38:17] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2025-05-31 07:38:17] [INFO ] Invariant cache hit.
[2025-05-31 07:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/199 places, 6/275 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 197 ms. Remains : 5/199 places, 6/275 transitions.
[2025-05-31 07:38:17] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:38:17] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:38:17] [INFO ] Input system was already deterministic with 6 transitions.
[2025-05-31 07:38:17] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:38:17] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:38:17] [INFO ] Time to serialize gal into /tmp/CTLFireability12986844584187860882.gal : 0 ms
[2025-05-31 07:38:17] [INFO ] Time to serialize properties into /tmp/CTLFireability13746055599380347660.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/CTLFireability12986844584187860882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13746055599380347660.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.
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,0.00168,3660,2,10,5,30,6,0,20,16,0
Converting to forward existential form...Done !
original formula: EG(((p32==1) + EF(((p32==1)&&(p236==1)))))
=> equivalent forward existential formula: [FwdG(Init,((p32==1) + E(TRUE U ((p32==1)&&(p236==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.002998,3916,1,0,7,54,19,2,96,40,12
FORMULA DLCround-PT-10a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 129 transition count 275
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 89 place count 110 transition count 237
Iterating global reduction 1 with 19 rules applied. Total rules applied 108 place count 110 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 110 transition count 235
Applied a total of 110 rules in 2 ms. Remains 110 /199 variables (removed 89) and now considering 235/275 (removed 40) transitions.
[2025-05-31 07:38:17] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
// Phase 1: matrix 184 rows 110 cols
[2025-05-31 07:38:17] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:38:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 07:38:17] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2025-05-31 07:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:38:17] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-05-31 07:38:17] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2025-05-31 07:38:17] [INFO ] Invariant cache hit.
[2025-05-31 07:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/293 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 1/294 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 127 constraints, problems are : Problem set: 0 solved, 234 unsolved in 11468 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/293 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 234/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 0/294 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 361 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10128 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21611ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 21611ms
Starting structural reductions in LTL mode, iteration 1 : 110/199 places, 235/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21711 ms. Remains : 110/199 places, 235/275 transitions.
[2025-05-31 07:38:39] [INFO ] Flatten gal took : 11 ms
[2025-05-31 07:38:39] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:38:39] [INFO ] Input system was already deterministic with 235 transitions.
[2025-05-31 07:38:39] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:38:39] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:38:39] [INFO ] Time to serialize gal into /tmp/CTLFireability4951326487152246255.gal : 1 ms
[2025-05-31 07:38:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17577858189701915667.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/CTLFireability4951326487152246255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17577858189701915667.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,5.36871e+12,0.023534,4732,2,313,5,1263,6,0,622,915,0
Converting to forward existential form...Done !
original formula: AG(EX(EX(((p88==0)||(p186==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EX(((p88==0)||(p186==0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.066912,6652,1,0,7,14628,10,0,2395,1993,5
FORMULA DLCround-PT-10a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 139 transition count 275
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 74 place count 125 transition count 247
Iterating global reduction 1 with 14 rules applied. Total rules applied 88 place count 125 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 125 transition count 245
Applied a total of 90 rules in 7 ms. Remains 125 /199 variables (removed 74) and now considering 245/275 (removed 30) transitions.
[2025-05-31 07:38:39] [INFO ] Flow matrix only has 189 transitions (discarded 56 similar events)
// Phase 1: matrix 189 rows 125 cols
[2025-05-31 07:38:39] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:38:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 07:38:39] [INFO ] Flow matrix only has 189 transitions (discarded 56 similar events)
[2025-05-31 07:38:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:38:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:38:39] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2025-05-31 07:38:39] [INFO ] Flow matrix only has 189 transitions (discarded 56 similar events)
[2025-05-31 07:38:39] [INFO ] Invariant cache hit.
[2025-05-31 07:38:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 11/125 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 188/313 variables, 125/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 1/314 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 152 constraints, problems are : Problem set: 0 solved, 244 unsolved in 12822 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 11/125 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 188/313 variables, 125/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 244/395 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 396 constraints, problems are : Problem set: 0 solved, 244 unsolved in 11965 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24801ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 24802ms
Starting structural reductions in LTL mode, iteration 1 : 125/199 places, 245/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24905 ms. Remains : 125/199 places, 245/275 transitions.
[2025-05-31 07:39:04] [INFO ] Flatten gal took : 7 ms
[2025-05-31 07:39:04] [INFO ] Flatten gal took : 6 ms
[2025-05-31 07:39:04] [INFO ] Input system was already deterministic with 245 transitions.
[2025-05-31 07:39:04] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:39:04] [INFO ] Flatten gal took : 6 ms
[2025-05-31 07:39:04] [INFO ] Time to serialize gal into /tmp/CTLFireability18101960845716711278.gal : 2 ms
[2025-05-31 07:39:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2236778142886977086.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/CTLFireability18101960845716711278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2236778142886977086.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,1.01922e+13,0.032333,4816,2,348,5,1396,6,0,657,987,0
Converting to forward existential form...Done !
original formula: (A((EF(EX((((p109==1)&&(p307==1))||((p72==1)&&(p274==1))))) + !((!(((((p116==1)&&(p315==1))&&((p103==1)&&(p305==1)))&&(!((p86==1)&&(p278=...401
=> equivalent forward existential formula: (([(EY(((FwdU(Init,!((!(EX(!(EG(((p86==1)&&(p279==1)))))) + !((E(!(E(E(TRUE U (p71==1)) U !(EG(!(((p136==1)&&(p3...1260
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.113332,7760,1,0,15,18865,46,4,2950,3685,20
FORMULA DLCround-PT-10a-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 131 transition count 275
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 86 place count 113 transition count 239
Iterating global reduction 1 with 18 rules applied. Total rules applied 104 place count 113 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 113 transition count 237
Applied a total of 106 rules in 6 ms. Remains 113 /199 variables (removed 86) and now considering 237/275 (removed 38) transitions.
[2025-05-31 07:39:04] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 113 cols
[2025-05-31 07:39:04] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:39:04] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-31 07:39:04] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
[2025-05-31 07:39:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:39:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:39:04] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-05-31 07:39:04] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
[2025-05-31 07:39:04] [INFO ] Invariant cache hit.
[2025-05-31 07:39:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 3/113 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 184/297 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 132 constraints, problems are : Problem set: 0 solved, 236 unsolved in 11694 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 3/113 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 184/297 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 236/367 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 1/298 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 368 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10414 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22127ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 22128ms
Starting structural reductions in LTL mode, iteration 1 : 113/199 places, 237/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22228 ms. Remains : 113/199 places, 237/275 transitions.
[2025-05-31 07:39:26] [INFO ] Flatten gal took : 10 ms
[2025-05-31 07:39:26] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:39:26] [INFO ] Input system was already deterministic with 237 transitions.
[2025-05-31 07:39:26] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:39:26] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:39:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5783447538503118096.gal : 1 ms
[2025-05-31 07:39:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6721832472286751319.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/CTLFireability5783447538503118096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6721832472286751319.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,6.0398e+12,0.024554,4768,2,320,5,1289,6,0,629,929,0
Converting to forward existential form...Done !
original formula: AG(EF((((p61==0)||(p170==0)) + AX((((p96==0)||(p190==0))||((p103==0)||(p303==0)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p61==0)||(p170==0)) + !(EX(!((((p96==0)||(p190==0))||((p103==0)||(p303==0)))))...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.078556,6688,1,0,10,15462,16,2,2636,2554,7
FORMULA DLCround-PT-10a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 132 transition count 275
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 86 place count 113 transition count 237
Iterating global reduction 1 with 19 rules applied. Total rules applied 105 place count 113 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 107 place count 113 transition count 235
Applied a total of 107 rules in 2 ms. Remains 113 /199 variables (removed 86) and now considering 235/275 (removed 40) transitions.
[2025-05-31 07:39:26] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
// Phase 1: matrix 184 rows 113 cols
[2025-05-31 07:39:26] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:39:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 07:39:26] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2025-05-31 07:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:39:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-05-31 07:39:26] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2025-05-31 07:39:26] [INFO ] Invariant cache hit.
[2025-05-31 07:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 4/113 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/296 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 1/297 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 133 constraints, problems are : Problem set: 0 solved, 234 unsolved in 11713 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 4/113 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/296 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 234/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 1/297 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 367 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10436 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22161ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 22161ms
Starting structural reductions in LTL mode, iteration 1 : 113/199 places, 235/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22259 ms. Remains : 113/199 places, 235/275 transitions.
[2025-05-31 07:39:49] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:39:49] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:39:49] [INFO ] Input system was already deterministic with 235 transitions.
[2025-05-31 07:39:49] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:39:49] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:39:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1162486383119993126.gal : 1 ms
[2025-05-31 07:39:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12006388036371321837.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/CTLFireability1162486383119993126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12006388036371321837.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,5.36871e+12,0.025496,4748,2,319,5,1281,6,0,625,924,0
Converting to forward existential form...Done !
original formula: AX(E(EG(A(((p7==1)&&(p220==1)) U ((p118==1)&&(p310==1)))) U AF((!(AX(((p36==1)&&(p140==1)))) * AF(((p95==1)&&(p194==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(EG(!((E(!(((p118==1)&&(p310==1))) U (!(((p7==1)&&(p220==1))) * !(((p118==1)&&(p310==1))))) + EG...280
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 230/0/5
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.107297,7820,1,0,32,21742,42,19,2947,8132,30
FORMULA DLCround-PT-10a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 135 transition count 275
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 82 place count 117 transition count 239
Iterating global reduction 1 with 18 rules applied. Total rules applied 100 place count 117 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 117 transition count 237
Applied a total of 102 rules in 9 ms. Remains 117 /199 variables (removed 82) and now considering 237/275 (removed 38) transitions.
[2025-05-31 07:39:49] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 117 cols
[2025-05-31 07:39:49] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:39:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-31 07:39:49] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
[2025-05-31 07:39:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:39:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:39:49] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-05-31 07:39:49] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
[2025-05-31 07:39:49] [INFO ] Invariant cache hit.
[2025-05-31 07:39:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 7/117 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 184/301 variables, 117/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 140 constraints, problems are : Problem set: 0 solved, 236 unsolved in 11985 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 7/117 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 184/301 variables, 117/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 236/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10680 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22676ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 22676ms
Starting structural reductions in LTL mode, iteration 1 : 117/199 places, 237/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22783 ms. Remains : 117/199 places, 237/275 transitions.
[2025-05-31 07:40:11] [INFO ] Flatten gal took : 7 ms
[2025-05-31 07:40:11] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:40:11] [INFO ] Input system was already deterministic with 237 transitions.
[2025-05-31 07:40:12] [INFO ] Flatten gal took : 10 ms
[2025-05-31 07:40:12] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:40:12] [INFO ] Time to serialize gal into /tmp/CTLFireability897637380458941850.gal : 1 ms
[2025-05-31 07:40:12] [INFO ] Time to serialize properties into /tmp/CTLFireability13949105028902987723.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/CTLFireability897637380458941850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13949105028902987723.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,6.0398e+12,0.026568,4792,2,328,5,1313,6,0,633,941,0
Converting to forward existential form...Done !
original formula: AG((EG((EF(((p14==1)&&(p166==1))) * AF(((p53==0)||(p255==0))))) + EX(A(((p41==1)&&(p246==1)) U ((((p21==1)&&(p160==1))&&((p21==1)&&(p176=...214
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!((E(!(((((p21==1)&&(p160==1))&&((p21==1)&&(p176==1)))&&(((p127==1)&&(p305==1))||((p38...506
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 217/0/20
(forward)formula 0,0,0.134368,8760,1,0,17,27200,42,8,3190,12799,17
FORMULA DLCround-PT-10a-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 139 transition count 275
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 74 place count 125 transition count 247
Iterating global reduction 1 with 14 rules applied. Total rules applied 88 place count 125 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 125 transition count 245
Applied a total of 90 rules in 6 ms. Remains 125 /199 variables (removed 74) and now considering 245/275 (removed 30) transitions.
[2025-05-31 07:40:12] [INFO ] Flow matrix only has 189 transitions (discarded 56 similar events)
// Phase 1: matrix 189 rows 125 cols
[2025-05-31 07:40:12] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:40:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-31 07:40:12] [INFO ] Flow matrix only has 189 transitions (discarded 56 similar events)
[2025-05-31 07:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:40:12] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2025-05-31 07:40:12] [INFO ] Flow matrix only has 189 transitions (discarded 56 similar events)
[2025-05-31 07:40:12] [INFO ] Invariant cache hit.
[2025-05-31 07:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 11/125 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 188/313 variables, 125/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 1/314 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 152 constraints, problems are : Problem set: 0 solved, 244 unsolved in 13047 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 11/125 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 188/313 variables, 125/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 244/395 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 396 constraints, problems are : Problem set: 0 solved, 244 unsolved in 11823 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24882ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 24883ms
Starting structural reductions in LTL mode, iteration 1 : 125/199 places, 245/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24997 ms. Remains : 125/199 places, 245/275 transitions.
[2025-05-31 07:40:37] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:40:37] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:40:37] [INFO ] Input system was already deterministic with 245 transitions.
[2025-05-31 07:40:37] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:40:37] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:40:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1631290808841107036.gal : 1 ms
[2025-05-31 07:40:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18150879660555833670.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/CTLFireability1631290808841107036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18150879660555833670.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,1.01922e+13,0.032685,4760,2,348,5,1397,6,0,657,990,0
Converting to forward existential form...Done !
original formula: EF(((A(E(((p136==1)&&(p328==1)) U !(((p34==1)&&(p228==1)))) U (A(((p65==1)&&(p168==1)) U (p124==1)) + AF((p19==1)))) * E(AX(((p67==1)&&(p...347
=> equivalent forward existential formula: [(((FwdU(((FwdU(Init,TRUE) * ((p137==0)||(p246==0))) * !((E(!((!((E(!((p124==1)) U (!(((p65==1)&&(p168==1))) * !...826
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 232/9/13
Hit Full ! (commute/partial/dont) 242/0/3
Hit Full ! (commute/partial/dont) 241/4/4
Using saturation style SCC detection
(forward)formula 0,1,0.177214,10648,1,0,42,36271,67,28,3402,21145,46
FORMULA DLCround-PT-10a-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 131 transition count 275
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 86 place count 113 transition count 239
Iterating global reduction 1 with 18 rules applied. Total rules applied 104 place count 113 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 113 transition count 237
Applied a total of 106 rules in 5 ms. Remains 113 /199 variables (removed 86) and now considering 237/275 (removed 38) transitions.
[2025-05-31 07:40:37] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 113 cols
[2025-05-31 07:40:37] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:40:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-31 07:40:37] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
[2025-05-31 07:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:40:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:40:37] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-05-31 07:40:37] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
[2025-05-31 07:40:37] [INFO ] Invariant cache hit.
[2025-05-31 07:40:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 3/113 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 184/297 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 132 constraints, problems are : Problem set: 0 solved, 236 unsolved in 12074 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 3/113 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 184/297 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 236/367 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 1/298 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 368 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10556 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22640ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 22641ms
Starting structural reductions in LTL mode, iteration 1 : 113/199 places, 237/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22741 ms. Remains : 113/199 places, 237/275 transitions.
[2025-05-31 07:41:00] [INFO ] Flatten gal took : 10 ms
[2025-05-31 07:41:00] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:41:00] [INFO ] Input system was already deterministic with 237 transitions.
[2025-05-31 07:41:00] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:41:00] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:41:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4050701233951261963.gal : 0 ms
[2025-05-31 07:41:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4711968809425915247.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/CTLFireability4050701233951261963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4711968809425915247.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,6.0398e+12,0.024615,4768,2,320,5,1290,6,0,629,932,0
Converting to forward existential form...Done !
original formula: AF(!(E(E(((p64==1)&&(p258==1)) U !(AX(((p14==1)&&(p190==1))))) U AX(((p14==1)&&(p141==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(E(((p64==1)&&(p258==1)) U !(!(EX(!(((p14==1)&&(p190==1))))))) U !(EX(!(((p14==1)&&(p141==1)))))...168
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 233/4/4
(forward)formula 0,1,0.093555,7200,1,0,9,17465,29,2,2760,3754,18
FORMULA DLCround-PT-10a-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 132 transition count 275
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 83 place count 116 transition count 243
Iterating global reduction 1 with 16 rules applied. Total rules applied 99 place count 116 transition count 243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 116 transition count 241
Applied a total of 101 rules in 2 ms. Remains 116 /199 variables (removed 83) and now considering 241/275 (removed 34) transitions.
[2025-05-31 07:41:00] [INFO ] Flow matrix only has 187 transitions (discarded 54 similar events)
// Phase 1: matrix 187 rows 116 cols
[2025-05-31 07:41:00] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:41:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 07:41:00] [INFO ] Flow matrix only has 187 transitions (discarded 54 similar events)
[2025-05-31 07:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:41:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:41:00] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2025-05-31 07:41:00] [INFO ] Flow matrix only has 187 transitions (discarded 54 similar events)
[2025-05-31 07:41:00] [INFO ] Invariant cache hit.
[2025-05-31 07:41:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 4/116 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 186/302 variables, 116/135 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 136 constraints, problems are : Problem set: 0 solved, 240 unsolved in 12245 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 4/116 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 186/302 variables, 116/135 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 240/375 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 1/303 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 376 constraints, problems are : Problem set: 0 solved, 240 unsolved in 10889 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23146ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 23146ms
Starting structural reductions in LTL mode, iteration 1 : 116/199 places, 241/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23238 ms. Remains : 116/199 places, 241/275 transitions.
[2025-05-31 07:41:23] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:41:23] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:41:23] [INFO ] Input system was already deterministic with 241 transitions.
[2025-05-31 07:41:23] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:41:23] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:41:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3126805433141792111.gal : 1 ms
[2025-05-31 07:41:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10434561170900995516.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/CTLFireability3126805433141792111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10434561170900995516.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,7.64412e+12,0.02735,4824,2,328,5,1326,6,0,640,957,0
Converting to forward existential form...Done !
original formula: EF((((p96==0)||(p188==0)) * (EX((((p82==1)&&(p184==1))||((p62==1)&&(p263==1)))) + (EG((p130==1)) * ((p132==0)||(p224==0))))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * ((p96==0)||(p188==0)))) * (((p82==1)&&(p184==1))||((p62==1)&&(p263==1))))] != FALSE + [...250
(forward)formula 0,1,0.037185,5080,1,0,9,1623,9,2,993,1035,3
FORMULA DLCround-PT-10a-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 135 transition count 275
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 80 place count 119 transition count 243
Iterating global reduction 1 with 16 rules applied. Total rules applied 96 place count 119 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 119 transition count 242
Applied a total of 97 rules in 5 ms. Remains 119 /199 variables (removed 80) and now considering 242/275 (removed 33) transitions.
[2025-05-31 07:41:23] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
// Phase 1: matrix 188 rows 119 cols
[2025-05-31 07:41:23] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:41:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-31 07:41:23] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
[2025-05-31 07:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:41:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:41:23] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-05-31 07:41:23] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
[2025-05-31 07:41:23] [INFO ] Invariant cache hit.
[2025-05-31 07:41:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 7/119 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 187/306 variables, 119/141 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 1/307 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 142 constraints, problems are : Problem set: 0 solved, 241 unsolved in 12330 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 7/119 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 187/306 variables, 119/141 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 241/382 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 1/307 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/307 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 383 constraints, problems are : Problem set: 0 solved, 241 unsolved in 11217 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23558ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 23559ms
Starting structural reductions in LTL mode, iteration 1 : 119/199 places, 242/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23667 ms. Remains : 119/199 places, 242/275 transitions.
[2025-05-31 07:41:47] [INFO ] Flatten gal took : 10 ms
[2025-05-31 07:41:47] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:41:47] [INFO ] Input system was already deterministic with 242 transitions.
[2025-05-31 07:41:47] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:41:47] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:41:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11367900171242463465.gal : 0 ms
[2025-05-31 07:41:47] [INFO ] Time to serialize properties into /tmp/CTLFireability693303433728048655.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/CTLFireability11367900171242463465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability693303433728048655.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,8.45572e+12,0.033894,4856,2,334,5,1343,6,0,644,959,0
Converting to forward existential form...Done !
original formula: (EF(!(A(!((EX(((p16==1)&&(p207==1))) * A(((p48==1)&&(p242==1)) U ((p137==1)&&(p286==1))))) U AG(((p18==1)&&(p191==1)))))) + AX((((p33==0)...223
=> equivalent forward existential formula: ([(EY((Init * !(E(TRUE U !(!((E(!(!(E(TRUE U !(((p18==1)&&(p191==1)))))) U (!(!((EX(((p16==1)&&(p207==1))) * !((...813
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 232/0/10
(forward)formula 0,1,0.11426,7672,1,0,17,18512,42,4,2890,3903,22
FORMULA DLCround-PT-10a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 128 transition count 275
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 90 place count 109 transition count 237
Iterating global reduction 1 with 19 rules applied. Total rules applied 109 place count 109 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 109 transition count 235
Applied a total of 111 rules in 8 ms. Remains 109 /199 variables (removed 90) and now considering 235/275 (removed 40) transitions.
[2025-05-31 07:41:47] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
// Phase 1: matrix 184 rows 109 cols
[2025-05-31 07:41:47] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:41:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-31 07:41:47] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2025-05-31 07:41:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:41:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:41:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-05-31 07:41:47] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2025-05-31 07:41:47] [INFO ] Invariant cache hit.
[2025-05-31 07:41:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 183/292 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 1/293 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 125 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10180 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 183/292 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 234/358 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 1/293 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 359 constraints, problems are : Problem set: 0 solved, 234 unsolved in 9368 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19558ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 19559ms
Starting structural reductions in LTL mode, iteration 1 : 109/199 places, 235/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19657 ms. Remains : 109/199 places, 235/275 transitions.
[2025-05-31 07:42:07] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:42:07] [INFO ] Flatten gal took : 4 ms
[2025-05-31 07:42:07] [INFO ] Input system was already deterministic with 235 transitions.
[2025-05-31 07:42:07] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:42:07] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:42:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17980049278082065949.gal : 1 ms
[2025-05-31 07:42:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3722182062253474486.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/CTLFireability17980049278082065949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3722182062253474486.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,5.36871e+12,0.023875,4728,2,304,5,1264,6,0,621,918,0
Converting to forward existential form...Done !
original formula: EF(EX(EG(EX((p80==1)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),EX((p80==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.076703,6776,1,0,9,15013,16,2,2491,2814,12
FORMULA DLCround-PT-10a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 275/275 transitions.
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 145 transition count 275
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 129 transition count 243
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 129 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 129 transition count 242
Applied a total of 87 rules in 5 ms. Remains 129 /199 variables (removed 70) and now considering 242/275 (removed 33) transitions.
[2025-05-31 07:42:07] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
// Phase 1: matrix 188 rows 129 cols
[2025-05-31 07:42:07] [INFO ] Computed 32 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:42:07] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 07:42:07] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
[2025-05-31 07:42:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:42:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 07:42:07] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-05-31 07:42:07] [INFO ] Flow matrix only has 188 transitions (discarded 54 similar events)
[2025-05-31 07:42:07] [INFO ] Invariant cache hit.
[2025-05-31 07:42:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 17/129 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 187/316 variables, 129/161 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 1/317 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 162 constraints, problems are : Problem set: 0 solved, 241 unsolved in 12900 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 17/129 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 187/316 variables, 129/161 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 241/402 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 403 constraints, problems are : Problem set: 0 solved, 241 unsolved in 11724 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24635ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 24635ms
Starting structural reductions in LTL mode, iteration 1 : 129/199 places, 242/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24739 ms. Remains : 129/199 places, 242/275 transitions.
[2025-05-31 07:42:31] [INFO ] Flatten gal took : 6 ms
[2025-05-31 07:42:31] [INFO ] Flatten gal took : 5 ms
[2025-05-31 07:42:31] [INFO ] Input system was already deterministic with 242 transitions.
[2025-05-31 07:42:31] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:42:31] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:42:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10292989792081682234.gal : 1 ms
[2025-05-31 07:42:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15752823001853320159.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/CTLFireability10292989792081682234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15752823001853320159.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.15373e+12,0.034327,4764,2,354,5,1403,6,0,654,988,0
Converting to forward existential form...Done !
original formula: (AF(E(((p105==1)&&(p304==1)) U ((((A(((p117==1)&&(p316==1)) U ((p75==1)&&(p272==1))) + AF(((p28==1)&&(p226==1)))) + (((p96==1)&&(p293==1)...484
=> equivalent forward existential formula: ([(EY(FwdU((Init * !(!(EG(!(E(((p105==1)&&(p304==1)) U ((((!((E(!(((p75==1)&&(p272==1))) U (!(((p117==1)&&(p316=...1475
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 223/3/19
Hit Full ! (commute/partial/dont) 238/0/4
Hit Full ! (commute/partial/dont) 238/0/4
Hit Full ! (commute/partial/dont) 239/0/3
Hit Full ! (commute/partial/dont) 239/3/3
Using saturation style SCC detection
(forward)formula 0,1,0.228031,10908,1,0,37,34407,99,17,3861,18631,41
FORMULA DLCround-PT-10a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-05-31 07:42:32] [INFO ] Flatten gal took : 8 ms
[2025-05-31 07:42:32] [INFO ] Flatten gal took : 5 ms
Total runtime 328227 ms.
BK_STOP 1748677352218
--------------------
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="DLCround-PT-10a"
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 DLCround-PT-10a, 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 r072-tall-174860067000226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-10a.tgz
mv DLCround-PT-10a 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 ;