About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 801.039 | 189552.00 | 231500.00 | 439.00 | FFFFFFFTFFFFTFTF | 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.r334-tall-171679079500057.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 RingSingleMessageInMbox-PT-d1m005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500057
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 00:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 00:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 00:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 00:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 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 RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716793756283
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-27 07:09:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 07:09:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:09:17] [INFO ] Load time of PNML (sax parser for PT used): 449 ms
[2024-05-27 07:09:17] [INFO ] Transformed 6690 places.
[2024-05-27 07:09:17] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:09:17] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 609 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 4305 places in 58 ms
Reduce places removed 4305 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1099 places :
Symmetric choice reduction at 1 with 1099 rule applications. Total rules 1218 place count 1269 transition count 2432
Iterating global reduction 1 with 1099 rules applied. Total rules applied 2317 place count 1269 transition count 2432
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 2392 place count 1269 transition count 2357
Discarding 892 places :
Symmetric choice reduction at 2 with 892 rule applications. Total rules 3284 place count 377 transition count 1465
Iterating global reduction 2 with 892 rules applied. Total rules applied 4176 place count 377 transition count 1465
Ensure Unique test removed 846 transitions
Reduce isomorphic transitions removed 846 transitions.
Iterating post reduction 2 with 846 rules applied. Total rules applied 5022 place count 377 transition count 619
Discarding 157 places :
Symmetric choice reduction at 3 with 157 rule applications. Total rules 5179 place count 220 transition count 462
Iterating global reduction 3 with 157 rules applied. Total rules applied 5336 place count 220 transition count 462
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 3 with 120 rules applied. Total rules applied 5456 place count 220 transition count 342
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 5463 place count 213 transition count 335
Iterating global reduction 4 with 7 rules applied. Total rules applied 5470 place count 213 transition count 335
Applied a total of 5470 rules in 359 ms. Remains 213 /2385 variables (removed 2172) and now considering 335/11934 (removed 11599) transitions.
// Phase 1: matrix 335 rows 213 cols
[2024-05-27 07:09:18] [INFO ] Computed 3 invariants in 22 ms
[2024-05-27 07:09:18] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-27 07:09:18] [INFO ] Invariant cache hit.
[2024-05-27 07:09:19] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-27 07:09:19] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2024-05-27 07:09:19] [INFO ] Invariant cache hit.
[2024-05-27 07:09:19] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/213 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
At refinement iteration 4 (OVERLAPS) 335/548 variables, 213/216 constraints. Problems are: Problem set: 26 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 135/351 constraints. Problems are: Problem set: 26 solved, 308 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/351 constraints. Problems are: Problem set: 26 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/351 constraints. Problems are: Problem set: 26 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 351 constraints, problems are : Problem set: 26 solved, 308 unsolved in 15378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 17/203 variables, 2/2 constraints. Problems are: Problem set: 26 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 26 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 10/213 variables, 1/3 constraints. Problems are: Problem set: 26 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 26 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 335/548 variables, 213/216 constraints. Problems are: Problem set: 26 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 135/351 constraints. Problems are: Problem set: 26 solved, 308 unsolved
Problem TDEAD274 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 308/659 constraints. Problems are: Problem set: 27 solved, 307 unsolved
[2024-05-27 07:09:46] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 15 ms to minimize.
[2024-05-27 07:09:47] [INFO ] Deduced a trap composed of 102 places in 72 ms of which 2 ms to minimize.
[2024-05-27 07:09:48] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
[2024-05-27 07:09:49] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
[2024-05-27 07:09:53] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
[2024-05-27 07:09:53] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 4 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
[2024-05-27 07:09:54] [INFO ] Deduced a trap composed of 94 places in 63 ms of which 1 ms to minimize.
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
[2024-05-27 07:09:54] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 2 ms to minimize.
[2024-05-27 07:09:54] [INFO ] Deduced a trap composed of 97 places in 73 ms of which 2 ms to minimize.
[2024-05-27 07:09:54] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2024-05-27 07:09:54] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 11/670 constraints. Problems are: Problem set: 49 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 670 constraints, problems are : Problem set: 49 solved, 285 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 308/334 constraints, Known Traps: 11/11 constraints]
After SMT, in 47018ms problems are : Problem set: 49 solved, 285 unsolved
Search for dead transitions found 49 dead transitions in 47046ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in LTL mode, iteration 1 : 213/2385 places, 286/11934 transitions.
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 169 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 62 rules in 4 ms. Remains 169 /213 variables (removed 44) and now considering 268/286 (removed 18) transitions.
// Phase 1: matrix 268 rows 169 cols
[2024-05-27 07:10:06] [INFO ] Computed 3 invariants in 6 ms
[2024-05-27 07:10:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-27 07:10:06] [INFO ] Invariant cache hit.
[2024-05-27 07:10:06] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:10:07] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 169/2385 places, 268/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48981 ms. Remains : 169/2385 places, 268/11934 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 22 out of 168 places after structural reductions.
[2024-05-27 07:10:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 07:10:07] [INFO ] Flatten gal took : 42 ms
[2024-05-27 07:10:07] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:10:07] [INFO ] Flatten gal took : 19 ms
[2024-05-27 07:10:07] [INFO ] Input system was already deterministic with 268 transitions.
Support contains 10 out of 168 places (down from 22) after GAL structural reductions.
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (7148 resets) in 1709 ms. (23 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1579 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1572 resets) in 126 ms. (314 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (1713 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1635 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1831 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
// Phase 1: matrix 268 rows 168 cols
[2024-05-27 07:10:08] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:10:08] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 208/223 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 57/280 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 27/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 4/284 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 436/436 variables, and 235 constraints, problems are : Problem set: 5 solved, 0 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 65/126 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 4 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:10:08] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:10:08] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:10:08] [INFO ] Input system was already deterministic with 268 transitions.
Support contains 4 out of 168 places (down from 5) after GAL structural reductions.
Computed a total of 15 stabilizing places and 70 stable transitions
Graph (complete) has 613 edges and 168 vertex of which 167 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 268/268 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 147 transition count 247
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 147 transition count 247
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 55 place count 147 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 138 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 138 transition count 225
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 88 place count 138 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 135 transition count 171
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 135 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 133 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 133 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 133 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 129 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 129 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 129 transition count 160
Applied a total of 111 rules in 21 ms. Remains 129 /168 variables (removed 39) and now considering 160/268 (removed 108) transitions.
// Phase 1: matrix 160 rows 129 cols
[2024-05-27 07:10:08] [INFO ] Computed 2 invariants in 16 ms
[2024-05-27 07:10:08] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 07:10:08] [INFO ] Invariant cache hit.
[2024-05-27 07:10:08] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 07:10:08] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-27 07:10:08] [INFO ] Invariant cache hit.
[2024-05-27 07:10:08] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-27 07:10:15] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:10:16] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:10:16] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:10:16] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:10:16] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-27 07:10:19] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 349 constraints, problems are : Problem set: 0 solved, 159 unsolved in 13467 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 6/6 constraints]
After SMT, in 17799ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 17802ms
Starting structural reductions in LTL mode, iteration 1 : 129/168 places, 160/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18113 ms. Remains : 129/168 places, 160/268 transitions.
[2024-05-27 07:10:26] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:10:26] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:10:26] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-27 07:10:26] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:10:26] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:10:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality11324834116352455215.gal : 4 ms
[2024-05-27 07:10:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8684316077048218021.ctl : 4 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/CTLCardinality11324834116352455215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8684316077048218021.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,156238,0.278788,15180,2,3957,5,31546,6,0,676,25974,0
Converting to forward existential form...Done !
original formula: AG(AX(FALSE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(FALSE))] = FALSE
(forward)formula 0,0,0.326707,15180,1,0,6,31546,7,1,1236,25974,1
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 268/268 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 147 transition count 247
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 147 transition count 247
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 55 place count 147 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 138 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 138 transition count 225
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 88 place count 138 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 135 transition count 171
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 135 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 133 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 133 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 133 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 129 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 129 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 129 transition count 160
Applied a total of 111 rules in 12 ms. Remains 129 /168 variables (removed 39) and now considering 160/268 (removed 108) transitions.
[2024-05-27 07:10:27] [INFO ] Invariant cache hit.
[2024-05-27 07:10:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-27 07:10:27] [INFO ] Invariant cache hit.
[2024-05-27 07:10:27] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 07:10:27] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-27 07:10:27] [INFO ] Invariant cache hit.
[2024-05-27 07:10:27] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-27 07:10:33] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:10:34] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:10:35] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 2 ms to minimize.
[2024-05-27 07:10:35] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 1 ms to minimize.
[2024-05-27 07:10:35] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-27 07:10:37] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 349 constraints, problems are : Problem set: 0 solved, 159 unsolved in 13214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 6/6 constraints]
After SMT, in 17504ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 17506ms
Starting structural reductions in LTL mode, iteration 1 : 129/168 places, 160/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17838 ms. Remains : 129/168 places, 160/268 transitions.
[2024-05-27 07:10:44] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:10:44] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:10:44] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-27 07:10:44] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:10:44] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:10:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4213077192746233211.gal : 2 ms
[2024-05-27 07:10:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality11567817611335416109.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/CTLCardinality4213077192746233211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11567817611335416109.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,156238,0.283594,15252,2,3957,5,31546,6,0,676,25974,0
Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t24, t25, t26, t29, t38, t41, t47, t52, t63, t65, t67, t69, t106...514
(forward)formula 0,1,1.79229,69412,1,0,339,233663,341,140,4621,175747,356
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 268/268 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 149 transition count 249
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 149 transition count 249
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 50 place count 149 transition count 237
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 141 transition count 229
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 141 transition count 229
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 80 place count 141 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 140 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 140 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 139 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 139 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 139 transition count 200
Applied a total of 85 rules in 9 ms. Remains 139 /168 variables (removed 29) and now considering 200/268 (removed 68) transitions.
// Phase 1: matrix 200 rows 139 cols
[2024-05-27 07:10:46] [INFO ] Computed 2 invariants in 7 ms
[2024-05-27 07:10:46] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:10:46] [INFO ] Invariant cache hit.
[2024-05-27 07:10:46] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-27 07:10:47] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-27 07:10:47] [INFO ] Invariant cache hit.
[2024-05-27 07:10:47] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/339 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 85/226 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-27 07:10:49] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 227 constraints, problems are : Problem set: 0 solved, 199 unsolved in 7805 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/339 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 85/227 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 199/426 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-27 07:11:00] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:11:00] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:11:00] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:11:00] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:11:00] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 5/431 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-27 07:11:04] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (OVERLAPS) 0/339 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 432 constraints, problems are : Problem set: 0 solved, 199 unsolved in 21682 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 7/7 constraints]
After SMT, in 29725ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 29727ms
Starting structural reductions in LTL mode, iteration 1 : 139/168 places, 200/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30095 ms. Remains : 139/168 places, 200/268 transitions.
[2024-05-27 07:11:16] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:11:16] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:11:16] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-27 07:11:16] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:11:16] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:11:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7101082102778922652.gal : 2 ms
[2024-05-27 07:11:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17040192403919233259.ctl : 4 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/CTLCardinality7101082102778922652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17040192403919233259.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,198822,0.330165,17380,2,4183,5,38825,6,0,756,24731,0
Converting to forward existential form...Done !
original formula: AG(((l3494<=0) + (AX(FALSE) * EX((p966<=0)))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !((l3494<=0)))) * !(FALSE))] = FALSE * [((FwdU(Init,TRUE) * !((l3494<=0))) * !(EX((p966...172
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t33, t34, t35, t36, t39, t4...703
(forward)formula 0,0,1.8186,69576,1,0,375,219943,418,159,5171,143401,408
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 268/268 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 147 transition count 247
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 147 transition count 247
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 55 place count 147 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 138 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 138 transition count 225
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 88 place count 138 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 135 transition count 171
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 135 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 133 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 133 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 133 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 129 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 129 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 129 transition count 160
Applied a total of 111 rules in 14 ms. Remains 129 /168 variables (removed 39) and now considering 160/268 (removed 108) transitions.
// Phase 1: matrix 160 rows 129 cols
[2024-05-27 07:11:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:11:18] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 07:11:18] [INFO ] Invariant cache hit.
[2024-05-27 07:11:18] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 07:11:19] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-27 07:11:19] [INFO ] Invariant cache hit.
[2024-05-27 07:11:19] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 3946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-27 07:11:25] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:11:26] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:11:26] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:11:26] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2024-05-27 07:11:26] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-27 07:11:29] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 349 constraints, problems are : Problem set: 0 solved, 159 unsolved in 13355 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 6/6 constraints]
After SMT, in 17468ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 17469ms
Starting structural reductions in LTL mode, iteration 1 : 129/168 places, 160/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17751 ms. Remains : 129/168 places, 160/268 transitions.
[2024-05-27 07:11:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:11:36] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:11:36] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-27 07:11:36] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:11:36] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:11:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7674147737448419924.gal : 2 ms
[2024-05-27 07:11:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality16275167318140767282.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/CTLCardinality7674147737448419924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16275167318140767282.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,156238,0.274311,15252,2,3957,5,31546,6,0,676,25974,0
Converting to forward existential form...Done !
original formula: EX(AX(AX(FALSE)))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(EX(!(FALSE)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t24, t25, t26, t29, t38, t41, t47, t52, t63, t65, t67, t69, t106...514
(forward)formula 0,0,1.56679,57528,1,0,315,213494,335,141,4577,139675,331
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 268/268 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 148 transition count 248
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 148 transition count 248
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 52 place count 148 transition count 236
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 139 transition count 227
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 139 transition count 227
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 85 place count 139 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 137 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 136 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 136 transition count 185
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 132 transition count 181
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 132 transition count 181
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 107 place count 132 transition count 173
Applied a total of 107 rules in 7 ms. Remains 132 /168 variables (removed 36) and now considering 173/268 (removed 95) transitions.
// Phase 1: matrix 173 rows 132 cols
[2024-05-27 07:11:38] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:11:38] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 07:11:38] [INFO ] Invariant cache hit.
[2024-05-27 07:11:38] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 07:11:38] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-27 07:11:38] [INFO ] Invariant cache hit.
[2024-05-27 07:11:38] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/305 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 172 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 198 constraints, problems are : Problem set: 0 solved, 172 unsolved in 4775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/305 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 172/370 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-27 07:11:47] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:11:47] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 0 ms to minimize.
[2024-05-27 07:11:47] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2024-05-27 07:11:47] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 2 ms to minimize.
[2024-05-27 07:11:47] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-27 07:11:49] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 0 ms to minimize.
[2024-05-27 07:11:51] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-27 07:11:53] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/305 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 378 constraints, problems are : Problem set: 0 solved, 172 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 8/8 constraints]
After SMT, in 25025ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 25027ms
Starting structural reductions in LTL mode, iteration 1 : 132/168 places, 173/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25350 ms. Remains : 132/168 places, 173/268 transitions.
[2024-05-27 07:12:03] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:12:03] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:12:03] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-27 07:12:03] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:12:03] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:12:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality6095744552350471138.gal : 2 ms
[2024-05-27 07:12:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15306936532291708868.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/CTLCardinality6095744552350471138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15306936532291708868.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,156271,0.472762,21940,2,4771,5,42425,6,0,701,33361,0
Converting to forward existential form...Done !
original formula: AF(((p1062<=l3074) * EG(AX(FALSE))))
=> equivalent forward existential formula: [FwdG(Init,!(((p1062<=l3074) * EG(!(EX(!(FALSE)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t19, t20, t21, t22, t23, t24, t25, t26, t27, t36, t37, t38, t39,...565
Using saturation style SCC detection
(forward)formula 0,0,3.91684,130528,1,0,498,462806,374,243,4902,413830,483
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 268/268 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 147 transition count 247
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 147 transition count 247
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 55 place count 147 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 138 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 138 transition count 225
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 88 place count 138 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 135 transition count 171
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 135 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 133 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 133 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 133 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 129 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 129 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 129 transition count 160
Applied a total of 111 rules in 5 ms. Remains 129 /168 variables (removed 39) and now considering 160/268 (removed 108) transitions.
// Phase 1: matrix 160 rows 129 cols
[2024-05-27 07:12:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:12:07] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 07:12:07] [INFO ] Invariant cache hit.
[2024-05-27 07:12:07] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 07:12:07] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-27 07:12:07] [INFO ] Invariant cache hit.
[2024-05-27 07:12:07] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 3996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-27 07:12:14] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:12:15] [INFO ] Deduced a trap composed of 51 places in 34 ms of which 1 ms to minimize.
[2024-05-27 07:12:15] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2024-05-27 07:12:15] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 0 ms to minimize.
[2024-05-27 07:12:15] [INFO ] Deduced a trap composed of 51 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-27 07:12:17] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 349 constraints, problems are : Problem set: 0 solved, 159 unsolved in 13537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 6/6 constraints]
After SMT, in 17689ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 17690ms
Starting structural reductions in LTL mode, iteration 1 : 129/168 places, 160/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17947 ms. Remains : 129/168 places, 160/268 transitions.
[2024-05-27 07:12:25] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:12:25] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:12:25] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-27 07:12:25] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:12:25] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:12:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9336506859494738477.gal : 1 ms
[2024-05-27 07:12:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality14013169838810956004.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/CTLCardinality9336506859494738477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14013169838810956004.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,156238,0.270742,15248,2,3957,5,31546,6,0,676,25974,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.27491,15248,1,0,6,31546,7,1,921,25974,1
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-27 07:12:25] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:12:25] [INFO ] Flatten gal took : 7 ms
Total runtime 188422 ms.
BK_STOP 1716793945835
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m005"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is RingSingleMessageInMbox-PT-d1m005, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679079500057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m005.tgz
mv RingSingleMessageInMbox-PT-d1m005 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;