About the Execution of LTSMin+red for Szymanski-PT-b04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9923.531 | 176937.00 | 224859.00 | 365.60 | T?TTTFFFTFTFTFTT | 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.r536-tall-171690533300870.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 Szymanski-PT-b04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533300870
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b04-ReachabilityCardinality-2024-00
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-01
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-02
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-03
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-04
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-05
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-06
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-07
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-08
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-09
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-10
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-11
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-12
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-13
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-14
FORMULA_NAME Szymanski-PT-b04-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717282981099
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:03:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:03:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:03:02] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2024-06-01 23:03:02] [INFO ] Transformed 568 places.
[2024-06-01 23:03:02] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:03:02] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 469 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40003 steps (8 resets) in 1440 ms. (27 steps per ms) remains 11/12 properties
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (15 resets) in 531 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (10 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (11 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (13 resets) in 259 ms. (153 steps per ms) remains 10/11 properties
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 492 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 316 ms. (126 steps per ms) remains 10/10 properties
[2024-06-01 23:03:04] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:03:04] [INFO ] Computed 3 invariants in 53 ms
[2024-06-01 23:03:04] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-09 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-12 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-13 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-14 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-15 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 256/307 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2733/3041 variables, 308/311 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3041 variables, 147/458 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 458 constraints, problems are : Problem set: 8 solved, 2 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem Szymanski-PT-b04-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 302/307 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-06-01 23:03:06] [INFO ] Deduced a trap composed of 76 places in 592 ms of which 22 ms to minimize.
[2024-06-01 23:03:06] [INFO ] Deduced a trap composed of 135 places in 626 ms of which 3 ms to minimize.
[2024-06-01 23:03:07] [INFO ] Deduced a trap composed of 132 places in 572 ms of which 2 ms to minimize.
[2024-06-01 23:03:07] [INFO ] Deduced a trap composed of 133 places in 587 ms of which 2 ms to minimize.
[2024-06-01 23:03:08] [INFO ] Deduced a trap composed of 130 places in 631 ms of which 8 ms to minimize.
[2024-06-01 23:03:09] [INFO ] Deduced a trap composed of 130 places in 553 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 6/8 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/9 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2733/3041 variables, 308/317 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3041/3041 variables, and 464 constraints, problems are : Problem set: 9 solved, 1 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 6282ms problems are : Problem set: 9 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 306 transition count 8000
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 305 transition count 7872
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 305 transition count 7872
Applied a total of 67 rules in 456 ms. Remains 305 /308 variables (removed 3) and now considering 7872/8064 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 305/308 places, 7872/8064 transitions.
RANDOM walk for 40006 steps (9 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 165637 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 1
Probabilistic random walk after 165637 steps, saw 58536 distinct states, run finished after 3008 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 23:03:14] [INFO ] Flow matrix only has 2668 transitions (discarded 5204 similar events)
// Phase 1: matrix 2668 rows 305 cols
[2024-06-01 23:03:14] [INFO ] Computed 2 invariants in 26 ms
[2024-06-01 23:03:14] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 302/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2668/2973 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2973 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2973 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/2973 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2973/2973 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 810 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 302/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2668/2973 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2973/2973 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9504 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10386ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7872/7872 transitions.
Applied a total of 0 rules in 263 ms. Remains 305 /305 variables (removed 0) and now considering 7872/7872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 305/305 places, 7872/7872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7872/7872 transitions.
Applied a total of 0 rules in 314 ms. Remains 305 /305 variables (removed 0) and now considering 7872/7872 (removed 0) transitions.
[2024-06-01 23:03:25] [INFO ] Flow matrix only has 2668 transitions (discarded 5204 similar events)
[2024-06-01 23:03:25] [INFO ] Invariant cache hit.
[2024-06-01 23:03:25] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-06-01 23:03:25] [INFO ] Flow matrix only has 2668 transitions (discarded 5204 similar events)
[2024-06-01 23:03:25] [INFO ] Invariant cache hit.
[2024-06-01 23:03:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:03:57] [INFO ] Performed 73/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:04:23] [INFO ] Implicit Places using invariants and state equation in 58164 ms returned []
Implicit Place search using SMT with State Equation took 58686 ms to find 0 implicit places.
[2024-06-01 23:04:24] [INFO ] Redundant transitions in 916 ms returned []
Running 7870 sub problems to find dead transitions.
[2024-06-01 23:04:24] [INFO ] Flow matrix only has 2668 transitions (discarded 5204 similar events)
[2024-06-01 23:04:24] [INFO ] Invariant cache hit.
[2024-06-01 23:04:24] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2973 variables, and 2 constraints, problems are : Problem set: 0 solved, 7870 unsolved in 30165 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7870/7870 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2973 variables, and 2 constraints, problems are : Problem set: 0 solved, 7870 unsolved in 30105 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7870 constraints, Known Traps: 0/0 constraints]
After SMT, in 88411ms problems are : Problem set: 0 solved, 7870 unsolved
Search for dead transitions found 0 dead transitions in 88491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148455 ms. Remains : 305/305 places, 7872/7872 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5168 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 13 ms
Free SCC test removed 23 places
Drop transitions (Empty/Sink Transition effects.) removed 3080 transitions
Ensure Unique test removed 2159 transitions
Reduce isomorphic transitions removed 5239 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 282 transition count 2632
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 281 transition count 2631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 280 transition count 2631
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 5 place count 280 transition count 2628
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 11 place count 277 transition count 2628
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 276 transition count 2627
Drop transitions (Redundant composition of simpler transitions.) removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 3 with 417 rules applied. Total rules applied 430 place count 276 transition count 2210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 430 place count 276 transition count 2209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 432 place count 275 transition count 2209
Applied a total of 432 rules in 281 ms. Remains 275 /305 variables (removed 30) and now considering 2209/7872 (removed 5663) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2209 rows 275 cols
[2024-06-01 23:05:53] [INFO ] Computed 2 invariants in 26 ms
[2024-06-01 23:05:53] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 23:05:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 23:05:54] [INFO ] After 1093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 23:05:54] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-06-01 23:05:55] [INFO ] After 927ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 23:05:56] [INFO ] After 1730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 23:05:56] [INFO ] After 3377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3771 ms.
[2024-06-01 23:05:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 20 ms.
[2024-06-01 23:05:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7872 transitions and 31488 arcs took 34 ms.
[2024-06-01 23:05:57] [INFO ] Flatten gal took : 500 ms
Total runtime 175529 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 : Szymanski-PT-b04-ReachabilityCardinality-2024-01
BK_STOP 1717283158036
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name Szymanski-PT-b04-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/564/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="Szymanski-PT-b04"
export BK_EXAMINATION="ReachabilityCardinality"
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 Szymanski-PT-b04, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690533300870"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;