About the Execution of GreatSPN+red for AutoFlight-PT-12b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
383.731 | 15435.00 | 36544.00 | 97.90 | TFFFTTFFTTTTFFFF | 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.r025-smll-171620166000166.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 AutoFlight-PT-12b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166000166
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 266K 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 AutoFlight-PT-12b-ReachabilityCardinality-2024-00
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-01
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-02
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-03
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-04
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-05
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-06
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-07
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-08
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-09
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-10
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-11
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-12
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-13
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-14
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716300692037
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:11:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:11:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:11:34] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-05-21 14:11:34] [INFO ] Transformed 1126 places.
[2024-05-21 14:11:34] [INFO ] Transformed 1124 transitions.
[2024-05-21 14:11:34] [INFO ] Found NUPN structural information;
[2024-05-21 14:11:34] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (72 resets) in 2415 ms. (16 steps per ms) remains 7/13 properties
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 584 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 595 ms. (67 steps per ms) remains 7/7 properties
// Phase 1: matrix 1124 rows 1126 cols
[2024-05-21 14:11:36] [INFO ] Computed 76 invariants in 53 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 980/1068 variables, 75/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1068 variables, 980/1143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1068 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 58/1126 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 58/1202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1126 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1124/2250 variables, 1126/2328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2250 variables, 0/2328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/2250 variables, 0/2328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2250/2250 variables, and 2328 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2978 ms.
Refiners :[Domain max(s): 1126/1126 constraints, Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1126/1126 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 980/1068 variables, 75/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1068 variables, 980/1143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 14:11:40] [INFO ] Deduced a trap composed of 52 places in 466 ms of which 69 ms to minimize.
[2024-05-21 14:11:41] [INFO ] Deduced a trap composed of 34 places in 359 ms of which 8 ms to minimize.
[2024-05-21 14:11:41] [INFO ] Deduced a trap composed of 46 places in 419 ms of which 7 ms to minimize.
[2024-05-21 14:11:42] [INFO ] Deduced a trap composed of 36 places in 421 ms of which 7 ms to minimize.
[2024-05-21 14:11:42] [INFO ] Deduced a trap composed of 50 places in 481 ms of which 9 ms to minimize.
[2024-05-21 14:11:43] [INFO ] Deduced a trap composed of 34 places in 484 ms of which 9 ms to minimize.
[2024-05-21 14:11:43] [INFO ] Deduced a trap composed of 44 places in 350 ms of which 5 ms to minimize.
[2024-05-21 14:11:43] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 5 ms to minimize.
[2024-05-21 14:11:44] [INFO ] Deduced a trap composed of 86 places in 271 ms of which 5 ms to minimize.
[2024-05-21 14:11:44] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 5 ms to minimize.
[2024-05-21 14:11:44] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 4 ms to minimize.
[2024-05-21 14:11:44] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 5 ms to minimize.
SMT process timed out in 8250ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1126 transition count 766
Reduce places removed 358 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 413 rules applied. Total rules applied 771 place count 768 transition count 711
Reduce places removed 12 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 34 rules applied. Total rules applied 805 place count 756 transition count 689
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 24 rules applied. Total rules applied 829 place count 734 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 830 place count 733 transition count 687
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 126 Pre rules applied. Total rules applied 830 place count 733 transition count 561
Deduced a syphon composed of 126 places in 5 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 5 with 252 rules applied. Total rules applied 1082 place count 607 transition count 561
Discarding 87 places :
Symmetric choice reduction at 5 with 87 rule applications. Total rules 1169 place count 520 transition count 474
Iterating global reduction 5 with 87 rules applied. Total rules applied 1256 place count 520 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1259 place count 520 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1260 place count 519 transition count 471
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 27 Pre rules applied. Total rules applied 1260 place count 519 transition count 444
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 1314 place count 492 transition count 444
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 7 with 196 rules applied. Total rules applied 1510 place count 394 transition count 346
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1516 place count 391 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 1526 place count 391 transition count 336
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1530 place count 389 transition count 334
Free-agglomeration rule applied 46 times.
Iterating global reduction 7 with 46 rules applied. Total rules applied 1576 place count 389 transition count 288
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 7 with 46 rules applied. Total rules applied 1622 place count 343 transition count 288
Applied a total of 1622 rules in 368 ms. Remains 343 /1126 variables (removed 783) and now considering 288/1124 (removed 836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 343/1126 places, 288/1124 transitions.
RANDOM walk for 40000 steps (389 resets) in 1040 ms. (38 steps per ms) remains 3/7 properties
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (55 resets) in 185 ms. (215 steps per ms) remains 2/3 properties
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 288 rows 343 cols
[2024-05-21 14:11:45] [INFO ] Computed 76 invariants in 5 ms
[2024-05-21 14:11:45] [INFO ] State equation strengthened by 74 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/165 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/304 variables, 52/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/343 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 288/631 variables, 343/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/631 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 493 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 343/343 constraints, ReadFeed: 74/74 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/165 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 3 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
[2024-05-21 14:11:46] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 2 ms to minimize.
Problem AutoFlight-PT-12b-ReachabilityCardinality-2024-06 is UNSAT
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 13/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 14:11:47] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2024-05-21 14:11:47] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/304 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 14:11:47] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-21 14:11:47] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 2/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AutoFlight-PT-12b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 343/631 variables, and 93 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/343 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 1619ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 13220 ms.
ITS solved all properties within timeout
BK_STOP 1716300707472
--------------------
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
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="AutoFlight-PT-12b"
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 AutoFlight-PT-12b, 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 r025-smll-171620166000166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 ;