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-171620117100159.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 ASLink-PT-10a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117100159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:23 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 920K 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 ASLink-PT-10a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2023-07
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2023-08
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2023-09
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2023-11
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716401891146

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 18:18:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 18:18:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:18:13] [INFO ] Load time of PNML (sax parser for PT used): 386 ms
[2024-05-22 18:18:13] [INFO ] Transformed 2186 places.
[2024-05-22 18:18:13] [INFO ] Transformed 3192 transitions.
[2024-05-22 18:18:13] [INFO ] Found NUPN structural information;
[2024-05-22 18:18:13] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 593 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
RANDOM walk for 40000 steps (170 resets) in 3215 ms. (12 steps per ms) remains 14/16 properties
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (14 resets) in 915 ms. (43 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (13 resets) in 1039 ms. (38 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 333 ms. (119 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (13 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 304 ms. (131 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 404 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (12 resets) in 316 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (12 resets) in 360 ms. (110 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 333 ms. (119 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 261 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (11 resets) in 282 ms. (141 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (13 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 272 ms. (146 steps per ms) remains 13/14 properties
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (14 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
// Phase 1: matrix 3158 rows 2186 cols
[2024-05-22 18:18:17] [INFO ] Computed 422 invariants in 625 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 278/278 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 165/443 variables, 34/312 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 165/477 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 248/691 variables, 71/548 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 248/796 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ASLink-PT-10a-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1460/2151 variables, 306/1102 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 1460/2562 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 0/2562 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 35/2186 variables, 11/2573 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2186 variables, 35/2608 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2186 variables, 0/2608 constraints. Problems are: Problem set: 1 solved, 12 unsolved
SMT process timed out in 6171ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 276 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 39 places
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 2130 transition count 2993
Reduce places removed 165 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 174 rules applied. Total rules applied 395 place count 1965 transition count 2984
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 404 place count 1956 transition count 2984
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 181 Pre rules applied. Total rules applied 404 place count 1956 transition count 2803
Deduced a syphon composed of 181 places in 6 ms
Ensure Unique test removed 63 places
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 3 with 425 rules applied. Total rules applied 829 place count 1712 transition count 2803
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 836 place count 1705 transition count 2768
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 844 place count 1704 transition count 2768
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 with 4 rules applied. Total rules applied 848 place count 1703 transition count 2765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 849 place count 1702 transition count 2765
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 850 place count 1701 transition count 2757
Iterating global reduction 5 with 1 rules applied. Total rules applied 851 place count 1701 transition count 2757
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 852 place count 1700 transition count 2749
Iterating global reduction 5 with 1 rules applied. Total rules applied 853 place count 1700 transition count 2749
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 6 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 949 place count 1652 transition count 2701
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 953 place count 1652 transition count 2697
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 957 place count 1648 transition count 2697
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 963 place count 1648 transition count 2691
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 969 place count 1642 transition count 2691
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 974 place count 1642 transition count 2691
Applied a total of 974 rules in 1739 ms. Remains 1642 /2186 variables (removed 544) and now considering 2691/3158 (removed 467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1755 ms. Remains : 1642/2186 places, 2691/3158 transitions.
RANDOM walk for 40000 steps (246 resets) in 626 ms. (63 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 490 ms. (81 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (26 resets) in 416 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (26 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (27 resets) in 264 ms. (150 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (26 resets) in 312 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (25 resets) in 237 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (25 resets) in 233 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (26 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (27 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (26 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 88265 steps, run timeout after 3004 ms. (steps per millisecond=29 ) properties seen :0 out of 12
Probabilistic random walk after 88265 steps, saw 26693 distinct states, run finished after 3022 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 2691 rows 1642 cols
[2024-05-22 18:18:29] [INFO ] Computed 301 invariants in 308 ms
[2024-05-22 18:18:29] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 290/566 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 103/669 variables, 46/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 942/1611 variables, 208/294 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1611 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 31/1642 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1642 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2691/4333 variables, 1642/1943 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4333 variables, 56/1999 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4333 variables, 0/1999 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/4333 variables, 0/1999 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4333/4333 variables, and 1999 constraints, problems are : Problem set: 0 solved, 12 unsolved in 10164 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 215/215 constraints, State Equation: 1642/1642 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 290/566 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 103/669 variables, 46/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem ASLink-PT-10a-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 942/1611 variables, 208/294 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-22 18:18:41] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 46 ms to minimize.
[2024-05-22 18:18:42] [INFO ] Deduced a trap composed of 81 places in 850 ms of which 8 ms to minimize.
[2024-05-22 18:18:43] [INFO ] Deduced a trap composed of 110 places in 200 ms of which 3 ms to minimize.
[2024-05-22 18:18:43] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-22 18:18:44] [INFO ] Deduced a trap composed of 71 places in 721 ms of which 10 ms to minimize.
[2024-05-22 18:18:45] [INFO ] Deduced a trap composed of 81 places in 1106 ms of which 10 ms to minimize.
[2024-05-22 18:18:46] [INFO ] Deduced a trap composed of 69 places in 1096 ms of which 9 ms to minimize.
[2024-05-22 18:18:47] [INFO ] Deduced a trap composed of 75 places in 1177 ms of which 15 ms to minimize.
[2024-05-22 18:18:49] [INFO ] Deduced a trap composed of 121 places in 1387 ms of which 15 ms to minimize.
[2024-05-22 18:18:50] [INFO ] Deduced a trap composed of 140 places in 1584 ms of which 15 ms to minimize.
[2024-05-22 18:18:52] [INFO ] Deduced a trap composed of 25 places in 1489 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1611 variables, 11/305 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-22 18:18:54] [INFO ] Deduced a trap composed of 36 places in 906 ms of which 10 ms to minimize.
[2024-05-22 18:18:55] [INFO ] Deduced a trap composed of 25 places in 978 ms of which 10 ms to minimize.
[2024-05-22 18:18:56] [INFO ] Deduced a trap composed of 35 places in 1003 ms of which 11 ms to minimize.
[2024-05-22 18:18:57] [INFO ] Deduced a trap composed of 91 places in 1006 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1611 variables, 4/309 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1611 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 31/1642 variables, 7/316 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-22 18:19:00] [INFO ] Deduced a trap composed of 40 places in 363 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1642 variables, 1/317 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-22 18:19:02] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 3 ms to minimize.
[2024-05-22 18:19:02] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1642 variables, 2/319 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1642 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem ASLink-PT-10a-ReachabilityFireability-2024-01 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10a-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10a-ReachabilityFireability-2023-07 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2023-07 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4333/4333 variables, and 1961 constraints, problems are : Problem set: 4 solved, 8 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 215/215 constraints, State Equation: 1642/1642 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 18/18 constraints]
After SMT, in 55750ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 1642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1642/1642 places, 2691/2691 transitions.
Ensure Unique test removed 1 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1639 transition count 2686
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1634 transition count 2686
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 13 place count 1634 transition count 2657
Deduced a syphon composed of 29 places in 5 ms
Ensure Unique test removed 15 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 73 rules applied. Total rules applied 86 place count 1590 transition count 2657
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 2 with 1 rules applied. Total rules applied 87 place count 1590 transition count 2656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 1589 transition count 2656
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 1586 transition count 2636
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 1586 transition count 2636
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 1585 transition count 2628
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 1585 transition count 2628
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 1584 transition count 2620
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 1584 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 1583 transition count 2612
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 1583 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 1582 transition count 2604
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 1582 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 1581 transition count 2596
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 1581 transition count 2596
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 126 place count 1570 transition count 2585
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 1570 transition count 2584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 1569 transition count 2584
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 132 place count 1569 transition count 2580
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 136 place count 1565 transition count 2580
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 140 place count 1565 transition count 2580
Applied a total of 140 rules in 1438 ms. Remains 1565 /1642 variables (removed 77) and now considering 2580/2691 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1438 ms. Remains : 1565/1642 places, 2580/2691 transitions.
RANDOM walk for 40000 steps (272 resets) in 678 ms. (58 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (28 resets) in 447 ms. (89 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (29 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (29 resets) in 238 ms. (167 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (28 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (28 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (30 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (28 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (30 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 91504 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 8
Probabilistic random walk after 91504 steps, saw 27477 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 2580 rows 1565 cols
[2024-05-22 18:19:29] [INFO ] Computed 283 invariants in 63 ms
[2024-05-22 18:19:29] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 206/334 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 179/513 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 992/1505 variables, 190/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1505 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 60/1565 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1565 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2580/4145 variables, 1565/1848 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4145 variables, 58/1906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4145 variables, 0/1906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/4145 variables, 0/1906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4145/4145 variables, and 1906 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6818 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, Generalized P Invariants (flows): 204/204 constraints, State Equation: 1565/1565 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 206/334 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 179/513 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 992/1505 variables, 190/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 18:19:38] [INFO ] Deduced a trap composed of 39 places in 534 ms of which 6 ms to minimize.
[2024-05-22 18:19:39] [INFO ] Deduced a trap composed of 26 places in 986 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1505 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1505 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 60/1565 variables, 14/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 18:19:41] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1565 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1565 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem ASLink-PT-10a-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10a-ReachabilityFireability-2023-08 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2023-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10a-ReachabilityFireability-2023-09 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2023-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10a-ReachabilityFireability-2023-11 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10a-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10a-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10a-ReachabilityFireability-2024-15 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
Problem ASLink-PT-10a-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 4145/4145 variables, and 1851 constraints, problems are : Problem set: 7 solved, 1 unsolved in 34321 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, Generalized P Invariants (flows): 204/204 constraints, State Equation: 1565/1565 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 41322ms problems are : Problem set: 7 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 118026 ms.
ITS solved all properties within timeout

BK_STOP 1716402011184

--------------------
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="ASLink-PT-10a"
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 ASLink-PT-10a, 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-171620117100159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;