About the Execution of ITS-Tools for CO4-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1373.128 | 303308.00 | 362319.00 | 727.50 | TFFTFTTTFTFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898500074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CO4-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500074
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 132K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-10-CTLFireability-2024-00
FORMULA_NAME CO4-PT-10-CTLFireability-2024-01
FORMULA_NAME CO4-PT-10-CTLFireability-2024-02
FORMULA_NAME CO4-PT-10-CTLFireability-2024-03
FORMULA_NAME CO4-PT-10-CTLFireability-2024-04
FORMULA_NAME CO4-PT-10-CTLFireability-2024-05
FORMULA_NAME CO4-PT-10-CTLFireability-2024-06
FORMULA_NAME CO4-PT-10-CTLFireability-2024-07
FORMULA_NAME CO4-PT-10-CTLFireability-2024-08
FORMULA_NAME CO4-PT-10-CTLFireability-2024-09
FORMULA_NAME CO4-PT-10-CTLFireability-2024-10
FORMULA_NAME CO4-PT-10-CTLFireability-2024-11
FORMULA_NAME CO4-PT-10-CTLFireability-2024-12
FORMULA_NAME CO4-PT-10-CTLFireability-2024-13
FORMULA_NAME CO4-PT-10-CTLFireability-2024-14
FORMULA_NAME CO4-PT-10-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717351688084
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:08:09] [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]
[2024-06-02 18:08:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:08:09] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-02 18:08:09] [INFO ] Transformed 544 places.
[2024-06-02 18:08:09] [INFO ] Transformed 615 transitions.
[2024-06-02 18:08:09] [INFO ] Found NUPN structural information;
[2024-06-02 18:08:09] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Deduced a syphon composed of 157 places in 15 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-10-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 375 transition count 435
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 63 place count 327 transition count 385
Iterating global reduction 1 with 48 rules applied. Total rules applied 111 place count 327 transition count 385
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 141 place count 297 transition count 355
Iterating global reduction 1 with 30 rules applied. Total rules applied 171 place count 297 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 172 place count 297 transition count 354
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 188 place count 281 transition count 338
Iterating global reduction 2 with 16 rules applied. Total rules applied 204 place count 281 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 281 transition count 337
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 213 place count 273 transition count 329
Iterating global reduction 3 with 8 rules applied. Total rules applied 221 place count 273 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 273 transition count 328
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 225 place count 270 transition count 325
Iterating global reduction 4 with 3 rules applied. Total rules applied 228 place count 270 transition count 325
Applied a total of 228 rules in 101 ms. Remains 270 /387 variables (removed 117) and now considering 325/438 (removed 113) transitions.
// Phase 1: matrix 325 rows 270 cols
[2024-06-02 18:08:09] [INFO ] Computed 4 invariants in 17 ms
[2024-06-02 18:08:10] [INFO ] Implicit Places using invariants in 255 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 293 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 269/387 places, 325/438 transitions.
Applied a total of 0 rules in 10 ms. Remains 269 /269 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 422 ms. Remains : 269/387 places, 325/438 transitions.
Support contains 75 out of 269 places after structural reductions.
[2024-06-02 18:08:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 18:08:10] [INFO ] Flatten gal took : 45 ms
[2024-06-02 18:08:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-10-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:08:10] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:08:10] [INFO ] Input system was already deterministic with 325 transitions.
Support contains 44 out of 269 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (49 resets) in 1603 ms. (24 steps per ms) remains 25/39 properties
BEST_FIRST walk for 4002 steps (20 resets) in 36 ms. (108 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4001 steps (19 resets) in 62 ms. (63 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4000 steps (31 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (36 resets) in 21 ms. (181 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (28 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (19 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (26 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (21 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (29 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (30 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (35 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (24 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (20 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (29 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (35 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (37 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (40 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (33 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (26 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (34 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (43 resets) in 53 ms. (74 steps per ms) remains 21/21 properties
// Phase 1: matrix 325 rows 269 cols
[2024-06-02 18:08:11] [INFO ] Computed 3 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 90/116 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 188/304 variables, 87/113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 165/469 variables, 82/195 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 16/485 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 73/558 variables, 49/249 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 31/589 variables, 19/268 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 14 (OVERLAPS) 5/594 variables, 4/272 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/594 variables, 0/272 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 0/594 variables, 0/272 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 272 constraints, problems are : Problem set: 2 solved, 19 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 76/98 variables, 22/22 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 4/26 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 168/266 variables, 78/104 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 15/119 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 160/426 variables, 77/196 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/196 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 16/442 variables, 3/199 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 2/201 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 95/537 variables, 56/257 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 0/257 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 45/582 variables, 26/283 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 11/593 variables, 7/290 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/593 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 1/594 variables, 1/291 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 18 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/594 variables, 1/292 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/594 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 21 (OVERLAPS) 0/594 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/594 variables, and 292 constraints, problems are : Problem set: 2 solved, 19 unsolved in 3214 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 19/21 constraints, Known Traps: 1/1 constraints]
After SMT, in 4937ms problems are : Problem set: 2 solved, 19 unsolved
Finished Parikh walk after 282 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=141 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 19 properties in 2039 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-06-02 18:08:18] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:08:18] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:08:18] [INFO ] Input system was already deterministic with 325 transitions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 396 edges and 269 vertex of which 259 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Graph (trivial) has 267 edges and 269 vertex of which 3 / 269 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 394 edges and 267 vertex of which 257 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 256 transition count 192
Reduce places removed 119 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 137 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 244 place count 135 transition count 190
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 244 place count 135 transition count 173
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 278 place count 118 transition count 173
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 287 place count 109 transition count 164
Iterating global reduction 3 with 9 rules applied. Total rules applied 296 place count 109 transition count 164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 296 place count 109 transition count 161
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 302 place count 106 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 305 place count 103 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 308 place count 103 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 309 place count 103 transition count 156
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 341 place count 87 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 5 rules applied. Total rules applied 346 place count 87 transition count 135
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 349 place count 85 transition count 134
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 353 place count 81 transition count 130
Iterating global reduction 6 with 4 rules applied. Total rules applied 357 place count 81 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 365 place count 81 transition count 122
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 369 place count 81 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 373 place count 77 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 373 place count 77 transition count 117
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 375 place count 76 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 377 place count 75 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 378 place count 75 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 380 place count 73 transition count 114
Applied a total of 380 rules in 52 ms. Remains 73 /269 variables (removed 196) and now considering 114/325 (removed 211) transitions.
// Phase 1: matrix 114 rows 73 cols
[2024-06-02 18:08:18] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:08:18] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-02 18:08:18] [INFO ] Invariant cache hit.
[2024-06-02 18:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:08:18] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 18:08:18] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-02 18:08:18] [INFO ] Invariant cache hit.
[2024-06-02 18:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 113/185 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/186 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 77 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2108 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 113/185 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 105/180 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 1/187 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 185 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2849 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 4999ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5002ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/269 places, 114/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5361 ms. Remains : 73/269 places, 114/325 transitions.
[2024-06-02 18:08:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:08:23] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:08:23] [INFO ] Input system was already deterministic with 114 transitions.
[2024-06-02 18:08:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:08:23] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:23] [INFO ] Time to serialize gal into /tmp/CTLFireability1100898859034586224.gal : 12 ms
[2024-06-02 18:08:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13408392274761450758.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1100898859034586224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13408392274761450758.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,10081,0.026866,4192,2,214,5,2240,6,0,398,2403,0
Converting to forward existential form...Done !
original formula: E(((p149==1)&&(p530==1)) U EF(((p383==1)&&(p530==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((p149==1)&&(p530==1))),TRUE) * ((p383==1)&&(p530==1)))] != FALSE
Hit Full ! (commute/partial/dont) 86/27/28
(forward)formula 0,1,0.035862,4444,1,0,8,2365,16,1,767,2406,6
FORMULA CO4-PT-10-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Graph (trivial) has 276 edges and 269 vertex of which 3 / 269 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 394 edges and 267 vertex of which 257 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 256 transition count 187
Reduce places removed 124 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 126 rules applied. Total rules applied 252 place count 132 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 254 place count 130 transition count 185
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 254 place count 130 transition count 170
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 284 place count 115 transition count 170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 292 place count 107 transition count 161
Iterating global reduction 3 with 8 rules applied. Total rules applied 300 place count 107 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 107 transition count 160
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 301 place count 107 transition count 157
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 307 place count 104 transition count 157
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 309 place count 102 transition count 155
Iterating global reduction 4 with 2 rules applied. Total rules applied 311 place count 102 transition count 155
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 345 place count 85 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 5 rules applied. Total rules applied 350 place count 85 transition count 133
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 353 place count 83 transition count 132
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 357 place count 79 transition count 128
Iterating global reduction 6 with 4 rules applied. Total rules applied 361 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 370 place count 79 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 374 place count 79 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 378 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 378 place count 75 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 380 place count 74 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 382 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 384 place count 71 transition count 111
Applied a total of 384 rules in 39 ms. Remains 71 /269 variables (removed 198) and now considering 111/325 (removed 214) transitions.
// Phase 1: matrix 111 rows 71 cols
[2024-06-02 18:08:23] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:08:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 18:08:23] [INFO ] Invariant cache hit.
[2024-06-02 18:08:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:08:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-02 18:08:23] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-02 18:08:23] [INFO ] Invariant cache hit.
[2024-06-02 18:08:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3525ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 3527ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/269 places, 111/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3675 ms. Remains : 71/269 places, 111/325 transitions.
[2024-06-02 18:08:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:08:27] [INFO ] Input system was already deterministic with 111 transitions.
[2024-06-02 18:08:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:08:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:08:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1105423895433206288.gal : 1 ms
[2024-06-02 18:08:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5723024317694007585.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1105423895433206288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5723024317694007585.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,8911,0.017465,3924,2,216,5,1933,6,0,387,1734,0
Converting to forward existential form...Done !
original formula: AG(AF((p418==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p418==1)))] = FALSE
Hit Full ! (commute/partial/dont) 108/0/3
(forward)formula 0,0,0.049626,5296,1,0,9,9818,20,3,1857,5379,8
FORMULA CO4-PT-10-CTLFireability-2024-01 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 : 269/269 places, 325/325 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 298
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 298
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 71 place count 225 transition count 281
Iterating global reduction 0 with 17 rules applied. Total rules applied 88 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 225 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 98 place count 217 transition count 271
Iterating global reduction 1 with 8 rules applied. Total rules applied 106 place count 217 transition count 271
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 211 transition count 265
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 211 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 211 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 210 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 210 transition count 262
Applied a total of 122 rules in 21 ms. Remains 210 /269 variables (removed 59) and now considering 262/325 (removed 63) transitions.
// Phase 1: matrix 262 rows 210 cols
[2024-06-02 18:08:27] [INFO ] Computed 3 invariants in 12 ms
[2024-06-02 18:08:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:08:27] [INFO ] Invariant cache hit.
[2024-06-02 18:08:27] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-02 18:08:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/472 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/472 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 215 constraints, problems are : Problem set: 0 solved, 261 unsolved in 10788 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/472 variables, 210/215 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 261/476 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 476 constraints, problems are : Problem set: 0 solved, 261 unsolved in 11660 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 22487ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 22491ms
Starting structural reductions in LTL mode, iteration 1 : 210/269 places, 262/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22687 ms. Remains : 210/269 places, 262/325 transitions.
[2024-06-02 18:08:50] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:08:50] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:50] [INFO ] Input system was already deterministic with 262 transitions.
[2024-06-02 18:08:50] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:08:50] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:08:50] [INFO ] Time to serialize gal into /tmp/CTLFireability13043278492845869982.gal : 2 ms
[2024-06-02 18:08:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17171460649163604803.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13043278492845869982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17171460649163604803.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,414376,0.093795,7464,2,1342,5,13961,6,0,1100,14668,0
Converting to forward existential form...Done !
original formula: E((EX(((((p428==1)&&(p434==1)) + AF(((p428==1)&&(p434==1)))) * EF((p477==1)))) * !((AX((p345==1)) * AX(FALSE)))) U !((!(AX(EF((p374==1)))...217
=> equivalent forward existential formula: [((FwdU(Init,(EX(((((p428==1)&&(p434==1)) + !(EG(!(((p428==1)&&(p434==1)))))) * E(TRUE U (p477==1)))) * !((!(EX(...349
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t22, t30, t40, t41, t43, t44, t45, t46, t47, t49, t52, t96, t15...300
(forward)formula 0,0,10.1862,329792,1,0,1133,1.59805e+06,571,587,6159,2.1551e+06,1467
FORMULA CO4-PT-10-CTLFireability-2024-02 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 : 269/269 places, 325/325 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 298
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 298
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 72 place count 224 transition count 280
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 224 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 224 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 215 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 215 transition count 269
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 117 place count 208 transition count 262
Iterating global reduction 1 with 7 rules applied. Total rules applied 124 place count 208 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 126 place count 208 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 207 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 207 transition count 259
Applied a total of 128 rules in 15 ms. Remains 207 /269 variables (removed 62) and now considering 259/325 (removed 66) transitions.
// Phase 1: matrix 259 rows 207 cols
[2024-06-02 18:09:00] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:09:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:09:00] [INFO ] Invariant cache hit.
[2024-06-02 18:09:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-06-02 18:09:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/466 variables, 207/210 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-02 18:09:05] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:09:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 212 constraints, problems are : Problem set: 0 solved, 258 unsolved in 10779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/466 variables, 207/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 258/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 470 constraints, problems are : Problem set: 0 solved, 258 unsolved in 15100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints]
After SMT, in 25916ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 25919ms
Starting structural reductions in LTL mode, iteration 1 : 207/269 places, 259/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26097 ms. Remains : 207/269 places, 259/325 transitions.
[2024-06-02 18:09:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:09:26] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:09:26] [INFO ] Input system was already deterministic with 259 transitions.
[2024-06-02 18:09:26] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:09:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7738717356726717653.gal : 2 ms
[2024-06-02 18:09:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7387838643077511866.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7738717356726717653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7387838643077511866.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,388534,0.09167,7452,2,1512,5,13663,6,0,1085,14681,0
Converting to forward existential form...Done !
original formula: (AX((p357==0)) * AF((((p148==1) + AG((p425!=1))) * (p532!=1))))
=> equivalent forward existential formula: ([(EY(Init) * !((p357==0)))] = FALSE * [FwdG(Init,!((((p148==1) + !(E(TRUE U !((p425!=1))))) * (p532!=1))))] = F...160
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t18, t22, t30, t41, t45, t51, t95, t129, t141, t150, t151, t152...323
(forward)formula 0,0,3.81925,140120,1,0,616,490088,548,397,5937,985952,734
FORMULA CO4-PT-10-CTLFireability-2024-04 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 : 269/269 places, 325/325 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 240 transition count 296
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 240 transition count 296
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 77 place count 221 transition count 277
Iterating global reduction 0 with 19 rules applied. Total rules applied 96 place count 221 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 221 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 107 place count 212 transition count 266
Iterating global reduction 1 with 9 rules applied. Total rules applied 116 place count 212 transition count 266
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 123 place count 205 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 130 place count 205 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 132 place count 205 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 204 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 204 transition count 256
Applied a total of 134 rules in 11 ms. Remains 204 /269 variables (removed 65) and now considering 256/325 (removed 69) transitions.
// Phase 1: matrix 256 rows 204 cols
[2024-06-02 18:09:30] [INFO ] Computed 3 invariants in 10 ms
[2024-06-02 18:09:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:09:30] [INFO ] Invariant cache hit.
[2024-06-02 18:09:30] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-06-02 18:09:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/460 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 209 constraints, problems are : Problem set: 0 solved, 255 unsolved in 10193 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/460 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 255/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 464 constraints, problems are : Problem set: 0 solved, 255 unsolved in 14408 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints]
After SMT, in 24636ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 24640ms
Starting structural reductions in LTL mode, iteration 1 : 204/269 places, 256/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24809 ms. Remains : 204/269 places, 256/325 transitions.
[2024-06-02 18:09:55] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:09:55] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:55] [INFO ] Input system was already deterministic with 256 transitions.
[2024-06-02 18:09:55] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:55] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1762153055469835938.gal : 1 ms
[2024-06-02 18:09:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8890586453788401289.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1762153055469835938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8890586453788401289.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,377704,0.091439,7388,2,1304,5,13498,6,0,1070,14450,0
Converting to forward existential form...Done !
original formula: EG(EF(EX(AX(EG((p221==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(!(EX(!(EG((p221==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t46, t49, t93, t148, t1...295
(forward)formula 0,1,3.12943,119732,1,0,789,433824,543,476,5974,789835,975
FORMULA CO4-PT-10-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 241 transition count 297
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 241 transition count 297
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 74 place count 223 transition count 279
Iterating global reduction 0 with 18 rules applied. Total rules applied 92 place count 223 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 223 transition count 277
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 215 transition count 269
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 215 transition count 269
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 209 transition count 263
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 209 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 123 place count 209 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 208 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 208 transition count 261
Applied a total of 125 rules in 9 ms. Remains 208 /269 variables (removed 61) and now considering 261/325 (removed 64) transitions.
// Phase 1: matrix 261 rows 208 cols
[2024-06-02 18:09:58] [INFO ] Computed 3 invariants in 6 ms
[2024-06-02 18:09:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:09:58] [INFO ] Invariant cache hit.
[2024-06-02 18:09:58] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-06-02 18:09:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/469 variables, 208/211 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/469 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 213 constraints, problems are : Problem set: 0 solved, 260 unsolved in 10436 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/469 variables, 208/213 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 260/473 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/469 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 473 constraints, problems are : Problem set: 0 solved, 260 unsolved in 13738 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 2/2 constraints]
After SMT, in 24210ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 24212ms
Starting structural reductions in LTL mode, iteration 1 : 208/269 places, 261/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24372 ms. Remains : 208/269 places, 261/325 transitions.
[2024-06-02 18:10:23] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:10:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:23] [INFO ] Input system was already deterministic with 261 transitions.
[2024-06-02 18:10:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16144952696737725635.gal : 2 ms
[2024-06-02 18:10:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4585073796663065599.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16144952696737725635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4585073796663065599.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,430456,0.095452,7452,2,1324,5,13935,6,0,1091,14861,0
Converting to forward existential form...Done !
original formula: EX((EG((p467==0)) + AX((p458==1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),(p467==0))] != FALSE + [(EY(Init) * !(EX(!((p458==1)))))] != FALSE)
Hit Full ! (commute/partial/dont) 259/0/2
(forward)formula 0,1,0.561829,23396,1,0,28,82584,19,4,4794,41056,26
FORMULA CO4-PT-10-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Graph (trivial) has 275 edges and 269 vertex of which 3 / 269 are part of one of the 1 SCC in 14 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 394 edges and 267 vertex of which 257 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 256 transition count 188
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 248 place count 133 transition count 188
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 248 place count 133 transition count 172
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 280 place count 117 transition count 172
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 286 place count 111 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 292 place count 111 transition count 166
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 292 place count 111 transition count 164
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 296 place count 109 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 298 place count 107 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 107 transition count 162
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 336 place count 89 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 5 rules applied. Total rules applied 341 place count 89 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 344 place count 87 transition count 138
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 348 place count 83 transition count 134
Iterating global reduction 4 with 4 rules applied. Total rules applied 352 place count 83 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 361 place count 83 transition count 125
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 365 place count 83 transition count 121
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 369 place count 79 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 78 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 373 place count 76 transition count 118
Applied a total of 373 rules in 41 ms. Remains 76 /269 variables (removed 193) and now considering 118/325 (removed 207) transitions.
// Phase 1: matrix 118 rows 76 cols
[2024-06-02 18:10:23] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:10:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 18:10:23] [INFO ] Invariant cache hit.
[2024-06-02 18:10:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:10:23] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-02 18:10:23] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-02 18:10:23] [INFO ] Invariant cache hit.
[2024-06-02 18:10:23] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-02 18:10:24] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 1/194 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 82 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2412 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 117/193 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 109/190 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-02 18:10:26] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/194 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 192 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2905 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 5346ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 5347ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/269 places, 118/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5484 ms. Remains : 76/269 places, 118/325 transitions.
[2024-06-02 18:10:29] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:10:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:29] [INFO ] Input system was already deterministic with 118 transitions.
[2024-06-02 18:10:29] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:10:29] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:10:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15090037718384230194.gal : 2 ms
[2024-06-02 18:10:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6777919116590372493.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15090037718384230194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6777919116590372493.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,12773,0.021712,4280,2,335,5,2518,6,0,413,2773,0
Converting to forward existential form...Done !
original formula: EG(((p450==0) + EF((p440==1))))
=> equivalent forward existential formula: [FwdG(Init,((p450==0) + E(TRUE U (p440==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t10, t14, t16, t30, t42, t47, t52, t74, t83, t91, t92, t94, t95, t96, t97, t98, t99, ...308
(forward)formula 0,1,0.171511,11672,1,0,265,33354,263,147,2522,46784,305
FORMULA CO4-PT-10-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 298
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 298
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 72 place count 224 transition count 280
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 224 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 224 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 215 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 215 transition count 269
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 117 place count 208 transition count 262
Iterating global reduction 1 with 7 rules applied. Total rules applied 124 place count 208 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 126 place count 208 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 207 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 207 transition count 259
Applied a total of 128 rules in 10 ms. Remains 207 /269 variables (removed 62) and now considering 259/325 (removed 66) transitions.
// Phase 1: matrix 259 rows 207 cols
[2024-06-02 18:10:29] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:10:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 18:10:29] [INFO ] Invariant cache hit.
[2024-06-02 18:10:29] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-06-02 18:10:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/466 variables, 207/210 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-02 18:10:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:10:33] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 212 constraints, problems are : Problem set: 0 solved, 258 unsolved in 10528 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/466 variables, 207/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 258/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 470 constraints, problems are : Problem set: 0 solved, 258 unsolved in 14542 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints]
After SMT, in 25104ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 25107ms
Starting structural reductions in LTL mode, iteration 1 : 207/269 places, 259/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25259 ms. Remains : 207/269 places, 259/325 transitions.
[2024-06-02 18:10:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:10:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:10:54] [INFO ] Input system was already deterministic with 259 transitions.
[2024-06-02 18:10:54] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12260323695762608554.gal : 1 ms
[2024-06-02 18:10:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2884181742191184582.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12260323695762608554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2884181742191184582.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,380362,0.076659,6664,2,1061,5,11089,6,0,1084,11390,0
Converting to forward existential form...Done !
original formula: AG((AX(((p350==0)||((p486==0)&&(p471==0)))) + AX(((p499==0)||(p535==0)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(EX(!(((p350==0)||((p486==0)&&(p471==0))))))))) * !(((p499==0)||(p535==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t42, t43, t44, t45, t47, t50, t151, t185, t240, ...267
(forward)formula 0,1,0.585588,26464,1,0,322,60289,537,217,5780,67861,527
FORMULA CO4-PT-10-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 298
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 298
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 72 place count 224 transition count 280
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 224 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 224 transition count 278
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 216 transition count 270
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 216 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 210 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 210 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 122 place count 210 transition count 262
Applied a total of 122 rules in 8 ms. Remains 210 /269 variables (removed 59) and now considering 262/325 (removed 63) transitions.
// Phase 1: matrix 262 rows 210 cols
[2024-06-02 18:10:55] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:10:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:10:55] [INFO ] Invariant cache hit.
[2024-06-02 18:10:55] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-02 18:10:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/472 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:10:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:10:59] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/472 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 215 constraints, problems are : Problem set: 0 solved, 261 unsolved in 10434 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/472 variables, 210/215 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 261/476 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 476 constraints, problems are : Problem set: 0 solved, 261 unsolved in 13730 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 24201ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 24203ms
Starting structural reductions in LTL mode, iteration 1 : 210/269 places, 262/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24370 ms. Remains : 210/269 places, 262/325 transitions.
[2024-06-02 18:11:19] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:11:19] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:19] [INFO ] Input system was already deterministic with 262 transitions.
[2024-06-02 18:11:19] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:19] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2771111508649986893.gal : 1 ms
[2024-06-02 18:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4394249946169764472.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2771111508649986893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4394249946169764472.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,392140,0.096438,7464,2,1346,5,13950,6,0,1100,15776,0
Converting to forward existential form...Done !
original formula: !(E((EG(((p416==1)&&(p530==1))) * !(AX(FALSE))) U AF(((p420==1) + AX((p203==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(EG(((p416==1)&&(p530==1))) * !(!(EX(!(FALSE)))))) * !(EG(!(((p420==1) + !(EX(!((p203==1)))))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t95, t150, t1...295
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.58648,155900,1,0,611,754285,559,379,6154,872844,835
FORMULA CO4-PT-10-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 298
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 298
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 71 place count 225 transition count 281
Iterating global reduction 0 with 17 rules applied. Total rules applied 88 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 225 transition count 279
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 218 transition count 272
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 218 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 213 transition count 267
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 213 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 213 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 212 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 212 transition count 265
Applied a total of 117 rules in 17 ms. Remains 212 /269 variables (removed 57) and now considering 265/325 (removed 60) transitions.
// Phase 1: matrix 265 rows 212 cols
[2024-06-02 18:11:24] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 18:11:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:11:24] [INFO ] Invariant cache hit.
[2024-06-02 18:11:24] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-06-02 18:11:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/477 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 217 constraints, problems are : Problem set: 0 solved, 264 unsolved in 11041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/477 variables, 212/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 264/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 481 constraints, problems are : Problem set: 0 solved, 264 unsolved in 13116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 24190ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 24192ms
Starting structural reductions in LTL mode, iteration 1 : 212/269 places, 265/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24364 ms. Remains : 212/269 places, 265/325 transitions.
[2024-06-02 18:11:48] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:48] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:48] [INFO ] Input system was already deterministic with 265 transitions.
[2024-06-02 18:11:48] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:48] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13485967563507374173.gal : 1 ms
[2024-06-02 18:11:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14714903919243557291.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13485967563507374173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14714903919243557291.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,429082,0.11363,7464,2,1372,5,14331,6,0,1110,15182,0
Converting to forward existential form...Done !
original formula: EF((E(!(AX(AF((p515==1)))) U ((p216!=1) * AX((p250!=1)))) * EG((EX((p458==1)) * AG((p343==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(!(!(EX(!(!(EG(!((p515==1)))))))) U ((p216!=1) * !(EX(!((p250!=1))))))),(EX((p458==1))...195
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t22, t23, t31, t40, t42, t43, t44, t45, t46, t49, t51, t54, t98...305
(forward)formula 0,0,4.89576,165376,1,0,690,789161,571,378,6214,962060,941
FORMULA CO4-PT-10-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 298
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 298
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 70 place count 226 transition count 282
Iterating global reduction 0 with 16 rules applied. Total rules applied 86 place count 226 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 88 place count 226 transition count 280
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 218 transition count 272
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 218 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 213 transition count 267
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 213 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 116 place count 213 transition count 265
Applied a total of 116 rules in 8 ms. Remains 213 /269 variables (removed 56) and now considering 265/325 (removed 60) transitions.
// Phase 1: matrix 265 rows 213 cols
[2024-06-02 18:11:53] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:11:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 18:11:53] [INFO ] Invariant cache hit.
[2024-06-02 18:11:53] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-06-02 18:11:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/478 variables, 213/216 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:11:58] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:11:58] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 218 constraints, problems are : Problem set: 0 solved, 264 unsolved in 10924 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/478 variables, 213/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 264/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/478 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 482 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15875 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 26830ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 26832ms
Starting structural reductions in LTL mode, iteration 1 : 213/269 places, 265/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26992 ms. Remains : 213/269 places, 265/325 transitions.
[2024-06-02 18:12:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:12:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:20] [INFO ] Input system was already deterministic with 265 transitions.
[2024-06-02 18:12:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:20] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8053339066454124132.gal : 1 ms
[2024-06-02 18:12:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7602657625340250811.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8053339066454124132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7602657625340250811.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,399358,0.190409,11688,2,1469,5,28351,6,0,1115,41260,0
Converting to forward existential form...Done !
original formula: A((A(EX(AX(FALSE)) U ((p206!=1) + AF((p530==1)))) + EX(EF((p280==1)))) U A(!(((p482!=1) + !(AF((p410==1))))) U !(AF((p395==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(!(EG(!((p395==1)))))) U (!(!(((p482!=1) + !(!(EG(!((p410==1)))))))) * !(!(!(EG(!((p395...702
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t98, t155, t1...295
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,23.2403,739140,1,0,1685,5.51113e+06,582,898,6851,4.0707e+06,2090
FORMULA CO4-PT-10-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 325/325 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 241 transition count 297
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 241 transition count 297
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 74 place count 223 transition count 279
Iterating global reduction 0 with 18 rules applied. Total rules applied 92 place count 223 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 223 transition count 278
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 101 place count 215 transition count 270
Iterating global reduction 1 with 8 rules applied. Total rules applied 109 place count 215 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 115 place count 209 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 121 place count 209 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 209 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 208 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 208 transition count 262
Applied a total of 124 rules in 28 ms. Remains 208 /269 variables (removed 61) and now considering 262/325 (removed 63) transitions.
// Phase 1: matrix 262 rows 208 cols
[2024-06-02 18:12:44] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:12:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 18:12:44] [INFO ] Invariant cache hit.
[2024-06-02 18:12:44] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-02 18:12:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/470 variables, 208/211 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:12:48] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:12:48] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 213 constraints, problems are : Problem set: 0 solved, 261 unsolved in 10351 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/470 variables, 208/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 261/474 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 474 constraints, problems are : Problem set: 0 solved, 261 unsolved in 11655 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 22037ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 22040ms
Starting structural reductions in LTL mode, iteration 1 : 208/269 places, 262/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22241 ms. Remains : 208/269 places, 262/325 transitions.
[2024-06-02 18:13:06] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:06] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:06] [INFO ] Input system was already deterministic with 262 transitions.
[2024-06-02 18:13:06] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:06] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6182185250997894383.gal : 1 ms
[2024-06-02 18:13:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10250494727764351545.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6182185250997894383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10250494727764351545.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,430456,0.09359,7456,2,1324,5,13915,6,0,1092,14848,0
Converting to forward existential form...Done !
original formula: EG(EF(AG((A((p507==1) U (p181==1)) * EX((p454==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !((!((E(!((p181==1)) U (!((p507==1)) * !((p181==1)))) + EG(!((p181==1))))) * EX((...180
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t47, t49, t51, t54, t98...305
(forward)formula 0,0,4.89954,169160,1,0,705,816223,561,383,6111,1.03397e+06,962
FORMULA CO4-PT-10-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-06-02 18:13:11] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:13:11] [INFO ] Flatten gal took : 6 ms
Total runtime 302031 ms.
BK_STOP 1717351991392
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CO4-PT-10"
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-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-10, 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 r550-tall-171734898500074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-10.tgz
mv CO4-PT-10 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;