About the Execution of GreatSPN+red for DoubleLock-PT-p3s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13880.995 | 3600000.00 | 5053869.00 | 7903.70 | TTFFFTTTT?FFT?FT | 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.r135-tall-171631131500638.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleLock-PT-p3s2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500638
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 330K 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 DoubleLock-PT-p3s2-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-06
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-07
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-08
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2023-09
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2023-13
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-14
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716398526059
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:22:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 17:22:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:22:07] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-22 17:22:07] [INFO ] Transformed 112 places.
[2024-05-22 17:22:07] [INFO ] Transformed 744 transitions.
[2024-05-22 17:22:07] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 32 transitions.
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (470 resets) in 1315 ms. (30 steps per ms) remains 7/11 properties
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (89 resets) in 275 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (70 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (102 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (100 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (101 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (216 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (66 resets) in 900 ms. (44 steps per ms) remains 7/7 properties
[2024-05-22 17:22:08] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 92 cols
[2024-05-22 17:22:08] [INFO ] Computed 4 invariants in 20 ms
[2024-05-22 17:22:08] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem DoubleLock-PT-p3s2-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityCardinality-2024-10 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityCardinality-2024-11 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 29/85 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 513/599 variables, 86/90 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 47/137 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/607 variables, 6/143 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 0/143 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/607 variables, 0/143 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 143 constraints, problems are : Problem set: 5 solved, 2 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/83 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 513/597 variables, 84/88 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 47/135 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 1/136 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/136 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/607 variables, 8/144 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 1/145 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/145 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/607 variables, 0/145 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 607/607 variables, and 145 constraints, problems are : Problem set: 5 solved, 2 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1465ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 45 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 712/712 transitions.
Graph (complete) has 1229 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 90 /92 variables (removed 2) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 90/92 places, 712/712 transitions.
RANDOM walk for 40006 steps (467 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (96 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 466680 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 2
Probabilistic random walk after 466680 steps, saw 326016 distinct states, run finished after 3005 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-22 17:22:13] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 90 cols
[2024-05-22 17:22:13] [INFO ] Computed 3 invariants in 9 ms
[2024-05-22 17:22:13] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 513/596 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 47/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/605 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/605 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 140 constraints, problems are : Problem set: 0 solved, 2 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 513/596 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 47/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/605 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/605 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1063ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 712/712 transitions.
Applied a total of 0 rules in 20 ms. Remains 90 /90 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 90/90 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 712/712 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2024-05-22 17:22:14] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:22:14] [INFO ] Invariant cache hit.
[2024-05-22 17:22:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 17:22:14] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:22:14] [INFO ] Invariant cache hit.
[2024-05-22 17:22:14] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 17:22:14] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-22 17:22:14] [INFO ] Redundant transitions in 41 ms returned []
Running 710 sub problems to find dead transitions.
[2024-05-22 17:22:14] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:22:14] [INFO ] Invariant cache hit.
[2024-05-22 17:22:14] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 710 unsolved
[2024-05-22 17:22:19] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 9 ms to minimize.
Problem TDEAD464 is UNSAT
[2024-05-22 17:22:19] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/5 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 515/605 variables, 90/95 constraints. Problems are: Problem set: 144 solved, 566 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 47/142 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/142 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 8 (OVERLAPS) 0/605 variables, 0/142 constraints. Problems are: Problem set: 144 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 142 constraints, problems are : Problem set: 144 solved, 566 unsolved in 15540 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 144 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 9/90 variables, 2/3 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/5 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 515/605 variables, 90/95 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 47/142 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 566/708 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/708 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 9 (OVERLAPS) 0/605 variables, 0/708 constraints. Problems are: Problem set: 144 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 708 constraints, problems are : Problem set: 144 solved, 566 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 566/710 constraints, Known Traps: 2/2 constraints]
After SMT, in 46268ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 46277ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 568/712 transitions.
Graph (complete) has 975 edges and 90 vertex of which 84 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 84 /90 variables (removed 6) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:23:00] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 84 cols
[2024-05-22 17:23:00] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 17:23:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 17:23:01] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:01] [INFO ] Invariant cache hit.
[2024-05-22 17:23:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:23:01] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/90 places, 568/712 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46894 ms. Remains : 84/90 places, 568/712 transitions.
RANDOM walk for 40008 steps (481 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (111 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 524994 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 2
Probabilistic random walk after 524994 steps, saw 371276 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-22 17:23:04] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:04] [INFO ] Invariant cache hit.
[2024-05-22 17:23:04] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 387/461 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 12/473 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/473 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 387/461 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/473 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/473 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 129 constraints, problems are : Problem set: 0 solved, 2 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 735ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 568/568 transitions.
Applied a total of 0 rules in 17 ms. Remains 84 /84 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 84/84 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 84 /84 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:23:05] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:05] [INFO ] Invariant cache hit.
[2024-05-22 17:23:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 17:23:05] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:05] [INFO ] Invariant cache hit.
[2024-05-22 17:23:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:23:05] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-22 17:23:05] [INFO ] Redundant transitions in 7 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:23:05] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:05] [INFO ] Invariant cache hit.
[2024-05-22 17:23:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 389/471 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 2/473 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 9 (OVERLAPS) 0/473 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 127 constraints, problems are : Problem set: 0 solved, 566 unsolved in 21472 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 389/471 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 404/529 constraints. Problems are: Problem set: 0 solved, 566 unsolved
[2024-05-22 17:23:36] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-22 17:23:36] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/473 variables, and 531 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 404/566 constraints, Known Traps: 2/2 constraints]
After SMT, in 51913ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 51919ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52143 ms. Remains : 84/84 places, 568/568 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 84 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 179 place count 84 transition count 388
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 181 place count 83 transition count 388
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 1 with 2 rules applied. Total rules applied 183 place count 82 transition count 387
Applied a total of 183 rules in 30 ms. Remains 82 /84 variables (removed 2) and now considering 387/568 (removed 181) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 387 rows 82 cols
[2024-05-22 17:23:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 17:23:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 17:23:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 17:23:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 17:23:57] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 17:23:57] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 17:23:58] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 913 ms.
[2024-05-22 17:23:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-22 17:23:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 84 places, 568 transitions and 2256 arcs took 5 ms.
[2024-05-22 17:23:58] [INFO ] Flatten gal took : 109 ms
Total runtime 111257 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p3s2
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 84
TRANSITIONS: 568
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.003s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 622
MODEL NAME: /home/mcc/execution/410/model
84 places, 568 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleLock-PT-p3s2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleLock-PT-p3s2, 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 r135-tall-171631131500638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s2.tgz
mv DoubleLock-PT-p3s2 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 ;