About the Execution of LTSMin+red for PolyORBLF-COL-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7093.468 | 175008.00 | 248424.00 | 173.70 | FFTTTTTT?TFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446400119.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S02J06T10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400119
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717249441847
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:44:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:44:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:44:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:44:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1034 ms
[2024-06-01 13:44:04] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:44:04] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-06-01 13:44:04] [INFO ] Skeletonized 16 HLPN properties in 27 ms.
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (19 resets) in 1747 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (16 resets) in 932 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (10 resets) in 467 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (26 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 542656 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 3
Probabilistic random walk after 542656 steps, saw 191300 distinct states, run finished after 3006 ms. (steps per millisecond=180 ) properties seen :0
[2024-06-01 13:44:09] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:44:09] [INFO ] Computed 26 invariants in 7 ms
[2024-06-01 13:44:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/63 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/64 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-07 is UNSAT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-09 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/81 variables, 14/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 2 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/26 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/55 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/58 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 17/75 variables, 11/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/80 variables, 3/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 116 constraints, problems are : Problem set: 2 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 11 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 60
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 75 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 15 place count 73 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 69 transition count 54
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 3 with 6 rules applied. Total rules applied 29 place count 66 transition count 51
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 66 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 65 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 65 transition count 50
Applied a total of 32 rules in 37 ms. Remains 65 /81 variables (removed 16) and now considering 50/65 (removed 15) transitions.
Running 49 sub problems to find dead transitions.
[2024-06-01 13:44:09] [INFO ] Flow matrix only has 49 transitions (discarded 1 similar events)
// Phase 1: matrix 49 rows 65 cols
[2024-06-01 13:44:09] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 13:44:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 13:44:10] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 11 ms to minimize.
[2024-06-01 13:44:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
[2024-06-01 13:44:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:44:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/29 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-06-01 13:44:10] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:44:10] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/31 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 49/114 variables, 65/96 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 8/104 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 104 constraints, problems are : Problem set: 2 solved, 47 unsolved in 1697 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 65/65 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 2 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/31 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 2/36 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 49/114 variables, 65/101 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 8/109 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 47/156 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 14 (OVERLAPS) 0/114 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 156 constraints, problems are : Problem set: 2 solved, 47 unsolved in 1928 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 65/65 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 47/49 constraints, Known Traps: 11/11 constraints]
After SMT, in 3657ms problems are : Problem set: 2 solved, 47 unsolved
Search for dead transitions found 2 dead transitions in 3659ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/81 places, 48/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 61 transition count 44
Applied a total of 4 rules in 10 ms. Remains 61 /65 variables (removed 4) and now considering 44/48 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3724 ms. Remains : 61/81 places, 44/65 transitions.
RANDOM walk for 40000 steps (45 resets) in 700 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (18 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Probably explored full state space saw : 56814 states, properties seen :0
Probabilistic random walk after 151518 steps, saw 56814 distinct states, run finished after 276 ms. (steps per millisecond=548 ) properties seen :0
Explored full state space saw : 56814 states, properties seen :0
Exhaustive walk after 151518 steps, saw 56814 distinct states, run finished after 228 ms. (steps per millisecond=664 ) properties seen :0
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 13:44:14] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:44:14] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-09 TRUE TECHNIQUES CPN_APPROX
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:44:14] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 50 ms.
[2024-06-01 13:44:14] [INFO ] Unfolded 16 HLPN properties in 1 ms.
[2024-06-01 13:44:14] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 13:44:14] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 13:44:14] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 13:44:14] [INFO ] Reduced 40 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (11 resets) in 2056 ms. (19 steps per ms) remains 6/13 properties
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (11 resets) in 2014 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 1199 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 319 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (29 resets) in 415 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 652 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1134 ms. (35 steps per ms) remains 6/6 properties
[2024-06-01 13:44:16] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-06-01 13:44:16] [INFO ] Computed 58 invariants in 62 ms
[2024-06-01 13:44:16] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 62/705 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-01 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-10 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 133/838 variables, 17/52 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 0/52 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/844 variables, 6/58 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 0/58 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2476/2476 variables, and 902 constraints, problems are : Problem set: 5 solved, 1 unsolved in 2651 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 844/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 267/277 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 530/807 variables, 30/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 13:44:22] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 5 ms to minimize.
[2024-06-01 13:44:22] [INFO ] Deduced a trap composed of 73 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:44:22] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 8/40 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 1/41 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 0/41 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/828 variables, 11/52 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 498 places in 480 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 1/53 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 0/53 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/842 variables, 14/67 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 1/68 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/842 variables, 0/68 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2474/2476 variables, and 910 constraints, problems are : Problem set: 5 solved, 1 unsolved in 3775 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 842/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 8821ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 10 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 306 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-06-01 13:44:26] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-06-01 13:44:26] [INFO ] Computed 56 invariants in 28 ms
[2024-06-01 13:44:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:44:41] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:44:41] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:44:41] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 214 places in 349 ms of which 3 ms to minimize.
[2024-06-01 13:44:42] [INFO ] Deduced a trap composed of 218 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:44:46] [INFO ] Deduced a trap composed of 348 places in 315 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1894 variables, and 67 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-06-01 13:45:01] [INFO ] Deduced a trap composed of 186 places in 404 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1894 variables, and 68 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 14/14 constraints]
After SMT, in 43564ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43590ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43901 ms. Remains : 552/844 places, 1362/1652 transitions.
RANDOM walk for 40000 steps (19 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (9 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 312584 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 1
Probabilistic random walk after 312584 steps, saw 190792 distinct states, run finished after 3002 ms. (steps per millisecond=104 ) properties seen :0
[2024-06-01 13:45:12] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 13:45:12] [INFO ] Invariant cache hit.
[2024-06-01 13:45:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 298/515 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 225 places in 372 ms of which 4 ms to minimize.
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 222 places in 338 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/525 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/549 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/550 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1342/1892 variables, 550/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1892 variables, 120/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1892 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1894 variables, 2/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1894 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1894 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1894 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1894/1894 variables, and 739 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3635 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 298/515 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:16] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/525 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/549 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/550 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1342/1892 variables, 550/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1892 variables, 120/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1892 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1892 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1894 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1894 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1894 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1894 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1894/1894 variables, and 741 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 5596ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 182 ms.
Support contains 10 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 48 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 43 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-06-01 13:45:18] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 13:45:18] [INFO ] Invariant cache hit.
[2024-06-01 13:45:19] [INFO ] Implicit Places using invariants in 635 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 646 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 532 transition count 1352
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 532 transition count 1352
Applied a total of 20 rules in 56 ms. Remains 532 /542 variables (removed 10) and now considering 1352/1362 (removed 10) transitions.
[2024-06-01 13:45:19] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
// Phase 1: matrix 1332 rows 532 cols
[2024-06-01 13:45:19] [INFO ] Computed 46 invariants in 60 ms
[2024-06-01 13:45:19] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-06-01 13:45:19] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:45:19] [INFO ] Invariant cache hit.
[2024-06-01 13:45:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:45:30] [INFO ] Implicit Places using invariants and state equation in 10197 ms returned []
Implicit Place search using SMT with State Equation took 10825 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 532/552 places, 1352/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11570 ms. Remains : 532/552 places, 1352/1362 transitions.
RANDOM walk for 40000 steps (19 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (11 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 315294 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 315294 steps, saw 180400 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2024-06-01 13:45:33] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:45:33] [INFO ] Invariant cache hit.
[2024-06-01 13:45:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 4 ms to minimize.
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 4 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 120/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1864 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1864 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2347 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 44 places in 386 ms of which 15 ms to minimize.
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 44 places in 346 ms of which 4 ms to minimize.
[2024-06-01 13:45:37] [INFO ] Deduced a trap composed of 226 places in 338 ms of which 3 ms to minimize.
[2024-06-01 13:45:37] [INFO ] Deduced a trap composed of 218 places in 260 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/530 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1332/1862 variables, 530/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 120/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1862 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1864 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2933 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 5299ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 29 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 25 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-06-01 13:45:38] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:45:38] [INFO ] Invariant cache hit.
[2024-06-01 13:45:39] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-06-01 13:45:39] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:45:39] [INFO ] Invariant cache hit.
[2024-06-01 13:45:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:45:48] [INFO ] Implicit Places using invariants and state equation in 9358 ms returned []
Implicit Place search using SMT with State Equation took 9980 ms to find 0 implicit places.
[2024-06-01 13:45:48] [INFO ] Redundant transitions in 89 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-06-01 13:45:48] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-06-01 13:45:48] [INFO ] Invariant cache hit.
[2024-06-01 13:45:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 4 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:46:05] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:46:13] [INFO ] Deduced a trap composed of 203 places in 319 ms of which 4 ms to minimize.
[2024-06-01 13:46:14] [INFO ] Deduced a trap composed of 224 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:46:15] [INFO ] Deduced a trap composed of 223 places in 296 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:46:25] [INFO ] Deduced a trap composed of 186 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:46:36] [INFO ] Deduced a trap composed of 79 places in 373 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63435ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63453ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73567 ms. Remains : 532/532 places, 1352/1352 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 532 transition count 1332
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 522 transition count 1372
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 80 place count 522 transition count 1332
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 522 transition count 1322
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 512 transition count 1322
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 512 transition count 1312
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 502 transition count 1312
Applied a total of 120 rules in 309 ms. Remains 502 /532 variables (removed 30) and now considering 1312/1352 (removed 40) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1312 rows 502 cols
[2024-06-01 13:46:52] [INFO ] Computed 46 invariants in 36 ms
[2024-06-01 13:46:52] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-06-01 13:46:52] [INFO ] [Real]Absence check using 18 positive and 28 generalized place invariants in 17 ms returned sat
[2024-06-01 13:46:53] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:46:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 13:46:53] [INFO ] [Nat]Absence check using 18 positive and 28 generalized place invariants in 16 ms returned sat
[2024-06-01 13:46:54] [INFO ] After 1109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:46:55] [INFO ] Deduced a trap composed of 210 places in 365 ms of which 3 ms to minimize.
[2024-06-01 13:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
TRAPS : Iteration 1
[2024-06-01 13:46:55] [INFO ] After 1952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:46:56] [INFO ] After 2272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3666 ms.
[2024-06-01 13:46:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 13:46:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 532 places, 1352 transitions and 6970 arcs took 23 ms.
[2024-06-01 13:46:56] [INFO ] Flatten gal took : 201 ms
Total runtime 172899 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 : PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-08
BK_STOP 1717249616855
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/849/inv_0_
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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="ReachabilityFireability"
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 PolyORBLF-COL-S02J06T10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446400119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;