fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r025-smll-171620165700033
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Angiogenesis-PT-20

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15196.876 3600000.00 10652684.00 4456.20 ?F??T??FF???FFTT 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.r025-smll-171620165700033.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 greatspnxred
Input is Angiogenesis-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620165700033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.5K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 33K 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-20-CTLCardinality-2024-00
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-01
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-02
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-03
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-04
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-05
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-06
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-07
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-08
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-09
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-10
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2024-11
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2023-12
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2023-13
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2023-14
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716249339603

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Angiogenesis-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 23:55:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-20 23:55:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:55:42] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-20 23:55:42] [INFO ] Transformed 39 places.
[2024-05-20 23:55:42] [INFO ] Transformed 64 transitions.
[2024-05-20 23:55:42] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Angiogenesis-PT-20-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-20-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 25 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 39 cols
[2024-05-20 23:55:42] [INFO ] Computed 8 invariants in 10 ms
[2024-05-20 23:55:42] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-20 23:55:42] [INFO ] Invariant cache hit.
[2024-05-20 23:55:43] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-20 23:55:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 64/103 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/103 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 47 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 64/103 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 61/108 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 108 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1222 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 2799ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2818ms
Finished structural reductions in LTL mode , in 1 iterations and 3272 ms. Remains : 39/39 places, 64/64 transitions.
Support contains 38 out of 39 places after structural reductions.
[2024-05-20 23:55:46] [INFO ] Flatten gal took : 40 ms
[2024-05-20 23:55:46] [INFO ] Flatten gal took : 17 ms
[2024-05-20 23:55:46] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40030 steps (9 resets) in 1055 ms. (37 steps per ms) remains 18/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
[2024-05-20 23:55:47] [INFO ] Invariant cache hit.
Problem AtomicPropp26 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/39 variables, 8/8 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 64/103 variables, 39/47 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/47 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/103 variables, 0/47 constraints. Problems are: Problem set: 9 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 47 constraints, problems are : Problem set: 9 solved, 9 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 30/36 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/39 variables, 2/8 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 39/47 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 9/56 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/56 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/56 constraints. Problems are: Problem set: 9 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 56 constraints, problems are : Problem set: 9 solved, 9 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 9/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 448ms problems are : Problem set: 9 solved, 9 unsolved
Parikh walk visited 5 properties in 2452 ms.
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 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 38 transition count 63
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 36 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 36 transition count 62
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 19 place count 29 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 88 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 7 rules applied. Total rules applied 26 place count 28 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 28 transition count 48
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 35 place count 24 transition count 54
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 43 place count 24 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 49 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 24 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 51 place count 23 transition count 39
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 53 place count 23 transition count 37
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 56 place count 21 transition count 36
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 58 place count 21 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 59 place count 21 transition count 36
Applied a total of 59 rules in 76 ms. Remains 21 /39 variables (removed 18) and now considering 36/64 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 21/39 places, 36/64 transitions.
RANDOM walk for 40039 steps (8 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/3 properties
[2024-05-20 23:55:50] [INFO ] Flow matrix only has 35 transitions (discarded 1 similar events)
// Phase 1: matrix 35 rows 21 cols
[2024-05-20 23:55:50] [INFO ] Computed 6 invariants in 2 ms
[2024-05-20 23:55:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/21 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/56 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 28 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:55:50] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/21 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/56 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 216ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 36/36 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 18 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 18 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 18 transition count 30
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 18 transition count 29
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 17 transition count 28
Applied a total of 16 rules in 22 ms. Remains 17 /21 variables (removed 4) and now considering 28/36 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 17/21 places, 28/36 transitions.
RANDOM walk for 40053 steps (8 resets) in 46 ms. (852 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2246578 steps, run timeout after 3001 ms. (steps per millisecond=748 ) properties seen :0 out of 1
Probabilistic random walk after 2246578 steps, saw 977572 distinct states, run finished after 3006 ms. (steps per millisecond=747 ) properties seen :0
[2024-05-20 23:55:53] [INFO ] Flow matrix only has 26 transitions (discarded 2 similar events)
// Phase 1: matrix 26 rows 17 cols
[2024-05-20 23:55:53] [INFO ] Computed 6 invariants in 2 ms
[2024-05-20 23:55:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/17 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/43 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:55:53] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/17 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/43 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 26 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 17/17 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-20 23:55:53] [INFO ] Flow matrix only has 26 transitions (discarded 2 similar events)
[2024-05-20 23:55:53] [INFO ] Invariant cache hit.
[2024-05-20 23:55:53] [INFO ] Implicit Places using invariants in 102 ms returned [5, 13, 14, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 105 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 13/17 places, 28/28 transitions.
Graph (trivial) has 14 edges and 13 vertex of which 6 / 13 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 15
Applied a total of 2 rules in 11 ms. Remains 9 /13 variables (removed 4) and now considering 15/28 (removed 13) transitions.
[2024-05-20 23:55:53] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 9 cols
[2024-05-20 23:55:53] [INFO ] Computed 2 invariants in 5 ms
[2024-05-20 23:55:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 23:55:53] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-20 23:55:53] [INFO ] Invariant cache hit.
[2024-05-20 23:55:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 23:55:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 9/17 places, 15/28 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 203 ms. Remains : 9/17 places, 15/28 transitions.
RANDOM walk for 40033 steps (8 resets) in 23 ms. (1668 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3423321 steps, run timeout after 3001 ms. (steps per millisecond=1140 ) properties seen :0 out of 1
Probabilistic random walk after 3423321 steps, saw 361938 distinct states, run finished after 3001 ms. (steps per millisecond=1140 ) properties seen :0
[2024-05-20 23:55:56] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-20 23:55:56] [INFO ] Invariant cache hit.
[2024-05-20 23:55:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 12 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 13 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 9/9 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-20 23:55:57] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-20 23:55:57] [INFO ] Invariant cache hit.
[2024-05-20 23:55:57] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-20 23:55:57] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-20 23:55:57] [INFO ] Invariant cache hit.
[2024-05-20 23:55:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 23:55:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-20 23:55:57] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-20 23:55:57] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-20 23:55:57] [INFO ] Invariant cache hit.
[2024-05-20 23:55:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 12 constraints, problems are : Problem set: 0 solved, 14 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 26 constraints, problems are : Problem set: 0 solved, 14 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 9/9 places, 15/15 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 7 edges and 9 vertex of which 4 / 9 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 3 place count 6 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 6 transition count 8
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 6 transition count 8
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 5 transition count 6
Applied a total of 11 rules in 5 ms. Remains 5 /9 variables (removed 4) and now considering 6/15 (removed 9) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 5 cols
[2024-05-20 23:55:57] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 23:55:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 23:55:57] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 23:55:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 23:55:57] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 23:55:57] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 23:55:57] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA Angiogenesis-PT-20-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-20-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
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 2 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 39/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
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 2 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 13 ms. Remains 36 /39 variables (removed 3) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 36/39 places, 63/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 4668 steps (0 resets) in 22 ms. (202 steps per ms) remains 0/1 properties
FORMULA Angiogenesis-PT-20-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 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 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 38 transition count 64
Applied a total of 4 rules in 8 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 38/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 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 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
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 6 place count 36 transition count 63
Applied a total of 6 rules in 9 ms. Remains 36 /39 variables (removed 3) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 36/39 places, 63/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 63 transitions.
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 2 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
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 2 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 6 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
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 2 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
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 2 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/39 places, 64/64 transitions.
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:57] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 38 transition count 64
Applied a total of 5 rules in 8 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 38/39 places, 64/64 transitions.
[2024-05-20 23:55:58] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:58] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:58] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 189 steps (0 resets) in 5 ms. (31 steps per ms) remains 0/1 properties
FORMULA Angiogenesis-PT-20-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-20 23:55:58] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:58] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:58] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-20 23:55:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 64 transitions and 185 arcs took 4 ms.
Total runtime 16047 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Angiogenesis-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 39
TRANSITIONS: 64
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 616
MODEL NAME: /home/mcc/execution/415/model
39 places, 64 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Angiogenesis-PT-20-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Angiogenesis-PT-20-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Angiogenesis-PT-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620165700033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-20.tgz
mv Angiogenesis-PT-20 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;