About the Execution of ITS-Tools for DiscoveryGPU-PT-09a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1219.520 | 179456.00 | 209140.00 | 420.70 | FFTFTFTTFFFTFTFT | 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.r136-tall-171631132600410.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 DiscoveryGPU-PT-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600410
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 01:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 32K May 18 16:42 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 DiscoveryGPU-PT-09a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716376144171
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 11:09:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 11:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:09:05] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-22 11:09:05] [INFO ] Transformed 93 places.
[2024-05-22 11:09:05] [INFO ] Transformed 127 transitions.
[2024-05-22 11:09:05] [INFO ] Found NUPN structural information;
[2024-05-22 11:09:05] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 54 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 86 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 86 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 23 place count 86 transition count 111
Applied a total of 23 rules in 25 ms. Remains 86 /93 variables (removed 7) and now considering 111/127 (removed 16) transitions.
// Phase 1: matrix 111 rows 86 cols
[2024-05-22 11:09:05] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 11:09:05] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 11:09:05] [INFO ] Invariant cache hit.
[2024-05-22 11:09:05] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-22 11:09:05] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-22 11:09:05] [INFO ] Invariant cache hit.
[2024-05-22 11:09:05] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 70/158 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 158 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 70/158 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 110/268 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 268 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 4235ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 4252ms
Starting structural reductions in LTL mode, iteration 1 : 86/93 places, 111/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4593 ms. Remains : 86/93 places, 111/127 transitions.
Support contains 54 out of 86 places after structural reductions.
[2024-05-22 11:09:10] [INFO ] Flatten gal took : 25 ms
[2024-05-22 11:09:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:09:10] [INFO ] Input system was already deterministic with 111 transitions.
RANDOM walk for 40000 steps (411 resets) in 1411 ms. (28 steps per ms) remains 2/53 properties
BEST_FIRST walk for 40003 steps (41 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
[2024-05-22 11:09:10] [INFO ] Invariant cache hit.
[2024-05-22 11:09:10] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/28 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 6 (OVERLAPS) 43/71 variables, 21/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 16/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/109 variables, 14/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 14/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/136 variables, 13/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 9/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/153 variables, 9/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/153 variables, 8/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/153 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 20/173 variables, 7/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/181 variables, 4/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/181 variables, 2/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/181 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/185 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/185 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/185 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/189 variables, 2/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/189 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/193 variables, 2/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/193 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/193 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/197 variables, 2/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/197 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/197 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 158 constraints, problems are : Problem set: 1 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/48 variables, 15/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 14/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Int declared 89/197 variables, and 58 constraints, problems are : Problem set: 2 solved, 0 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/86 constraints, ReadFeed: 19/70 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-22 11:09:11] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:09:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:09:11] [INFO ] Input system was already deterministic with 111 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 82 transition count 101
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 76 transition count 101
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 21 place count 68 transition count 93
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 68 transition count 93
Applied a total of 29 rules in 20 ms. Remains 68 /86 variables (removed 18) and now considering 93/111 (removed 18) transitions.
// Phase 1: matrix 93 rows 68 cols
[2024-05-22 11:09:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:09:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 11:09:11] [INFO ] Invariant cache hit.
[2024-05-22 11:09:11] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:09:11] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-22 11:09:11] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 11:09:11] [INFO ] Invariant cache hit.
[2024-05-22 11:09:11] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/161 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 134 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1579 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/161 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 92/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 226 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 2790ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 2797ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/86 places, 93/111 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2946 ms. Remains : 68/86 places, 93/111 transitions.
[2024-05-22 11:09:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:14] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-22 11:09:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3305703445330590714.gal : 3 ms
[2024-05-22 11:09:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1566956286374788433.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/CTLFireability3305703445330590714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1566956286374788433.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.18767e+08,0.152248,9708,2,1348,5,39167,6,0,354,22044,0
Converting to forward existential form...Done !
original formula: AF((AG((p54==0)) + ((p83==1)&&(p92==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p54==0)))) + ((p83==1)&&(p92==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t23, t25, t27, t28, t30, t32, t34, t36, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92,...254
(forward)formula 0,0,1.92987,68644,1,0,321,359913,215,218,2150,409128,329
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 82 transition count 101
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 76 transition count 101
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 69 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 69 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 68 transition count 93
Applied a total of 29 rules in 12 ms. Remains 68 /86 variables (removed 18) and now considering 93/111 (removed 18) transitions.
// Phase 1: matrix 93 rows 68 cols
[2024-05-22 11:09:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:09:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 11:09:16] [INFO ] Invariant cache hit.
[2024-05-22 11:09:16] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:09:16] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-22 11:09:16] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 11:09:16] [INFO ] Invariant cache hit.
[2024-05-22 11:09:16] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/161 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 134 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/161 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 92/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 226 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 2675ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 2676ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/86 places, 93/111 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2826 ms. Remains : 68/86 places, 93/111 transitions.
[2024-05-22 11:09:18] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:09:19] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:09:19] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-22 11:09:19] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:19] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:19] [INFO ] Time to serialize gal into /tmp/CTLFireability10098637940919990389.gal : 4 ms
[2024-05-22 11:09:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8405203750067154924.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/CTLFireability10098637940919990389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8405203750067154924.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,3.18767e+08,0.125754,9252,2,1243,5,37997,6,0,354,20169,0
Converting to forward existential form...Done !
original formula: AG(EF(AG(((p3==1)||((p58==1)&&(p92==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((p3==1)||((p58==1)&&(p92==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t23, t25, t27, t30, t32, t76, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92...255
(forward)formula 0,0,0.675049,28392,1,0,135,136805,208,88,2102,137669,199
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 73 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 71 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 13 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 11:09:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:09:19] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 11:09:19] [INFO ] Invariant cache hit.
[2024-05-22 11:09:19] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:09:20] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 254 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/86 places, 96/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 269 ms. Remains : 70/86 places, 96/111 transitions.
[2024-05-22 11:09:20] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:09:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:20] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-22 11:09:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:20] [INFO ] Flatten gal took : 20 ms
[2024-05-22 11:09:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15376789168573442566.gal : 9 ms
[2024-05-22 11:09:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5044368940635757441.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/CTLFireability15376789168573442566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5044368940635757441.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,9.8551e+08,0.778825,32924,2,8819,5,197951,6,0,366,112330,0
Converting to forward existential form...Done !
original formula: (EF((p63==1)) * EX(EX(AX((p33==0)))))
=> equivalent forward existential formula: [(EY(EY((Init * E(TRUE U (p63==1))))) * !(EX(!((p33==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t12, t19, t23, t27, t29, t30, t32, t36, t38, t86, t87, t88, t89, t90, t91, t92, t93, t94,...259
(forward)formula 0,1,5.49599,175664,1,0,145,955808,215,93,2237,982048,209
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 83 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 83 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 76 transition count 101
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 69 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 69 transition count 94
Applied a total of 29 rules in 9 ms. Remains 69 /86 variables (removed 17) and now considering 94/111 (removed 17) transitions.
// Phase 1: matrix 94 rows 69 cols
[2024-05-22 11:09:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:09:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 11:09:25] [INFO ] Invariant cache hit.
[2024-05-22 11:09:25] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:09:25] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 122 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/86 places, 94/111 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 94
Applied a total of 1 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 68 cols
[2024-05-22 11:09:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:09:25] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:09:25] [INFO ] Invariant cache hit.
[2024-05-22 11:09:25] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-22 11:09:25] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 68/86 places, 94/111 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 261 ms. Remains : 68/86 places, 94/111 transitions.
[2024-05-22 11:09:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:25] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-22 11:09:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17831511643495367271.gal : 2 ms
[2024-05-22 11:09:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16449124078651054731.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17831511643495367271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16449124078651054731.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16449124078651054731.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :17 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 56
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :56 after 275
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :275 after 521
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :521 after 1396
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1396 after 4177
RANDOM walk for 39319 steps (451 resets) in 588 ms. (66 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 82 transition count 102
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 77 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 70 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 70 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 69 transition count 94
Applied a total of 27 rules in 11 ms. Remains 69 /86 variables (removed 17) and now considering 94/111 (removed 17) transitions.
// Phase 1: matrix 94 rows 69 cols
[2024-05-22 11:09:26] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:09:26] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 11:09:26] [INFO ] Invariant cache hit.
[2024-05-22 11:09:26] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:09:26] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-22 11:09:26] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-22 11:09:26] [INFO ] Invariant cache hit.
[2024-05-22 11:09:26] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/163 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 135 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/163 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 93/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 228 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 2839ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 2851ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/86 places, 94/111 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3138 ms. Remains : 69/86 places, 94/111 transitions.
[2024-05-22 11:09:29] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:29] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:29] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-22 11:09:29] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:29] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7004248196099025598.gal : 1 ms
[2024-05-22 11:09:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10853645528896320300.ctl : 10 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/CTLFireability7004248196099025598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10853645528896320300.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,3.56254e+08,0.162515,10576,2,1744,5,42011,6,0,359,26545,0
Converting to forward existential form...Done !
original formula: EG(E((AF(!(((p8==1)&&(p92==1)))) * A(AF(((p57==1)&&(p91==1))) U !(((p23==1)&&(p64==1))))) U (p3==1)))
=> equivalent forward existential formula: [FwdG(Init,E((!(EG(!(!(((p8==1)&&(p92==1)))))) * !((E(!(!(((p23==1)&&(p64==1)))) U (!(!(EG(!(((p57==1)&&(p91==1)...249
Reverse transition relation is NOT exact ! Due to transitions t13, t18, t22, t24, t26, t31, t33, t77, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,1,12.3273,398668,1,0,1020,2.13001e+06,229,623,2143,2.93794e+06,1055
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 7 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 11:09:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:09:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 11:09:41] [INFO ] Invariant cache hit.
[2024-05-22 11:09:41] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:09:41] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-22 11:09:41] [INFO ] Invariant cache hit.
[2024-05-22 11:09:41] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/167 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 65/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/167 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 138 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/167 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 65/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 95/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 233 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 2946ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 2948ms
Starting structural reductions in LTL mode, iteration 1 : 71/86 places, 96/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3054 ms. Remains : 71/86 places, 96/111 transitions.
[2024-05-22 11:09:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:44] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:09:44] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-22 11:09:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3261541061053663003.gal : 2 ms
[2024-05-22 11:09:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4455530314135804484.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/CTLFireability3261541061053663003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4455530314135804484.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.67311e+08,0.365085,18788,2,2989,5,94894,6,0,368,58192,0
Converting to forward existential form...Done !
original formula: AG(AF(AX(((((p64==0)||(p92==0))||((p42==0)||(p91==0)))||((p48==0)&&((p56==0)||(p91==0)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(((((p64==0)||(p92==0))||((p42==0)||(p91==0)))||((p48==0)&&((p56==0)||(p91==0)))))...168
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t28, t29, t31, t33, t35, t37, t78, t80, t86, t87, t88, t89, t90, t91, t92, t93, t94...260
(forward)formula 0,0,1.21062,43096,1,0,145,201601,215,94,2218,260285,207
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 10 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 11:09:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:09:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 11:09:46] [INFO ] Invariant cache hit.
[2024-05-22 11:09:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:09:46] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-22 11:09:46] [INFO ] Invariant cache hit.
[2024-05-22 11:09:46] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/167 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 65/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/167 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 138 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/167 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 65/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 95/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 233 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 2896ms
Starting structural reductions in LTL mode, iteration 1 : 71/86 places, 96/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3047 ms. Remains : 71/86 places, 96/111 transitions.
[2024-05-22 11:09:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:09:49] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-22 11:09:49] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:49] [INFO ] Flatten gal took : 16 ms
[2024-05-22 11:09:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4694156332414325341.gal : 1 ms
[2024-05-22 11:09:49] [INFO ] Time to serialize properties into /tmp/CTLFireability4087436819792027771.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/CTLFireability4694156332414325341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4087436819792027771.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.67311e+08,0.29612,16124,2,2349,5,76284,6,0,368,52787,0
Converting to forward existential form...Done !
original formula: EF(((EG((((p87==1)&&(p91==1)) + (EX(((p8==1)&&(p92==1))) * (((p80==0)||(p91==0))||((p38==0)||(p92==0)))))) * E(AX(!(((p34==1)&&(p92==1)))...239
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (EG((((p87==1)&&(p91==1)) + (EX(((p8==1)&&(p92==1))) * (((p80==0)||(p91==0))||((p38==0...304
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t29, t31, t33, t35, t37, t79, t80, t86, t87, t88, t89, t90, t91, t92, t93, t94...260
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.80494,102424,1,0,309,550943,229,200,2368,657777,388
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 73 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 71 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 14 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 11:09:52] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:09:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 11:09:52] [INFO ] Invariant cache hit.
[2024-05-22 11:09:52] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:09:52] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/86 places, 96/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 70/86 places, 96/111 transitions.
[2024-05-22 11:09:52] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:09:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:52] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-22 11:09:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:09:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12756919939809552439.gal : 11 ms
[2024-05-22 11:09:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1666754456247465092.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/CTLFireability12756919939809552439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1666754456247465092.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,9.67311e+08,1.36177,51132,2,14736,5,281244,6,0,366,198776,0
Converting to forward existential form...Done !
original formula: EF(EG((((p75==1)&&(p91==1)) + ((EX(((p79==1)&&(p91==1))) * (p80==1)) * ((p91==1)&&(p62==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p75==1)&&(p91==1)) + ((EX(((p79==1)&&(p91==1))) * (p80==1)) * ((p91==1)&&(p62==1)))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t22, t26, t28, t29, t31, t33, t35, t37, t77, t80, t86, t87, t88, t89, t90, t91, t92, t93, t94...260
(forward)formula 0,1,7.26321,206640,1,0,146,897987,217,97,2171,1.40523e+06,210
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 74 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 72 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 72 transition count 97
Applied a total of 28 rules in 6 ms. Remains 72 /86 variables (removed 14) and now considering 97/111 (removed 14) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-22 11:09:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:09:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 11:09:59] [INFO ] Invariant cache hit.
[2024-05-22 11:09:59] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:09:59] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 11:09:59] [INFO ] Invariant cache hit.
[2024-05-22 11:09:59] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 65/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 139 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 65/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 96/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 235 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 2884ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 2885ms
Starting structural reductions in LTL mode, iteration 1 : 72/86 places, 97/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3071 ms. Remains : 72/86 places, 97/111 transitions.
[2024-05-22 11:10:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:10:02] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:10:02] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 11:10:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:10:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:10:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13794890217889082868.gal : 1 ms
[2024-05-22 11:10:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6359713225363730646.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/CTLFireability13794890217889082868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6359713225363730646.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,1.0006e+09,0.275253,16216,2,2266,5,78803,6,0,372,49194,0
Converting to forward existential form...Done !
original formula: AX(AG(((EX((((p35==0)||(p91==0))||((p78==0)||(p92==0)))) + ((p16==1)&&(p91==1))) + (((p66==1)&&(p85==1))&&((p91==1)&&((p11==1)||(p69==1))...160
=> equivalent forward existential formula: [(((FwdU(EY(Init),TRUE) * !((((p66==1)&&(p85==1))&&((p91==1)&&((p11==1)||(p69==1)))))) * !(((p16==1)&&(p91==1)))...220
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t29, t33, t35, t37, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...255
(forward)formula 0,0,1.15281,42116,1,0,145,200544,215,96,2327,235401,206
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 3 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 11:10:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:10:04] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-22 11:10:04] [INFO ] Invariant cache hit.
[2024-05-22 11:10:04] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:10:04] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 389 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/86 places, 96/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 393 ms. Remains : 70/86 places, 96/111 transitions.
[2024-05-22 11:10:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:10:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:10:04] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-22 11:10:04] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:10:04] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:10:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7147165615402337908.gal : 1 ms
[2024-05-22 11:10:04] [INFO ] Time to serialize properties into /tmp/CTLFireability15794155895564353440.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/CTLFireability7147165615402337908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15794155895564353440.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,9.67311e+08,0.801508,32284,2,8611,5,184303,6,0,366,112339,0
Converting to forward existential form...Done !
original formula: EX(AG(AF(EX(((p32==0)||(p91==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(EX(((p32==0)||(p91==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t29, t31, t35, t37, t79, t82, t86, t87, t88, t89, t90, t91, t92, t93, t94...260
Using saturation style SCC detection
(forward)formula 0,0,25.7882,705860,1,0,250,4.10434e+06,221,150,2336,3.69536e+06,348
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 82 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 67 transition count 92
Applied a total of 31 rules in 6 ms. Remains 67 /86 variables (removed 19) and now considering 92/111 (removed 19) transitions.
// Phase 1: matrix 92 rows 67 cols
[2024-05-22 11:10:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:10:30] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 11:10:30] [INFO ] Invariant cache hit.
[2024-05-22 11:10:30] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:10:30] [INFO ] Implicit Places using invariants and state equation in 149 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 253 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/86 places, 92/111 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 264 ms. Remains : 66/86 places, 92/111 transitions.
[2024-05-22 11:10:30] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:10:30] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:10:30] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-22 11:10:30] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:10:30] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:10:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8310393707779480241.gal : 1 ms
[2024-05-22 11:10:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1959353251537488510.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/CTLFireability8310393707779480241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1959353251537488510.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.85213e+08,0.242778,14196,2,4805,5,68698,6,0,347,42048,0
Converting to forward existential form...Done !
original formula: (AF((EF((p16==1)) * AG((p44==0)))) + EG(((p84==1)||((p26==1)&&(p91==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(EG(((p84==1)||((p26==1)&&(p91==1)))))),!((E(TRUE U (p16==1)) * !(E(TRUE U !((p44==0)))))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t24, t26, t27, t29, t31, t33, t35, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91...255
(forward)formula 0,0,11.1273,333400,1,0,375,1.78994e+06,218,247,2123,1.99092e+06,400
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 75 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 72 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 72 transition count 97
Applied a total of 28 rules in 3 ms. Remains 72 /86 variables (removed 14) and now considering 97/111 (removed 14) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-22 11:10:41] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:10:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 11:10:41] [INFO ] Invariant cache hit.
[2024-05-22 11:10:41] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:10:41] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 11:10:41] [INFO ] Invariant cache hit.
[2024-05-22 11:10:41] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 64/138 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 138 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 64/138 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 96/234 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 234 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 3026ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 3028ms
Starting structural reductions in LTL mode, iteration 1 : 72/86 places, 97/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3186 ms. Remains : 72/86 places, 97/111 transitions.
[2024-05-22 11:10:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:10:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:10:44] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 11:10:44] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:10:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:10:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5221118278279469758.gal : 1 ms
[2024-05-22 11:10:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8786765120116211597.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/CTLFireability5221118278279469758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8786765120116211597.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06096e+09,0.532762,25916,2,4388,5,148885,6,0,373,87978,0
Converting to forward existential form...Done !
original formula: ((EF(((p34==1) + AF((p43==1)))) + AF((EG(E(((p47==1)&&(p91==1)) U (p73==1))) * AF(((p23==1)&&(p92==1)))))) + AF(((((((p48==1)&&(p92==1))&...275
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U ((p34==1) + !(EG(!((p43==1)))))) + !(EG(!((EG(E(((p47==1)&&(p91==1)) U (p73==1))) * !(...365
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t15, t20, t24, t26, t31, t33, t35, t37, t87, t88, t89, t90, t91, t92, t93, t94, t95,...259
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-22 11:11:15] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:15] [INFO ] Applying decomposition
[2024-05-22 11:11:15] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14116734545824251309.txt' '-o' '/tmp/graph14116734545824251309.bin' '-w' '/tmp/graph14116734545824251309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14116734545824251309.bin' '-l' '-1' '-v' '-w' '/tmp/graph14116734545824251309.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:11:15] [INFO ] Decomposing Gal with order
[2024-05-22 11:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:11:15] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-22 11:11:15] [INFO ] Flatten gal took : 55 ms
[2024-05-22 11:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 7 ms.
[2024-05-22 11:11:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10655504134048539715.gal : 61 ms
[2024-05-22 11:11:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10939054007351800942.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/CTLFireability10655504134048539715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10939054007351800942.ctl'
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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06096e+09,0.959879,39304,347,225,33858,41344,199,132110,42,329160,0
Converting to forward existential form...Done !
original formula: ((EF(((i4.u10.p34==1) + AF((i0.u6.p43==1)))) + AF((EG(E(((i5.u14.p47==1)&&(i1.u1.p91==1)) U (i0.u6.p73==1))) * AF(((i0.u6.p23==1)&&(i0.u0...391
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U ((i4.u10.p34==1) + !(EG(!((i0.u6.p43==1)))))) + !(EG(!((EG(E(((i5.u14.p47==1)&&(i1.u1....481
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t31, t33, t35, t37, i0.t20, i0.u6.t3, i0.u6.t10, i0.u6.t15, i0.u6.t91, i1.u1.t92, i...346
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,24.8885,767672,1,0,549851,463709,1191,4.36968e+06,236,5.77251e+06,216128
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 82 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 67 transition count 92
Applied a total of 31 rules in 6 ms. Remains 67 /86 variables (removed 19) and now considering 92/111 (removed 19) transitions.
// Phase 1: matrix 92 rows 67 cols
[2024-05-22 11:11:40] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:11:40] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-22 11:11:40] [INFO ] Invariant cache hit.
[2024-05-22 11:11:40] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:11:40] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 209 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/86 places, 92/111 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 92
Applied a total of 1 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 66 cols
[2024-05-22 11:11:40] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:11:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 11:11:40] [INFO ] Invariant cache hit.
[2024-05-22 11:11:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 11:11:40] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 66/86 places, 92/111 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 387 ms. Remains : 66/86 places, 92/111 transitions.
[2024-05-22 11:11:40] [INFO ] Flatten gal took : 18 ms
[2024-05-22 11:11:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:40] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-22 11:11:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7547229965418293549.gal : 2 ms
[2024-05-22 11:11:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13984307806291033474.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/CTLFireability7547229965418293549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13984307806291033474.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,2.85213e+08,0.161541,10808,2,3115,5,48307,6,0,347,26160,0
Converting to forward existential form...Done !
original formula: EF(EG(AG((AG((p4==1)) + EG(((p65==1)&&(p91==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((!(E(TRUE U !((p4==1)))) + EG(((p65==1)&&(p91==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t23, t25, t26, t28, t30, t32, t34, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91...255
(forward)formula 0,0,1.54045,58124,1,0,182,279485,217,109,2118,285970,262
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 80 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 80 transition count 105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 76 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 76 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 74 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 74 transition count 99
Applied a total of 24 rules in 2 ms. Remains 74 /86 variables (removed 12) and now considering 99/111 (removed 12) transitions.
// Phase 1: matrix 99 rows 74 cols
[2024-05-22 11:11:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:11:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 11:11:42] [INFO ] Invariant cache hit.
[2024-05-22 11:11:42] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:11:42] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-22 11:11:42] [INFO ] Invariant cache hit.
[2024-05-22 11:11:42] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/173 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/173 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 141 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/173 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 98/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 239 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 3229ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 3230ms
Starting structural reductions in LTL mode, iteration 1 : 74/86 places, 99/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3415 ms. Remains : 74/86 places, 99/111 transitions.
[2024-05-22 11:11:45] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:45] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:45] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-22 11:11:45] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:45] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:11:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15943749039585235991.gal : 0 ms
[2024-05-22 11:11:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1138532928852407442.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/CTLFireability15943749039585235991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1138532928852407442.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,1.17026e+09,0.446507,21776,2,3484,5,120817,6,0,382,70106,0
Converting to forward existential form...Done !
original formula: (!(E(((AG((A(((p7==1)&&(p91==1)) U (p38==1)) + EX(((p90==1)&&(p91==1))))) + (((!(((p73==1)&&(p45==1))&&(p91==1)))&&(p30==1))&&((p91==1)&&...367
=> equivalent forward existential formula: ([((FwdU((Init * !(E(TRUE U ((!(EG(!(((p34==0)||(p92==0))))) * (p68==1)) * ((p92==1)&&(p43==1)))))),((!(E(TRUE U...835
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t20, t24, t30, t31, t33, t35, t37, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97,...259
(forward)formula 0,1,12.1248,393572,1,0,718,2.21199e+06,253,371,2381,2.8715e+06,873
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 72 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 69 transition count 94
Applied a total of 34 rules in 9 ms. Remains 69 /86 variables (removed 17) and now considering 94/111 (removed 17) transitions.
// Phase 1: matrix 94 rows 69 cols
[2024-05-22 11:11:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:11:58] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 11:11:58] [INFO ] Invariant cache hit.
[2024-05-22 11:11:58] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:11:58] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/86 places, 94/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 68/86 places, 94/111 transitions.
[2024-05-22 11:11:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:11:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:58] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-22 11:11:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:11:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8429188176985013306.gal : 0 ms
[2024-05-22 11:11:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7374725025205513844.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/CTLFireability8429188176985013306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7374725025205513844.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.35715e+08,0.480975,21780,2,5324,5,123961,6,0,356,67148,0
Converting to forward existential form...Done !
original formula: AG(EX(AF((p16==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((p16==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,0,2.79697,96200,1,0,250,501694,211,145,2102,602342,356
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 72 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 69 transition count 94
Applied a total of 34 rules in 1 ms. Remains 69 /86 variables (removed 17) and now considering 94/111 (removed 17) transitions.
[2024-05-22 11:12:01] [INFO ] Invariant cache hit.
[2024-05-22 11:12:01] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:12:01] [INFO ] Invariant cache hit.
[2024-05-22 11:12:01] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:12:01] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/86 places, 94/111 transitions.
Applied a total of 0 rules in 16 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 68/86 places, 94/111 transitions.
[2024-05-22 11:12:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:12:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:12:01] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-22 11:12:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:12:01] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability472752296347302256.gal : 1 ms
[2024-05-22 11:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15330294946199324754.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/CTLFireability472752296347302256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15330294946199324754.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.35715e+08,0.496876,21776,2,5324,5,123961,6,0,356,67148,0
Converting to forward existential form...Done !
original formula: AX(EF((p58==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p58==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,1,2.36661,81864,1,0,136,403235,209,90,2146,418372,199
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 11:12:03] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:12:03] [INFO ] Flatten gal took : 3 ms
Total runtime 178294 ms.
BK_STOP 1716376323627
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-09a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-09a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132600410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;