About the Execution of ITS-Tools for DLCround-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 286107.00 | 0.00 | 0.00 | FTTFTFTFTTFTFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067100242.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-11a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067100242
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-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.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 762K 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-11a-CTLFireability-2023-12
FORMULA_NAME DLCround-PT-11a-CTLFireability-2023-13
FORMULA_NAME DLCround-PT-11a-CTLFireability-2023-14
FORMULA_NAME DLCround-PT-11a-CTLFireability-2023-15
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-00
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-01
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-02
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-03
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-04
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-05
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-06
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-07
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-08
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-09
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-10
FORMULA_NAME DLCround-PT-11a-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748679907104
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-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 08:25:08] [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 08:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:25:08] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-05-31 08:25:08] [INFO ] Transformed 377 places.
[2025-05-31 08:25:08] [INFO ] Transformed 2993 transitions.
[2025-05-31 08:25:08] [INFO ] Found NUPN structural information;
[2025-05-31 08:25:08] [INFO ] Parsed PT model containing 377 places and 2993 transitions and 11677 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 280 transitions
Reduce redundant transitions removed 280 transitions.
FORMULA DLCround-PT-11a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 139 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 2713/2713 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 364 transition count 2508
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 364 transition count 2508
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 364 transition count 2506
Drop transitions (Redundant composition of simpler transitions.) removed 861 transitions
Redundant transition composition rules discarded 861 transitions
Iterating global reduction 1 with 861 rules applied. Total rules applied 889 place count 364 transition count 1645
Applied a total of 889 rules in 129 ms. Remains 364 /377 variables (removed 13) and now considering 1645/2713 (removed 1068) transitions.
[2025-05-31 08:25:08] [INFO ] Flow matrix only has 219 transitions (discarded 1426 similar events)
// Phase 1: matrix 219 rows 364 cols
[2025-05-31 08:25:08] [INFO ] Computed 244 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:09] [INFO ] Implicit Places using invariants in 1015 ms returned [136, 137, 138, 139, 140, 141, 142, 144, 145, 146, 147, 150, 151, 153, 154, 155, 156, 157, 158, 160, 161, 163, 164, 165, 166, 168, 169, 170, 171, 172, 173, 174, 176, 178, 182, 183, 185, 186, 187, 188, 189, 190, 192, 194, 195, 196, 197, 199, 204, 205, 206, 208, 209, 211, 212, 216, 218, 219, 220, 222, 225, 226, 227, 228, 230, 232, 233, 234, 236, 239, 241, 242, 244, 245, 246, 247, 248, 249, 251, 252, 253, 254, 255, 258, 260, 263, 264, 265, 266, 267, 269, 270, 272, 273, 275, 277, 278, 279, 280, 281, 284, 286, 288, 289, 290, 291, 293, 294, 296, 298, 301, 302, 303, 304, 305, 306, 307, 309, 311, 312, 315, 317, 318, 320, 321, 324, 325, 326, 329, 330, 331, 333, 334, 335, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 350, 351, 352, 354, 355, 356, 357, 359, 360, 362]
Discarding 155 places :
Ensure Unique test removed 872 transitions
Reduce isomorphic transitions removed 872 transitions.
Implicit Place search using SMT only with invariants took 1052 ms to find 155 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/377 places, 773/2713 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 480 transitions
Redundant transition composition rules discarded 480 transitions
Iterating global reduction 0 with 480 rules applied. Total rules applied 480 place count 209 transition count 293
Applied a total of 480 rules in 7 ms. Remains 209 /209 variables (removed 0) and now considering 293/773 (removed 480) transitions.
[2025-05-31 08:25:09] [INFO ] Flow matrix only has 219 transitions (discarded 74 similar events)
// Phase 1: matrix 219 rows 209 cols
[2025-05-31 08:25:09] [INFO ] Computed 89 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:09] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-31 08:25:09] [INFO ] Flow matrix only has 219 transitions (discarded 74 similar events)
[2025-05-31 08:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:25:10] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/377 places, 293/2713 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1360 ms. Remains : 209/377 places, 293/2713 transitions.
Support contains 139 out of 209 places after structural reductions.
[2025-05-31 08:25:10] [INFO ] Flatten gal took : 46 ms
[2025-05-31 08:25:10] [INFO ] Flatten gal took : 16 ms
[2025-05-31 08:25:10] [INFO ] Input system was already deterministic with 293 transitions.
Support contains 138 out of 209 places (down from 139) after GAL structural reductions.
RANDOM walk for 34007 steps (7 resets) in 1380 ms. (24 steps per ms) remains 0/70 properties
[2025-05-31 08:25:11] [INFO ] Flatten gal took : 13 ms
[2025-05-31 08:25:11] [INFO ] Flatten gal took : 13 ms
[2025-05-31 08:25:11] [INFO ] Input system was already deterministic with 293 transitions.
Computed a total of 74 stabilizing places and 1 stable transitions
Graph (complete) has 381 edges and 209 vertex of which 136 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Graph (trivial) has 275 edges and 209 vertex of which 122 / 209 are part of one of the 17 SCC in 2 ms
Free SCC test removed 105 places
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Graph (complete) has 139 edges and 104 vertex of which 33 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.1 ms
Discarding 71 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 33 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 49
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 19 place count 18 transition count 35
Iterating global reduction 2 with 13 rules applied. Total rules applied 32 place count 18 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 18 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 18 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 17 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 17 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 17 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 17 transition count 29
Applied a total of 40 rules in 16 ms. Remains 17 /209 variables (removed 192) and now considering 29/293 (removed 264) transitions.
[2025-05-31 08:25:11] [INFO ] Flow matrix only has 17 transitions (discarded 12 similar events)
// Phase 1: matrix 17 rows 17 cols
[2025-05-31 08:25:11] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:11] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-31 08:25:11] [INFO ] Flow matrix only has 17 transitions (discarded 12 similar events)
[2025-05-31 08:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:25:11] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:25:11] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2025-05-31 08:25:11] [INFO ] Flow matrix only has 17 transitions (discarded 12 similar events)
[2025-05-31 08:25:11] [INFO ] Invariant cache hit.
[2025-05-31 08:25:11] [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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 16/33 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 24 constraints, problems are : Problem set: 0 solved, 28 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 16/33 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 52 constraints, problems are : Problem set: 0 solved, 28 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1147ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1153ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/209 places, 29/293 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1326 ms. Remains : 17/209 places, 29/293 transitions.
[2025-05-31 08:25:12] [INFO ] Flatten gal took : 3 ms
[2025-05-31 08:25:12] [INFO ] Flatten gal took : 2 ms
[2025-05-31 08:25:12] [INFO ] Input system was already deterministic with 29 transitions.
[2025-05-31 08:25:12] [INFO ] Flatten gal took : 1 ms
[2025-05-31 08:25:12] [INFO ] Flatten gal took : 1 ms
[2025-05-31 08:25:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11409008603382630943.gal : 1 ms
[2025-05-31 08:25:12] [INFO ] Time to serialize properties into /tmp/CTLFireability448118025552450324.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/CTLFireability11409008603382630943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability448118025552450324.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,61,0.016895,3872,2,39,5,144,6,0,78,95,0
Converting to forward existential form...Done !
original formula: EF(!(A(((p71!=1)||((p97==1)&&(p305==1))) U ((p108==1)&&(p326==1)))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(((p108==1)&&(p326==1)))) * (!(((p71!=1)||((p97==1)&&(p305==1)))) * !(((p108==1)&&(p326...235
Hit Full ! (commute/partial/dont) 25/0/4
(forward)formula 0,1,0.018597,4000,1,0,10,201,19,3,170,116,5
FORMULA DLCround-PT-11a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 142 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 83 place count 126 transition count 261
Iterating global reduction 1 with 16 rules applied. Total rules applied 99 place count 126 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 126 transition count 260
Applied a total of 100 rules in 9 ms. Remains 126 /209 variables (removed 83) and now considering 260/293 (removed 33) transitions.
[2025-05-31 08:25:13] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
// Phase 1: matrix 202 rows 126 cols
[2025-05-31 08:25:13] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-31 08:25:13] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
[2025-05-31 08:25:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:25:13] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2025-05-31 08:25:13] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
[2025-05-31 08:25:13] [INFO ] Invariant cache hit.
[2025-05-31 08:25:13] [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/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 6/126 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 201/327 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 1/328 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 149 constraints, problems are : Problem set: 0 solved, 259 unsolved in 14506 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 6/126 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 201/327 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 259/407 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 408 constraints, problems are : Problem set: 0 solved, 259 unsolved in 13549 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28117ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 28121ms
Starting structural reductions in LTL mode, iteration 1 : 126/209 places, 260/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28248 ms. Remains : 126/209 places, 260/293 transitions.
[2025-05-31 08:25:41] [INFO ] Flatten gal took : 12 ms
[2025-05-31 08:25:41] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:25:41] [INFO ] Input system was already deterministic with 260 transitions.
[2025-05-31 08:25:41] [INFO ] Flatten gal took : 9 ms
[2025-05-31 08:25:41] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:25:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5210013479418562853.gal : 3 ms
[2025-05-31 08:25:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3067878299087757017.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/CTLFireability5210013479418562853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3067878299087757017.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.52298e+13,0.036027,4820,2,355,5,1432,6,0,689,1028,0
Converting to forward existential form...Done !
original formula: (E(AG(AX((((p2==1)&&(p237==1))&&((p66==1)&&(p284==1))))) U !(EF(AX(AG(((p84==1)&&(p192==1))))))) * (EX(EF((EF(((p119==0)||(p226==0))) * A...213
=> equivalent forward existential formula: ([((FwdU(EY((Init * E(!(E(TRUE U !(!(EX(!((((p2==1)&&(p237==1))&&((p66==1)&&(p284==1))))))))) U !(E(TRUE U !(EX(...487
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.119625,7508,1,0,10,19650,23,2,3038,3060,16
FORMULA DLCround-PT-11a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 141 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 84 place count 125 transition count 261
Iterating global reduction 1 with 16 rules applied. Total rules applied 100 place count 125 transition count 261
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 125 transition count 259
Applied a total of 102 rules in 5 ms. Remains 125 /209 variables (removed 84) and now considering 259/293 (removed 34) transitions.
[2025-05-31 08:25:41] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
// Phase 1: matrix 201 rows 125 cols
[2025-05-31 08:25:41] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-31 08:25:41] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2025-05-31 08:25:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:25:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:25:41] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-05-31 08:25:41] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2025-05-31 08:25:41] [INFO ] Invariant cache hit.
[2025-05-31 08:25:41] [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/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 5/125 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 200/325 variables, 125/146 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 1/326 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 0/326 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 147 constraints, problems are : Problem set: 0 solved, 258 unsolved in 14236 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 5/125 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 200/325 variables, 125/146 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 258/404 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 405 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13047 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27305ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 27306ms
Starting structural reductions in LTL mode, iteration 1 : 125/209 places, 259/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27436 ms. Remains : 125/209 places, 259/293 transitions.
[2025-05-31 08:26:08] [INFO ] Flatten gal took : 10 ms
[2025-05-31 08:26:08] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:26:08] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-31 08:26:08] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:26:08] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:26:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4738501248290552851.gal : 3 ms
[2025-05-31 08:26:08] [INFO ] Time to serialize properties into /tmp/CTLFireability258508441578838127.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/CTLFireability4738501248290552851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability258508441578838127.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.1153e+13,0.028911,4864,2,353,5,1427,6,0,687,1030,0
Converting to forward existential form...Done !
original formula: !(A((((!((p67==1)&&(p175==1)))||(!((!((p137==1)&&(p361==1)))||((p102==1)&&(p327==1))))) + AX(AG((((p142==1)&&(p136==1))&&(p362==1))))) U ...185
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(!(((p82==1)&&(p194==1)))))))) * !((((!((p67==1)&&(p175==1)))||(!((!((p137==1)&...371
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.101791,7424,1,0,11,17895,18,3,3123,3106,13
FORMULA DLCround-PT-11a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 149 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 76 place count 133 transition count 261
Iterating global reduction 1 with 16 rules applied. Total rules applied 92 place count 133 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 133 transition count 259
Applied a total of 94 rules in 4 ms. Remains 133 /209 variables (removed 76) and now considering 259/293 (removed 34) transitions.
[2025-05-31 08:26:09] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
// Phase 1: matrix 201 rows 133 cols
[2025-05-31 08:26:09] [INFO ] Computed 29 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:26:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-31 08:26:09] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2025-05-31 08:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:26:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:26:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-05-31 08:26:09] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2025-05-31 08:26:09] [INFO ] Invariant cache hit.
[2025-05-31 08:26:09] [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/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 13/133 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 200/333 variables, 133/162 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 163 constraints, problems are : Problem set: 0 solved, 258 unsolved in 14407 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 133/133 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 13/133 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 200/333 variables, 133/162 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 258/420 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 1/334 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 421 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13222 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 133/133 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27651ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 27652ms
Starting structural reductions in LTL mode, iteration 1 : 133/209 places, 259/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27768 ms. Remains : 133/209 places, 259/293 transitions.
[2025-05-31 08:26:36] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:26:36] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:26:36] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-31 08:26:36] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:26:36] [INFO ] Flatten gal took : 10 ms
[2025-05-31 08:26:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9653608341888380107.gal : 1 ms
[2025-05-31 08:26:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7786099355406666495.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/CTLFireability9653608341888380107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7786099355406666495.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.52298e+13,0.030508,4904,2,369,5,1474,6,0,695,1047,0
Converting to forward existential form...Done !
original formula: E(!(AG(EF(((p117==1)&&(p274==1))))) U ((((p7==1)&&(p190==1)) * (AG(AF(((p117==1)&&(p215==1)))) * !(((((p88==1)&&(p300==1)) + AF((((p116==...431
=> equivalent forward existential formula: ([((FwdU(Init,!(!(E(TRUE U !(E(TRUE U ((p117==1)&&(p274==1)))))))) * (((p7==1)&&(p190==1)) * (!(E(TRUE U !(!(EG(...1348
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 255/0/4
(forward)formula 0,0,0.149025,8744,1,0,19,22653,50,3,3332,5284,23
FORMULA DLCround-PT-11a-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 143 transition count 293
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 81 place count 128 transition count 263
Iterating global reduction 1 with 15 rules applied. Total rules applied 96 place count 128 transition count 263
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 128 transition count 261
Applied a total of 98 rules in 3 ms. Remains 128 /209 variables (removed 81) and now considering 261/293 (removed 32) transitions.
[2025-05-31 08:26:37] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
// Phase 1: matrix 202 rows 128 cols
[2025-05-31 08:26:37] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:26:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-31 08:26:37] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
[2025-05-31 08:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:26:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:26:37] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2025-05-31 08:26:37] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
[2025-05-31 08:26:37] [INFO ] Invariant cache hit.
[2025-05-31 08:26: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/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 7/128 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 201/329 variables, 128/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 13765 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 7/128 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 201/329 variables, 128/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 260/411 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 1/330 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 13231 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27012ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 27014ms
Starting structural reductions in LTL mode, iteration 1 : 128/209 places, 261/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27122 ms. Remains : 128/209 places, 261/293 transitions.
[2025-05-31 08:27:04] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:27:04] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:27:04] [INFO ] Input system was already deterministic with 261 transitions.
[2025-05-31 08:27:04] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:27:04] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:27:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3467534707046242867.gal : 1 ms
[2025-05-31 08:27:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13141804922721028399.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/CTLFireability3467534707046242867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13141804922721028399.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,6.87971e+13,0.030952,4876,2,360,5,1452,6,0,694,1041,0
Converting to forward existential form...Done !
original formula: (E(EF(AX(((!((p99==1)&&(p327==1)))||(p5!=1)))) U A(!(AF(((p105==1)&&(p332==1)))) U ((p92==1)&&(((!(((p112==1)&&(p335==1))||((p76==1)&&(p1...297
=> equivalent forward existential formula: ([(EY(FwdU((FwdU(EY((Init * E(E(TRUE U !(EX(!(((!((p99==1)&&(p327==1)))||(p5!=1)))))) U !((E(!(((p92==1)&&(((!((...1289
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 243/0/18
Hit Full ! (commute/partial/dont) 252/0/9
(forward)formula 0,1,0.161502,9356,1,0,22,26906,45,10,3595,10150,27
FORMULA DLCround-PT-11a-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 : 209/209 places, 293/293 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 140 transition count 293
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 86 place count 123 transition count 259
Iterating global reduction 1 with 17 rules applied. Total rules applied 103 place count 123 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 123 transition count 258
Applied a total of 104 rules in 5 ms. Remains 123 /209 variables (removed 86) and now considering 258/293 (removed 35) transitions.
[2025-05-31 08:27:04] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
// Phase 1: matrix 201 rows 123 cols
[2025-05-31 08:27:04] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:04] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-31 08:27:04] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2025-05-31 08:27:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:27:04] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-31 08:27:04] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2025-05-31 08:27:04] [INFO ] Invariant cache hit.
[2025-05-31 08:27: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/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 4/123 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 200/323 variables, 123/143 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 144 constraints, problems are : Problem set: 0 solved, 257 unsolved in 14170 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 123/123 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 4/123 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 200/323 variables, 123/143 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 257/400 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/324 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 401 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12764 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 123/123 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26951ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 26952ms
Starting structural reductions in LTL mode, iteration 1 : 123/209 places, 258/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27067 ms. Remains : 123/209 places, 258/293 transitions.
[2025-05-31 08:27:31] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:27:31] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:27:31] [INFO ] Input system was already deterministic with 258 transitions.
[2025-05-31 08:27:31] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:27:31] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:27:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8436369665095679657.gal : 1 ms
[2025-05-31 08:27:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9990536988835364643.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/CTLFireability8436369665095679657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9990536988835364643.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,5.79821e+13,0.029099,4864,2,348,5,1406,6,0,682,1013,0
Converting to forward existential form...Done !
original formula: EF(EX(A(A(EX(((p85==1)&&(p310==1))) U !(((p1==1)&&(p165==1)))) U (((p55==1)&&(p270==1)) * AF(((p132==1)&&(p234==1)))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!((((p55==1)&&(p270==1)) * !(EG(!(((p132==1)&&(p234==1)))))))))) * !(E(!((((p55==1...419
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 254/4/4
Using saturation style SCC detection
(forward)formula 0,1,0.149446,10240,1,0,25,34552,34,17,3203,19083,27
FORMULA DLCround-PT-11a-CTLFireability-2025-05 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 : 209/209 places, 293/293 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 139 transition count 293
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 89 place count 120 transition count 255
Iterating global reduction 1 with 19 rules applied. Total rules applied 108 place count 120 transition count 255
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 120 transition count 253
Applied a total of 110 rules in 3 ms. Remains 120 /209 variables (removed 89) and now considering 253/293 (removed 40) transitions.
[2025-05-31 08:27:31] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 120 cols
[2025-05-31 08:27:31] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:31] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-31 08:27:31] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2025-05-31 08:27:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:27:31] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-05-31 08:27:31] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2025-05-31 08:27:31] [INFO ] Invariant cache hit.
[2025-05-31 08:27:31] [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/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 3/120 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/317 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 1/318 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 140 constraints, problems are : Problem set: 0 solved, 252 unsolved in 13449 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 3/120 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/317 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 252/391 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/318 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 392 constraints, problems are : Problem set: 0 solved, 252 unsolved in 11999 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25479ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 25479ms
Starting structural reductions in LTL mode, iteration 1 : 120/209 places, 253/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25600 ms. Remains : 120/209 places, 253/293 transitions.
[2025-05-31 08:27:57] [INFO ] Flatten gal took : 12 ms
[2025-05-31 08:27:57] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:27:57] [INFO ] Input system was already deterministic with 253 transitions.
[2025-05-31 08:27:57] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:27:57] [INFO ] Flatten gal took : 5 ms
[2025-05-31 08:27:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1518263488537592571.gal : 2 ms
[2025-05-31 08:27:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4840909699560150954.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/CTLFireability1518263488537592571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4840909699560150954.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,4.29497e+13,0.046555,4792,2,340,5,1370,6,0,670,991,0
Converting to forward existential form...Done !
original formula: EG(((EX(AG(((p146==0)||(p374==0)))) + (p28==0)) + ((p220==0)||((p117==1)&&(p296==1)))))
=> equivalent forward existential formula: [FwdG(Init,((EX(!(E(TRUE U !(((p146==0)||(p374==0)))))) + (p28==0)) + ((p220==0)||((p117==1)&&(p296==1)))))] != ...160
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.114609,7224,1,0,11,16726,23,3,2923,2823,14
FORMULA DLCround-PT-11a-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Graph (trivial) has 258 edges and 209 vertex of which 111 / 209 are part of one of the 16 SCC in 1 ms
Free SCC test removed 95 places
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 160 edges and 114 vertex of which 46 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.1 ms
Discarding 68 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 70
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 44 transition count 68
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 42 transition count 67
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 22 place count 31 transition count 55
Iterating global reduction 3 with 11 rules applied. Total rules applied 33 place count 31 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 31 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 31 transition count 52
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 29 transition count 50
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 29 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 29 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 29 transition count 47
Applied a total of 45 rules in 32 ms. Remains 29 /209 variables (removed 180) and now considering 47/293 (removed 246) transitions.
[2025-05-31 08:27:57] [INFO ] Flow matrix only has 30 transitions (discarded 17 similar events)
// Phase 1: matrix 30 rows 29 cols
[2025-05-31 08:27:57] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:57] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-31 08:27:57] [INFO ] Flow matrix only has 30 transitions (discarded 17 similar events)
[2025-05-31 08:27:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:27:57] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:27:57] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2025-05-31 08:27:57] [INFO ] Flow matrix only has 30 transitions (discarded 17 similar events)
[2025-05-31 08:27:57] [INFO ] Invariant cache hit.
[2025-05-31 08:27:57] [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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 5/29 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 29/58 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 41 constraints, problems are : Problem set: 0 solved, 46 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 5/29 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 29/58 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 46/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 87 constraints, problems are : Problem set: 0 solved, 46 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1594ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1594ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/209 places, 47/293 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1759 ms. Remains : 29/209 places, 47/293 transitions.
[2025-05-31 08:27:59] [INFO ] Flatten gal took : 3 ms
[2025-05-31 08:27:59] [INFO ] Flatten gal took : 2 ms
[2025-05-31 08:27:59] [INFO ] Input system was already deterministic with 47 transitions.
[2025-05-31 08:27:59] [INFO ] Flatten gal took : 1 ms
[2025-05-31 08:27:59] [INFO ] Flatten gal took : 0 ms
[2025-05-31 08:27:59] [INFO ] Time to serialize gal into /tmp/CTLFireability3777069729574957388.gal : 0 ms
[2025-05-31 08:27:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9478860218412930026.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/CTLFireability3777069729574957388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9478860218412930026.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,1351,0.005034,3896,2,71,5,247,6,0,130,163,0
Converting to forward existential form...Done !
original formula: AG(EF((((p84==1)&&(p308==1)) * (A(((p117==1)&&(p329==1)) U !(((p145==1)&&(p371==1)))) * (A(((p21==1)&&(p234==1)) U ((p67==1)&&(p281==1)))...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p84==1)&&(p308==1)) * (!((E(!(!(((p145==1)&&(p371==1)))) U (!(((p117==1)&&(p32...397
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 40/0/7
Hit Full ! (commute/partial/dont) 44/3/3
(forward)formula 0,1,0.016893,4664,1,0,16,1379,43,4,710,735,21
FORMULA DLCround-PT-11a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Graph (trivial) has 280 edges and 209 vertex of which 128 / 209 are part of one of the 16 SCC in 0 ms
Free SCC test removed 112 places
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Graph (complete) has 123 edges and 97 vertex of which 25 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.0 ms
Discarding 72 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 34
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 17 place count 11 transition count 21
Iterating global reduction 2 with 13 rules applied. Total rules applied 30 place count 11 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 11 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 11 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 10 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 10 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 10 transition count 17
Applied a total of 36 rules in 4 ms. Remains 10 /209 variables (removed 199) and now considering 17/293 (removed 276) transitions.
[2025-05-31 08:27:59] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
// Phase 1: matrix 11 rows 10 cols
[2025-05-31 08:27:59] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-31 08:27:59] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2025-05-31 08:27:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:27:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:27:59] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2025-05-31 08:27:59] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2025-05-31 08:27:59] [INFO ] Invariant cache hit.
[2025-05-31 08:27:59] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/20 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 15 constraints, problems are : Problem set: 0 solved, 16 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/20 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 31 constraints, problems are : Problem set: 0 solved, 16 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 394ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/209 places, 17/293 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 446 ms. Remains : 10/209 places, 17/293 transitions.
[2025-05-31 08:27:59] [INFO ] Flatten gal took : 1 ms
[2025-05-31 08:27:59] [INFO ] Flatten gal took : 0 ms
[2025-05-31 08:27:59] [INFO ] Input system was already deterministic with 17 transitions.
[2025-05-31 08:27:59] [INFO ] Flatten gal took : 0 ms
[2025-05-31 08:27:59] [INFO ] Flatten gal took : 1 ms
[2025-05-31 08:27:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12616609453326543311.gal : 0 ms
[2025-05-31 08:27:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7279317166899929298.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/CTLFireability12616609453326543311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7279317166899929298.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,11,0.002607,3788,2,20,5,74,6,0,47,48,0
Converting to forward existential form...Done !
original formula: AG(!(E(((p67==1)&&(p287==1)) U (p132==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),((p67==1)&&(p287==1))) * (p132==1))] = FALSE
Hit Full ! (commute/partial/dont) 10/7/7
(forward)formula 0,0,0.003553,3916,1,0,7,74,15,1,99,48,4
FORMULA DLCround-PT-11a-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 137 transition count 293
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 90 place count 119 transition count 257
Iterating global reduction 1 with 18 rules applied. Total rules applied 108 place count 119 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 119 transition count 256
Applied a total of 109 rules in 2 ms. Remains 119 /209 variables (removed 90) and now considering 256/293 (removed 37) transitions.
[2025-05-31 08:27:59] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
// Phase 1: matrix 200 rows 119 cols
[2025-05-31 08:27:59] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-31 08:27:59] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2025-05-31 08:27:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:27:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:27:59] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2025-05-31 08:27:59] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2025-05-31 08:27:59] [INFO ] Invariant cache hit.
[2025-05-31 08:27:59] [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/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/318 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 1/319 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 0/319 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 137 constraints, problems are : Problem set: 0 solved, 255 unsolved in 13634 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/318 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 255/391 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 392 constraints, problems are : Problem set: 0 solved, 255 unsolved in 12140 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25789ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 25790ms
Starting structural reductions in LTL mode, iteration 1 : 119/209 places, 256/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25893 ms. Remains : 119/209 places, 256/293 transitions.
[2025-05-31 08:28:25] [INFO ] Flatten gal took : 12 ms
[2025-05-31 08:28:25] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:28:25] [INFO ] Input system was already deterministic with 256 transitions.
[2025-05-31 08:28:25] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:28:25] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:28:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11693733265600553562.gal : 1 ms
[2025-05-31 08:28:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8702901059503212230.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/CTLFireability11693733265600553562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8702901059503212230.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.15396e+13,0.029604,4796,2,339,5,1373,6,0,674,993,0
Converting to forward existential form...Done !
original formula: AX(EF((((p1==1)&&(p136==1))&&(p236==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((p1==1)&&(p136==1))&&(p236==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.085533,6844,1,0,6,16169,14,0,2800,1721,5
FORMULA DLCround-PT-11a-CTLFireability-2025-09 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 : 209/209 places, 293/293 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 141 transition count 293
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 85 place count 124 transition count 259
Iterating global reduction 1 with 17 rules applied. Total rules applied 102 place count 124 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 124 transition count 257
Applied a total of 104 rules in 2 ms. Remains 124 /209 variables (removed 85) and now considering 257/293 (removed 36) transitions.
[2025-05-31 08:28:25] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 124 cols
[2025-05-31 08:28:25] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:28:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 08:28:25] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2025-05-31 08:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:28:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:28:25] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-05-31 08:28:25] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2025-05-31 08:28:25] [INFO ] Invariant cache hit.
[2025-05-31 08:28:25] [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/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/323 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 146 constraints, problems are : Problem set: 0 solved, 256 unsolved in 14046 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/323 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 256/401 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/324 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 402 constraints, problems are : Problem set: 0 solved, 256 unsolved in 12484 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26544ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 26545ms
Starting structural reductions in LTL mode, iteration 1 : 124/209 places, 257/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26679 ms. Remains : 124/209 places, 257/293 transitions.
[2025-05-31 08:28:52] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:28:52] [INFO ] Flatten gal took : 5 ms
[2025-05-31 08:28:52] [INFO ] Input system was already deterministic with 257 transitions.
[2025-05-31 08:28:52] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:28:52] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:28:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3445482362293665296.gal : 1 ms
[2025-05-31 08:28:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14307697883205106577.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/CTLFireability3445482362293665296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14307697883205106577.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.43582e+13,0.03764,4860,2,350,5,1410,6,0,682,1013,0
Converting to forward existential form...Done !
original formula: EG(!(E(!(EX(((p137==1)&&(p376==1)))) U (E((((p117==1)&&(p216==1))||((p108==1)&&(p206==1))) U ((p101==1)&&(p329==1))) + ((p91==1)&&(p321==...162
=> equivalent forward existential formula: [FwdG(Init,!(E(!(EX(((p137==1)&&(p376==1)))) U (E((((p117==1)&&(p216==1))||((p108==1)&&(p206==1))) U ((p101==1)&...205
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 243/0/14
(forward)formula 0,0,0.12189,8060,1,0,24,23185,28,12,3005,6967,21
FORMULA DLCround-PT-11a-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Graph (trivial) has 248 edges and 209 vertex of which 102 / 209 are part of one of the 16 SCC in 2 ms
Free SCC test removed 86 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Graph (complete) has 183 edges and 123 vertex of which 58 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.2 ms
Discarding 65 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 58 transition count 92
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 55 transition count 90
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 53 transition count 89
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 22 place count 44 transition count 79
Iterating global reduction 3 with 9 rules applied. Total rules applied 31 place count 44 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 37 place count 44 transition count 73
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 44 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 41 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 41 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 41 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 41 transition count 65
Applied a total of 51 rules in 13 ms. Remains 41 /209 variables (removed 168) and now considering 65/293 (removed 228) transitions.
[2025-05-31 08:28:52] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
// Phase 1: matrix 41 rows 41 cols
[2025-05-31 08:28:52] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:28:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 08:28:52] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
[2025-05-31 08:28:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:28:52] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:28:52] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-05-31 08:28:52] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
[2025-05-31 08:28:52] [INFO ] Invariant cache hit.
[2025-05-31 08:28:52] [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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 8/41 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 40/81 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/82 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 58 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1236 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 8/41 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 40/81 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 64/121 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 1/82 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 122 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2461ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2461ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/209 places, 65/293 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2535 ms. Remains : 41/209 places, 65/293 transitions.
[2025-05-31 08:28:55] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:28:55] [INFO ] Flatten gal took : 3 ms
[2025-05-31 08:28:55] [INFO ] Input system was already deterministic with 65 transitions.
[2025-05-31 08:28:55] [INFO ] Flatten gal took : 1 ms
[2025-05-31 08:28:55] [INFO ] Flatten gal took : 2 ms
[2025-05-31 08:28:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2846453614104041788.gal : 0 ms
[2025-05-31 08:28:55] [INFO ] Time to serialize properties into /tmp/CTLFireability18050210504111192827.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/CTLFireability2846453614104041788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18050210504111192827.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,15121,0.01162,4076,2,106,5,371,6,0,180,253,0
Converting to forward existential form...Done !
original formula: AG(A(((p137==1)&&(p287==1)) U (E(!((((p34==1)&&(p250==1))||((p4==1)&&(p213==1)))) U ((!((p123==1)&&(p228==1)))||(!((p97==1)&&(p197==1))))...237
=> equivalent forward existential formula: ([(FwdU(((FwdU(FwdU(Init,TRUE),!((E(!((((p34==1)&&(p250==1))||((p4==1)&&(p213==1)))) U ((!((p123==1)&&(p228==1))...751
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 58/3/7
(forward)formula 0,0,0.024649,4588,1,0,12,2693,30,3,959,1091,16
FORMULA DLCround-PT-11a-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 146 transition count 293
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 78 place count 131 transition count 263
Iterating global reduction 1 with 15 rules applied. Total rules applied 93 place count 131 transition count 263
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 131 transition count 262
Applied a total of 94 rules in 3 ms. Remains 131 /209 variables (removed 78) and now considering 262/293 (removed 31) transitions.
[2025-05-31 08:28:55] [INFO ] Flow matrix only has 203 transitions (discarded 59 similar events)
// Phase 1: matrix 203 rows 131 cols
[2025-05-31 08:28:55] [INFO ] Computed 26 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:28:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-31 08:28:55] [INFO ] Flow matrix only has 203 transitions (discarded 59 similar events)
[2025-05-31 08:28:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:28:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:28:55] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-05-31 08:28:55] [INFO ] Flow matrix only has 203 transitions (discarded 59 similar events)
[2025-05-31 08:28:55] [INFO ] Invariant cache hit.
[2025-05-31 08:28:55] [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/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 10/131 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 202/333 variables, 131/157 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 158 constraints, problems are : Problem set: 0 solved, 261 unsolved in 14848 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 131/131 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 10/131 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 202/333 variables, 131/157 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 261/418 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/334 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 419 constraints, problems are : Problem set: 0 solved, 261 unsolved in 13413 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 131/131 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28276ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 28277ms
Starting structural reductions in LTL mode, iteration 1 : 131/209 places, 262/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28399 ms. Remains : 131/209 places, 262/293 transitions.
[2025-05-31 08:29:23] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:29:23] [INFO ] Flatten gal took : 5 ms
[2025-05-31 08:29:23] [INFO ] Input system was already deterministic with 262 transitions.
[2025-05-31 08:29:23] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:29:23] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:29:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6318796469270785413.gal : 1 ms
[2025-05-31 08:29:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1766387845021749168.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/CTLFireability6318796469270785413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1766387845021749168.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.33835e+13,0.039965,4908,2,366,5,1472,6,0,698,1051,0
Converting to forward existential form...Done !
original formula: (EG((AF(((EF(((p21==1)&&(p161==1))) + (p140==0)) + ((p38==1)&&(p248==1)))) + ((AX(EF(((p107==1)&&(p251==1)))) * !(A(((p89==1)&&(p204==1))...349
=> equivalent forward existential formula: ([(Init * !(EG((!(EG(!(((E(TRUE U ((p21==1)&&(p161==1))) + (p140==0)) + ((p38==1)&&(p248==1)))))) + ((!(EX(!(E(T...524
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.122041,7724,1,0,13,19762,22,6,3096,4326,14
FORMULA DLCround-PT-11a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 141 transition count 293
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 85 place count 124 transition count 259
Iterating global reduction 1 with 17 rules applied. Total rules applied 102 place count 124 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 124 transition count 257
Applied a total of 104 rules in 2 ms. Remains 124 /209 variables (removed 85) and now considering 257/293 (removed 36) transitions.
[2025-05-31 08:29:23] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 124 cols
[2025-05-31 08:29:23] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:29:23] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-31 08:29:23] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2025-05-31 08:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:29:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:29:23] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-05-31 08:29:23] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2025-05-31 08:29:23] [INFO ] Invariant cache hit.
[2025-05-31 08:29: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/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/323 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 146 constraints, problems are : Problem set: 0 solved, 256 unsolved in 13895 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/323 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 256/401 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/324 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 402 constraints, problems are : Problem set: 0 solved, 256 unsolved in 12675 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26583ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 26584ms
Starting structural reductions in LTL mode, iteration 1 : 124/209 places, 257/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26699 ms. Remains : 124/209 places, 257/293 transitions.
[2025-05-31 08:29:50] [INFO ] Flatten gal took : 8 ms
[2025-05-31 08:29:50] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:29:50] [INFO ] Input system was already deterministic with 257 transitions.
[2025-05-31 08:29:50] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:29:50] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:29:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9601704126399835039.gal : 1 ms
[2025-05-31 08:29:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15366048794146473087.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/CTLFireability9601704126399835039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15366048794146473087.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.43582e+13,0.037332,4856,2,350,5,1411,6,0,682,1016,0
Converting to forward existential form...Done !
original formula: A((AF((AF(!(((p65==1)&&(p180==1)))) + !(AX((p70==1))))) + E(EF(!(A(((p107==1)&&(p340==1)) U ((p7==1)&&(p230==1))))) U (((p144==1)&&(p366=...213
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(EX(!((p49==1)))))))))))) * !(E(!(!(!(EG(!(!(EX(!((p49==1))))))))) U (!((!(EG(!((!(EG...463
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.102287,7544,1,0,7,18581,23,1,2781,3005,8
FORMULA DLCround-PT-11a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 293/293 transitions.
Graph (trivial) has 243 edges and 209 vertex of which 100 / 209 are part of one of the 15 SCC in 2 ms
Free SCC test removed 85 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Graph (complete) has 183 edges and 124 vertex of which 60 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 60 transition count 92
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 57 transition count 88
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 17 place count 53 transition count 87
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 27 place count 43 transition count 75
Iterating global reduction 3 with 10 rules applied. Total rules applied 37 place count 43 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 42 place count 43 transition count 70
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 43 transition count 70
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 40 transition count 67
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 40 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 40 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 40 transition count 62
Applied a total of 56 rules in 20 ms. Remains 40 /209 variables (removed 169) and now considering 62/293 (removed 231) transitions.
[2025-05-31 08:29:50] [INFO ] Flow matrix only has 39 transitions (discarded 23 similar events)
// Phase 1: matrix 39 rows 40 cols
[2025-05-31 08:29:50] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:29:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-31 08:29:50] [INFO ] Flow matrix only has 39 transitions (discarded 23 similar events)
[2025-05-31 08:29:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:29:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 08:29:50] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:29:50] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-05-31 08:29:50] [INFO ] Flow matrix only has 39 transitions (discarded 23 similar events)
[2025-05-31 08:29:50] [INFO ] Invariant cache hit.
[2025-05-31 08:29:50] [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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 9/40 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 38/78 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 58 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 9/40 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 38/78 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 61/118 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 119 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2469ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2470ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/209 places, 62/293 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2563 ms. Remains : 40/209 places, 62/293 transitions.
[2025-05-31 08:29:53] [INFO ] Flatten gal took : 4 ms
[2025-05-31 08:29:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 08:29:53] [INFO ] Input system was already deterministic with 62 transitions.
[2025-05-31 08:29:53] [INFO ] Flatten gal took : 1 ms
[2025-05-31 08:29:53] [INFO ] Flatten gal took : 1 ms
[2025-05-31 08:29:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15900977562495694619.gal : 0 ms
[2025-05-31 08:29:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13382392178386518.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/CTLFireability15900977562495694619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13382392178386518.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,11665,0.010579,4020,2,113,5,411,6,0,171,276,0
Converting to forward existential form...Done !
original formula: E(((p106==1)&&(p323==1)) U A(AG(((EF(((p71==1)&&(p295==1))) + ((p117==1)&&(p216==1))) + (((p77==1)&&(p248==1))&&((p97==1)&&(p361==1))))) ...270
=> equivalent forward existential formula: [((FwdU(Init,((p106==1)&&(p323==1))) * !(EG(!((!((E(!(!((E(!(((p56==1)&&(p275==1))) U (!(((p21==1)&&(p226==1))) ...1656
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.024757,4660,1,0,10,2000,27,2,853,758,14
FORMULA DLCround-PT-11a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 08:29:53] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:29:53] [INFO ] Flatten gal took : 6 ms
Total runtime 284863 ms.
BK_STOP 1748680193211
--------------------
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-11a"
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-11a, 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-174860067100242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11a.tgz
mv DLCround-PT-11a 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 ;