About the Execution of LTSMin+red for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 681.279 | 153268.00 | 221288.00 | 423.90 | TTTTT???TFTT??TT | 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.r480-tall-171624189900743.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DES-PT-50b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900743
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K 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 DES-PT-50b-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-50b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717198300884
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:31:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:31:42] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-31 23:31:42] [INFO ] Transformed 479 places.
[2024-05-31 23:31:42] [INFO ] Transformed 430 transitions.
[2024-05-31 23:31:42] [INFO ] Found NUPN structural information;
[2024-05-31 23:31:42] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (342 resets) in 1845 ms. (21 steps per ms) remains 8/15 properties
FORMULA DES-PT-50b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (40 resets) in 345 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (56 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (46 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (53 resets) in 872 ms. (45 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (51 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (47 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (41 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
// Phase 1: matrix 430 rows 479 cols
[2024-05-31 23:31:44] [INFO ] Computed 65 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 271/447 variables, 40/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 271/487 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 7/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 32/479 variables, 18/512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 32/544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 430/909 variables, 479/1023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/909 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/909 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 1023 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4945 ms.
Refiners :[Domain max(s): 479/479 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem DES-PT-50b-ReachabilityFireability-2024-02 is UNSAT
FORMULA DES-PT-50b-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 271/447 variables, 40/216 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 271/487 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 7/494 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/494 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem DES-PT-50b-ReachabilityFireability-2024-04 is UNSAT
FORMULA DES-PT-50b-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem DES-PT-50b-ReachabilityFireability-2024-11 is UNSAT
FORMULA DES-PT-50b-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 32/479 variables, 18/512 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 32/544 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-31 23:31:50] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 49 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/545 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-31 23:31:51] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 1/546 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-31 23:31:52] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-05-31 23:31:52] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:31:52] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 3 ms to minimize.
[2024-05-31 23:31:52] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 3 ms to minimize.
[2024-05-31 23:31:52] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:31:53] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-31 23:31:53] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-31 23:31:53] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-31 23:31:53] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-31 23:31:53] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 10/556 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/909 variables, and 556 constraints, problems are : Problem set: 3 solved, 5 unsolved in 5010 ms.
Refiners :[Domain max(s): 479/479 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/479 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 12/12 constraints]
After SMT, in 10242ms problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 150 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 470 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 470 transition count 424
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 467 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 463 transition count 420
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 463 transition count 416
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 459 transition count 416
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 33 place count 449 transition count 406
Iterating global reduction 3 with 10 rules applied. Total rules applied 43 place count 449 transition count 406
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 447 transition count 404
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 447 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 447 transition count 403
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 108 place count 417 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 417 transition count 372
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 116 place count 417 transition count 365
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 123 place count 410 transition count 365
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 410 transition count 365
Applied a total of 124 rules in 193 ms. Remains 410 /479 variables (removed 69) and now considering 365/430 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 410/479 places, 365/430 transitions.
RANDOM walk for 40000 steps (431 resets) in 1209 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (65 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (66 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (75 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (57 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (58 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 613731 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 5
Probabilistic random walk after 613731 steps, saw 96731 distinct states, run finished after 3006 ms. (steps per millisecond=204 ) properties seen :0
// Phase 1: matrix 365 rows 410 cols
[2024-05-31 23:31:58] [INFO ] Computed 59 invariants in 6 ms
[2024-05-31 23:31:58] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 72/222 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 141/363 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3/366 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 365/731 variables, 366/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/731 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 44/775 variables, 44/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/775 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/775 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 775/775 variables, and 470 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2207 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 72/222 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:32:00] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 141/363 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:32:00] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:32:00] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:32:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/366 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 365/731 variables, 366/429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/731 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 44/775 variables, 44/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/775 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:32:05] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-31 23:32:05] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-31 23:32:06] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/775 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:32:15] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/775 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/775 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/775 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 775/775 variables, and 483 constraints, problems are : Problem set: 0 solved, 5 unsolved in 32402 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 34728ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 28734 ms.
Support contains 150 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 365/365 transitions.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 410/410 places, 365/365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 365/365 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2024-05-31 23:33:01] [INFO ] Invariant cache hit.
[2024-05-31 23:33:01] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-31 23:33:01] [INFO ] Invariant cache hit.
[2024-05-31 23:33:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:33:02] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-05-31 23:33:02] [INFO ] Redundant transitions in 21 ms returned []
Running 364 sub problems to find dead transitions.
[2024-05-31 23:33:02] [INFO ] Invariant cache hit.
[2024-05-31 23:33:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/775 variables, 410/469 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (OVERLAPS) 0/775 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 775/775 variables, and 470 constraints, problems are : Problem set: 0 solved, 364 unsolved in 26361 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 23:33:31] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-31 23:33:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-31 23:33:31] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 23:33:31] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:33:31] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 5 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-31 23:33:32] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-31 23:33:33] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-31 23:33:33] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:33:33] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 23:33:33] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:33:33] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:33:33] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:33:33] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:33:33] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:33:34] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:33:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-31 23:33:34] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-31 23:33:34] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-31 23:33:34] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-31 23:33:35] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:33:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 23:33:37] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:33:37] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:33:37] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:33:37] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:33:37] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 8 ms to minimize.
[2024-05-31 23:33:37] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 23:33:40] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:33:40] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-31 23:33:40] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:33:40] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:33:41] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:33:41] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-31 23:33:41] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:33:41] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:33:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 23:33:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 23:33:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 10 (OVERLAPS) 365/775 variables, 410/518 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/775 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/775 variables, 364/883 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/775 variables, and 883 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 49/49 constraints]
After SMT, in 56657ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 56663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57315 ms. Remains : 410/410 places, 365/365 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-31 23:33:59] [INFO ] Invariant cache hit.
[2024-05-31 23:33:59] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-31 23:33:59] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 27 ms returned sat
[2024-05-31 23:33:59] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 23:33:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-31 23:33:59] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 21 ms returned sat
[2024-05-31 23:34:01] [INFO ] After 1693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-31 23:34:01] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:34:01] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:34:01] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:34:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:34:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 385 ms
[2024-05-31 23:34:02] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 3 ms to minimize.
[2024-05-31 23:34:02] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-31 23:34:02] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-31 23:34:02] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:34:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 657 ms
TRAPS : Iteration 1
[2024-05-31 23:34:04] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 23:34:04] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2024-05-31 23:34:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2024-05-31 23:34:04] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-31 23:34:04] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:34:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2024-05-31 23:34:05] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:34:05] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:34:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2024-05-31 23:34:06] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
TRAPS : Iteration 2
[2024-05-31 23:34:06] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-05-31 23:34:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-31 23:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
TRAPS : Iteration 3
[2024-05-31 23:34:09] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
TRAPS : Iteration 4
[2024-05-31 23:34:11] [INFO ] After 11814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-31 23:34:13] [INFO ] After 14295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 14566 ms.
[2024-05-31 23:34:13] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-31 23:34:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 410 places, 365 transitions and 1380 arcs took 6 ms.
[2024-05-31 23:34:13] [INFO ] Flatten gal took : 59 ms
Total runtime 151508 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 : DES-PT-50b-ReachabilityFireability-2024-05
Could not compute solution for formula : DES-PT-50b-ReachabilityFireability-2024-06
Could not compute solution for formula : DES-PT-50b-ReachabilityFireability-2024-07
Could not compute solution for formula : DES-PT-50b-ReachabilityFireability-2024-12
Could not compute solution for formula : DES-PT-50b-ReachabilityFireability-2024-13
BK_STOP 1717198454152
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name DES-PT-50b-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/804/inv_0_
rfs formula name DES-PT-50b-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/804/inv_1_
rfs formula name DES-PT-50b-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/804/inv_2_
rfs formula name DES-PT-50b-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/804/inv_3_
rfs formula name DES-PT-50b-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/804/inv_4_
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="DES-PT-50b"
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 DES-PT-50b, 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 r480-tall-171624189900743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 ;