About the Execution of LTSMin+red for Angiogenesis-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 327.688 | 12296.00 | 27909.00 | 530.40 | ?F???F?????????? | 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.r468-smll-171620166800002.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 ltsminxred
Input is Angiogenesis-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620166800002
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 19:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 11 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 34K 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 Angiogenesis-PT-01-CTLFireability-2024-00
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-01
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-02
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-03
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-04
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-05
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-06
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-07
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-08
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-09
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-10
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2024-11
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2023-12
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2023-13
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2023-14
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717181769561
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Angiogenesis-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:56:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:56:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:56:13] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-31 18:56:13] [INFO ] Transformed 39 places.
[2024-05-31 18:56:13] [INFO ] Transformed 64 transitions.
[2024-05-31 18:56:13] [INFO ] Found NUPN structural information;
[2024-05-31 18:56:13] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Angiogenesis-PT-01-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 64
Applied a total of 1 rules in 41 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 38 cols
[2024-05-31 18:56:13] [INFO ] Computed 7 invariants in 16 ms
[2024-05-31 18:56:14] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-31 18:56:14] [INFO ] Invariant cache hit.
[2024-05-31 18:56:14] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-31 18:56:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/45 constraints. Problems are: Problem set: 9 solved, 52 unsolved
[2024-05-31 18:56:15] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 80 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/46 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/46 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 64/102 variables, 38/84 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/84 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/84 constraints. Problems are: Problem set: 14 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 84 constraints, problems are : Problem set: 14 solved, 47 unsolved in 1791 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 14 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/31 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 8/38 variables, 6/37 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 8/45 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 1/46 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/46 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 64/102 variables, 38/84 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 47/131 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/131 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/131 constraints. Problems are: Problem set: 14 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 131 constraints, problems are : Problem set: 14 solved, 47 unsolved in 1313 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 47/61 constraints, Known Traps: 1/1 constraints]
After SMT, in 3205ms problems are : Problem set: 14 solved, 47 unsolved
Search for dead transitions found 14 dead transitions in 3223ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 38/39 places, 50/64 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 50
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 36 cols
[2024-05-31 18:56:17] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 18:56:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 18:56:17] [INFO ] Invariant cache hit.
[2024-05-31 18:56:17] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 36/39 places, 50/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4252 ms. Remains : 36/39 places, 50/64 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 32 out of 32 places after structural reductions.
[2024-05-31 18:56:18] [INFO ] Flatten gal took : 30 ms
[2024-05-31 18:56:18] [INFO ] Flatten gal took : 13 ms
[2024-05-31 18:56:18] [INFO ] Input system was already deterministic with 50 transitions.
Support contains 31 out of 32 places (down from 32) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 51 to 44
RANDOM walk for 40000 steps (27 resets) in 3076 ms. (12 steps per ms) remains 10/44 properties
BEST_FIRST walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (18 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 452 ms. (88 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
// Phase 1: matrix 50 rows 32 cols
[2024-05-31 18:56:20] [INFO ] Computed 6 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp37 is UNSAT
At refinement iteration 2 (OVERLAPS) 9/25 variables, 3/19 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 5 (OVERLAPS) 6/31 variables, 3/31 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 6/37 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 49/80 variables, 31/68 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 10 (OVERLAPS) 2/82 variables, 1/69 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 1/70 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 0/70 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/82 variables, 0/70 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 70 constraints, problems are : Problem set: 9 solved, 1 unsolved in 249 ms.
Refiners :[Domain max(s): 32/32 constraints, Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/22 variables, 2/4 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 20/24 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/27 variables, 3/27 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 5/32 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/32 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/29 variables, 1/33 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 2/35 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/35 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/78 variables, 29/64 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/82 variables, 3/67 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/82 variables, 3/70 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/82 variables, 1/71 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/82 variables, 0/71 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/82 variables, 0/71 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 71 constraints, problems are : Problem set: 9 solved, 1 unsolved in 126 ms.
Refiners :[Domain max(s): 32/32 constraints, Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 404ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 50/50 transitions.
Graph (complete) has 89 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t44 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 30 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 30 transition count 45
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 28 transition count 45
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 28 transition count 44
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 25 transition count 41
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 25 transition count 39
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 27 place count 20 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 36 place count 20 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 20 transition count 29
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 40 place count 20 transition count 26
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 46 place count 17 transition count 23
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48 place count 16 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 50 place count 16 transition count 22
Applied a total of 50 rules in 86 ms. Remains 16 /32 variables (removed 16) and now considering 22/50 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 16/32 places, 22/50 transitions.
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Probably explored full state space saw : 17 states, properties seen :0
Probabilistic random walk after 55 steps, saw 17 distinct states, run finished after 13 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 17 states, properties seen :0
Exhaustive walk after 55 steps, saw 17 distinct states, run finished after 2 ms. (steps per millisecond=27 ) properties seen :0
Successfully simplified 10 atomic propositions for a total of 15 simplifications.
[2024-05-31 18:56:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 18:56:20] [INFO ] Flatten gal took : 13 ms
FORMULA Angiogenesis-PT-01-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 18:56:20] [INFO ] Flatten gal took : 9 ms
[2024-05-31 18:56:20] [INFO ] Input system was already deterministic with 50 transitions.
Support contains 29 out of 32 places (down from 30) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 89 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:20] [INFO ] Flatten gal took : 5 ms
[2024-05-31 18:56:20] [INFO ] Flatten gal took : 6 ms
[2024-05-31 18:56:20] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:20] [INFO ] Flatten gal took : 5 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 6 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 5 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 6 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 5 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 7 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Graph (complete) has 89 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 28 transition count 48
Applied a total of 6 rules in 8 ms. Remains 28 /32 variables (removed 4) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 28/32 places, 48/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 5 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 5 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 3 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 3 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 3 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Graph (complete) has 89 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 50
Applied a total of 3 rules in 5 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Graph (complete) has 89 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 31 transition count 49
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 29 transition count 49
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 29 transition count 49
Applied a total of 7 rules in 6 ms. Remains 29 /32 variables (removed 3) and now considering 49/50 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 29/32 places, 49/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 50
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 50/50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-31 18:56:21] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 5 ms
[2024-05-31 18:56:21] [INFO ] Flatten gal took : 6 ms
[2024-05-31 18:56:21] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-05-31 18:56:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 50 transitions and 142 arcs took 2 ms.
Total runtime 8311 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-00
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-02
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-03
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-04
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-06
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-07
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-08
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-09
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-10
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2024-11
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2023-12
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2023-13
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2023-14
Could not compute solution for formula : Angiogenesis-PT-01-CTLFireability-2023-15
BK_STOP 1717181781857
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/534/ctl_0_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/534/ctl_1_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/534/ctl_2_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/534/ctl_3_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/534/ctl_4_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/534/ctl_5_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/534/ctl_6_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/534/ctl_7_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/534/ctl_8_
ctl formula name Angiogenesis-PT-01-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/534/ctl_9_
ctl formula name Angiogenesis-PT-01-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/534/ctl_10_
ctl formula name Angiogenesis-PT-01-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/534/ctl_11_
ctl formula name Angiogenesis-PT-01-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/534/ctl_12_
ctl formula name Angiogenesis-PT-01-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/534/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="Angiogenesis-PT-01"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Angiogenesis-PT-01, 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 r468-smll-171620166800002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-01.tgz
mv Angiogenesis-PT-01 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 ;