About the Execution of GreatSPN+red for Anderson-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12457.312 | 1308627.00 | 4807296.00 | 908.30 | FTTFFTTTFTFTFFTF | 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.r003-smll-171620117500351.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 Anderson-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117500351
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K 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 Anderson-PT-08-ReachabilityFireability-2024-00
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-01
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-02
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-03
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-04
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-05
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-06
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-07
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-08
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-09
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-10
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-11
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-12
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-13
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-14
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716437126256
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:05:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 04:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:05:28] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2024-05-23 04:05:28] [INFO ] Transformed 401 places.
[2024-05-23 04:05:28] [INFO ] Transformed 1328 transitions.
[2024-05-23 04:05:28] [INFO ] Found NUPN structural information;
[2024-05-23 04:05:28] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 162 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2683 ms. (14 steps per ms) remains 11/16 properties
FORMULA Anderson-PT-08-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 9/11 properties
FORMULA Anderson-PT-08-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1064 ms. (37 steps per ms) remains 8/9 properties
FORMULA Anderson-PT-08-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 344 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 822 ms. (48 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 474 ms. (84 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
// Phase 1: matrix 1328 rows 401 cols
[2024-05-23 04:05:30] [INFO ] Computed 19 invariants in 62 ms
[2024-05-23 04:05:30] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem Anderson-PT-08-ReachabilityFireability-2024-03 is UNSAT
FORMULA Anderson-PT-08-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem Anderson-PT-08-ReachabilityFireability-2024-04 is UNSAT
FORMULA Anderson-PT-08-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Anderson-PT-08-ReachabilityFireability-2024-10 is UNSAT
FORMULA Anderson-PT-08-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 288/400 variables, 9/121 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 288/409 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 7/416 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/416 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/401 variables, 3/419 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/420 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/420 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1328/1729 variables, 401/821 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 56/877 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 877 constraints, problems are : Problem set: 3 solved, 5 unsolved in 3792 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 315/400 variables, 9/94 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 315/409 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 7/416 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/416 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem Anderson-PT-08-ReachabilityFireability-2024-07 is UNSAT
FORMULA Anderson-PT-08-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 1/401 variables, 3/419 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/420 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 04:05:36] [INFO ] Deduced a trap composed of 105 places in 496 ms of which 48 ms to minimize.
[2024-05-23 04:05:37] [INFO ] Deduced a trap composed of 130 places in 456 ms of which 6 ms to minimize.
[2024-05-23 04:05:37] [INFO ] Deduced a trap composed of 196 places in 418 ms of which 5 ms to minimize.
[2024-05-23 04:05:38] [INFO ] Deduced a trap composed of 103 places in 506 ms of which 6 ms to minimize.
[2024-05-23 04:05:38] [INFO ] Deduced a trap composed of 136 places in 483 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 5/425 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/425 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1328/1729 variables, 401/826 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 56/882 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 2/884 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 884 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5015 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 9660ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 45 Pre rules applied. Total rules applied 0 place count 401 transition count 1283
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 0 with 90 rules applied. Total rules applied 90 place count 356 transition count 1283
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 162 place count 284 transition count 875
Iterating global reduction 0 with 72 rules applied. Total rules applied 234 place count 284 transition count 875
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 248 place count 277 transition count 868
Applied a total of 248 rules in 190 ms. Remains 277 /401 variables (removed 124) and now considering 868/1328 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 277/401 places, 868/1328 transitions.
RANDOM walk for 40000 steps (8 resets) in 532 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 244105 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 4
Probabilistic random walk after 244105 steps, saw 147302 distinct states, run finished after 3008 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 868 rows 277 cols
[2024-05-23 04:05:44] [INFO ] Computed 19 invariants in 17 ms
[2024-05-23 04:05:44] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 201/275 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 868/1145 variables, 277/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1145 variables, 56/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1145 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1145 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 352 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 277/277 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 201/275 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 868/1145 variables, 277/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1145 variables, 56/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1145 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1145 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1145 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1145/1145 variables, and 356 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6246 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 277/277 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7625ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 74 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 868/868 transitions.
Applied a total of 0 rules in 38 ms. Remains 277 /277 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 277/277 places, 868/868 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 868/868 transitions.
Applied a total of 0 rules in 25 ms. Remains 277 /277 variables (removed 0) and now considering 868/868 (removed 0) transitions.
[2024-05-23 04:05:52] [INFO ] Invariant cache hit.
[2024-05-23 04:05:52] [INFO ] Implicit Places using invariants in 359 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 372 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 276/277 places, 868/868 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 276 transition count 862
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 270 transition count 862
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 270 transition count 854
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 28 place count 262 transition count 854
Applied a total of 28 rules in 63 ms. Remains 262 /276 variables (removed 14) and now considering 854/868 (removed 14) transitions.
// Phase 1: matrix 854 rows 262 cols
[2024-05-23 04:05:52] [INFO ] Computed 18 invariants in 12 ms
[2024-05-23 04:05:52] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-23 04:05:52] [INFO ] Invariant cache hit.
[2024-05-23 04:05:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 04:05:54] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 262/277 places, 854/868 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2221 ms. Remains : 262/277 places, 854/868 transitions.
RANDOM walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 234489 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 4
Probabilistic random walk after 234489 steps, saw 139228 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-23 04:05:57] [INFO ] Invariant cache hit.
[2024-05-23 04:05:57] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/261 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/262 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 854/1116 variables, 262/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 56/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1116 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1116 variables, and 336 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 262/262 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/261 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/262 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 04:05:59] [INFO ] Deduced a trap composed of 124 places in 265 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 04:05:59] [INFO ] Deduced a trap composed of 135 places in 276 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 854/1116 variables, 262/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 56/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1116 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1116 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1116 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1116 variables, and 342 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4436 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 262/262 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 5622ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 74 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 854/854 transitions.
Applied a total of 0 rules in 18 ms. Remains 262 /262 variables (removed 0) and now considering 854/854 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 262/262 places, 854/854 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 854/854 transitions.
Applied a total of 0 rules in 18 ms. Remains 262 /262 variables (removed 0) and now considering 854/854 (removed 0) transitions.
[2024-05-23 04:06:03] [INFO ] Invariant cache hit.
[2024-05-23 04:06:03] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-23 04:06:03] [INFO ] Invariant cache hit.
[2024-05-23 04:06:03] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 04:06:04] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2024-05-23 04:06:05] [INFO ] Redundant transitions in 58 ms returned []
Running 846 sub problems to find dead transitions.
[2024-05-23 04:06:05] [INFO ] Invariant cache hit.
[2024-05-23 04:06:05] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 04:06:12] [INFO ] Deduced a trap composed of 79 places in 278 ms of which 4 ms to minimize.
[2024-05-23 04:06:12] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 3 ms to minimize.
[2024-05-23 04:06:13] [INFO ] Deduced a trap composed of 104 places in 262 ms of which 3 ms to minimize.
[2024-05-23 04:06:13] [INFO ] Deduced a trap composed of 79 places in 266 ms of which 3 ms to minimize.
[2024-05-23 04:06:13] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 3 ms to minimize.
[2024-05-23 04:06:14] [INFO ] Deduced a trap composed of 98 places in 269 ms of which 4 ms to minimize.
[2024-05-23 04:06:14] [INFO ] Deduced a trap composed of 133 places in 273 ms of which 3 ms to minimize.
[2024-05-23 04:06:14] [INFO ] Deduced a trap composed of 80 places in 264 ms of which 4 ms to minimize.
[2024-05-23 04:06:14] [INFO ] Deduced a trap composed of 113 places in 260 ms of which 3 ms to minimize.
[2024-05-23 04:06:15] [INFO ] Deduced a trap composed of 101 places in 274 ms of which 3 ms to minimize.
[2024-05-23 04:06:15] [INFO ] Deduced a trap composed of 135 places in 259 ms of which 3 ms to minimize.
[2024-05-23 04:06:15] [INFO ] Deduced a trap composed of 102 places in 267 ms of which 3 ms to minimize.
[2024-05-23 04:06:15] [INFO ] Deduced a trap composed of 99 places in 262 ms of which 3 ms to minimize.
[2024-05-23 04:06:16] [INFO ] Deduced a trap composed of 80 places in 285 ms of which 4 ms to minimize.
[2024-05-23 04:06:16] [INFO ] Deduced a trap composed of 85 places in 278 ms of which 3 ms to minimize.
[2024-05-23 04:06:16] [INFO ] Deduced a trap composed of 77 places in 264 ms of which 4 ms to minimize.
[2024-05-23 04:06:17] [INFO ] Deduced a trap composed of 79 places in 273 ms of which 3 ms to minimize.
[2024-05-23 04:06:17] [INFO ] Deduced a trap composed of 73 places in 227 ms of which 3 ms to minimize.
[2024-05-23 04:06:17] [INFO ] Deduced a trap composed of 73 places in 287 ms of which 3 ms to minimize.
[2024-05-23 04:06:18] [INFO ] Deduced a trap composed of 94 places in 257 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 04:06:19] [INFO ] Deduced a trap composed of 97 places in 241 ms of which 3 ms to minimize.
[2024-05-23 04:06:19] [INFO ] Deduced a trap composed of 80 places in 248 ms of which 3 ms to minimize.
[2024-05-23 04:06:19] [INFO ] Deduced a trap composed of 137 places in 265 ms of which 3 ms to minimize.
[2024-05-23 04:06:19] [INFO ] Deduced a trap composed of 80 places in 277 ms of which 3 ms to minimize.
[2024-05-23 04:06:20] [INFO ] Deduced a trap composed of 93 places in 279 ms of which 3 ms to minimize.
[2024-05-23 04:06:20] [INFO ] Deduced a trap composed of 71 places in 280 ms of which 3 ms to minimize.
[2024-05-23 04:06:20] [INFO ] Deduced a trap composed of 117 places in 277 ms of which 4 ms to minimize.
[2024-05-23 04:06:21] [INFO ] Deduced a trap composed of 75 places in 277 ms of which 3 ms to minimize.
[2024-05-23 04:06:21] [INFO ] Deduced a trap composed of 78 places in 238 ms of which 3 ms to minimize.
[2024-05-23 04:06:21] [INFO ] Deduced a trap composed of 83 places in 298 ms of which 3 ms to minimize.
[2024-05-23 04:06:22] [INFO ] Deduced a trap composed of 119 places in 285 ms of which 3 ms to minimize.
[2024-05-23 04:06:22] [INFO ] Deduced a trap composed of 112 places in 281 ms of which 3 ms to minimize.
[2024-05-23 04:06:22] [INFO ] Deduced a trap composed of 120 places in 281 ms of which 4 ms to minimize.
[2024-05-23 04:06:22] [INFO ] Deduced a trap composed of 99 places in 286 ms of which 3 ms to minimize.
[2024-05-23 04:06:23] [INFO ] Deduced a trap composed of 78 places in 283 ms of which 3 ms to minimize.
[2024-05-23 04:06:23] [INFO ] Deduced a trap composed of 101 places in 279 ms of which 3 ms to minimize.
[2024-05-23 04:06:23] [INFO ] Deduced a trap composed of 132 places in 273 ms of which 4 ms to minimize.
[2024-05-23 04:06:24] [INFO ] Deduced a trap composed of 148 places in 276 ms of which 3 ms to minimize.
[2024-05-23 04:06:24] [INFO ] Deduced a trap composed of 106 places in 247 ms of which 4 ms to minimize.
[2024-05-23 04:06:24] [INFO ] Deduced a trap composed of 105 places in 276 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 04:06:32] [INFO ] Deduced a trap composed of 128 places in 232 ms of which 4 ms to minimize.
[2024-05-23 04:06:32] [INFO ] Deduced a trap composed of 129 places in 308 ms of which 3 ms to minimize.
[2024-05-23 04:06:32] [INFO ] Deduced a trap composed of 127 places in 286 ms of which 3 ms to minimize.
[2024-05-23 04:06:33] [INFO ] Deduced a trap composed of 139 places in 266 ms of which 4 ms to minimize.
[2024-05-23 04:06:33] [INFO ] Deduced a trap composed of 125 places in 266 ms of which 3 ms to minimize.
[2024-05-23 04:06:33] [INFO ] Deduced a trap composed of 152 places in 281 ms of which 4 ms to minimize.
[2024-05-23 04:06:34] [INFO ] Deduced a trap composed of 144 places in 280 ms of which 3 ms to minimize.
[2024-05-23 04:06:34] [INFO ] Deduced a trap composed of 103 places in 263 ms of which 3 ms to minimize.
[2024-05-23 04:06:34] [INFO ] Deduced a trap composed of 134 places in 299 ms of which 3 ms to minimize.
[2024-05-23 04:06:35] [INFO ] Deduced a trap composed of 126 places in 281 ms of which 6 ms to minimize.
[2024-05-23 04:06:35] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-05-23 04:06:35] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 3 ms to minimize.
[2024-05-23 04:06:36] [INFO ] Deduced a trap composed of 75 places in 270 ms of which 3 ms to minimize.
[2024-05-23 04:06:36] [INFO ] Deduced a trap composed of 124 places in 230 ms of which 2 ms to minimize.
[2024-05-23 04:06:36] [INFO ] Deduced a trap composed of 103 places in 277 ms of which 3 ms to minimize.
[2024-05-23 04:06:36] [INFO ] Deduced a trap composed of 75 places in 262 ms of which 3 ms to minimize.
SMT process timed out in 31833ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 31851ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33762 ms. Remains : 262/262 places, 854/854 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 262 transition count 798
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 206 transition count 798
Applied a total of 112 rules in 23 ms. Remains 206 /262 variables (removed 56) and now considering 798/854 (removed 56) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 798 rows 206 cols
[2024-05-23 04:06:37] [INFO ] Computed 18 invariants in 8 ms
[2024-05-23 04:06:37] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 04:06:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 04:06:37] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-23 04:06:38] [INFO ] After 1643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 04:06:40] [INFO ] After 3154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 04:06:41] [INFO ] After 4551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 4755 ms.
[2024-05-23 04:06:41] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-23 04:06:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 262 places, 854 transitions and 3292 arcs took 12 ms.
[2024-05-23 04:06:42] [INFO ] Flatten gal took : 163 ms
Total runtime 74175 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 262
TRANSITIONS: 854
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.000s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 795
MODEL NAME: /home/mcc/execution/415/model
262 places, 854 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Anderson-PT-08-ReachabilityFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-08-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-08-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-08-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716438434883
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
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="Anderson-PT-08"
export BK_EXAMINATION="ReachabilityFireability"
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 Anderson-PT-08, 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 r003-smll-171620117500351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 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 ;