Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445800358.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S06J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445800358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 25K Apr 11 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 268K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 265K Apr 11 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716874529192

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:35:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:35:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:35:31] [INFO ] Load time of PNML (sax parser for PT used): 953 ms
[2024-05-28 05:35:31] [INFO ] Transformed 894 places.
[2024-05-28 05:35:31] [INFO ] Transformed 14334 transitions.
[2024-05-28 05:35:31] [INFO ] Parsed PT model containing 894 places and 14334 transitions and 119772 arcs in 1218 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 77 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
RANDOM walk for 40000 steps (234 resets) in 3063 ms. (13 steps per ms) remains 12/16 properties
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (96 resets) in 1006 ms. (39 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (84 resets) in 462 ms. (86 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (98 resets) in 427 ms. (93 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 1675 ms. (23 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (23 resets) in 876 ms. (45 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (97 resets) in 315 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (102 resets) in 509 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (114 resets) in 369 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (87 resets) in 328 ms. (121 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (93 resets) in 367 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (88 resets) in 295 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (94 resets) in 418 ms. (95 steps per ms) remains 12/12 properties
[2024-05-28 05:35:35] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
// Phase 1: matrix 3526 rows 894 cols
[2024-05-28 05:35:35] [INFO ] Computed 62 invariants in 286 ms
[2024-05-28 05:35:35] [INFO ] State equation strengthened by 224 read => feed constraints.
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 19/35 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 13/797 variables, 3/38 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 0/38 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 97/894 variables, 24/62 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/894 variables, 0/62 constraints. Problems are: Problem set: 10 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4420/4420 variables, and 956 constraints, problems are : Problem set: 10 solved, 2 unsolved in 5075 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 894/894 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 2 unsolved
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 297/357 variables, 15/15 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 2/17 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/17 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 519/883 variables, 37/54 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-05-28 05:35:42] [INFO ] Deduced a trap composed of 93 places in 555 ms of which 41 ms to minimize.
[2024-05-28 05:35:42] [INFO ] Deduced a trap composed of 94 places in 454 ms of which 18 ms to minimize.
[2024-05-28 05:35:43] [INFO ] Deduced a trap composed of 93 places in 297 ms of which 2 ms to minimize.
[2024-05-28 05:35:43] [INFO ] Deduced a trap composed of 93 places in 184 ms of which 2 ms to minimize.
[2024-05-28 05:35:43] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 5/59 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/59 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/885 variables, 2/61 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/885 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/894 variables, 6/67 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-05-28 05:35:44] [INFO ] Deduced a trap composed of 94 places in 169 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/894 variables, 1/68 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/894 variables, 0/68 constraints. Problems are: Problem set: 11 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4420/4420 variables, and 962 constraints, problems are : Problem set: 11 solved, 1 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 894/894 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 11036ms problems are : Problem set: 11 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 894/894 places, 3574/3574 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 888 transition count 3514
Reduce places removed 60 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 828 transition count 3509
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 136 place count 823 transition count 3509
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 136 place count 823 transition count 3414
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 326 place count 728 transition count 3414
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 5 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 490 place count 646 transition count 3332
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 504 place count 646 transition count 3318
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 518 place count 632 transition count 3318
Applied a total of 518 rules in 668 ms. Remains 632 /894 variables (removed 262) and now considering 3318/3574 (removed 256) transitions.
Running 3312 sub problems to find dead transitions.
[2024-05-28 05:35:47] [INFO ] Flow matrix only has 3270 transitions (discarded 48 similar events)
// Phase 1: matrix 3270 rows 632 cols
[2024-05-28 05:35:47] [INFO ] Computed 56 invariants in 125 ms
[2024-05-28 05:35:47] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3312 unsolved
SMT process timed out in 57242ms, After SMT, problems are : Problem set: 0 solved, 3312 unsolved
Search for dead transitions found 0 dead transitions in 57295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58001 ms. Remains : 632/894 places, 3318/3574 transitions.
RANDOM walk for 40001 steps (357 resets) in 1201 ms. (33 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (110 resets) in 510 ms. (78 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 57514 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 57514 steps, saw 21926 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-28 05:36:47] [INFO ] Flow matrix only has 3270 transitions (discarded 48 similar events)
[2024-05-28 05:36:47] [INFO ] Invariant cache hit.
[2024-05-28 05:36:47] [INFO ] State equation strengthened by 224 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 246/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/310 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 311/621 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/624 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/632 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/632 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3902/3902 variables, and 688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 632/632 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 246/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/310 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 311/621 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:37:33] [INFO ] Deduced a trap composed of 62 places in 193 ms of which 3 ms to minimize.
[2024-05-28 05:37:33] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 2 ms to minimize.
[2024-05-28 05:37:33] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 1 ms to minimize.
[2024-05-28 05:37:33] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/624 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/632 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:37:34] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/632 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/632 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3902/3902 variables, and 693 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10760 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 632/632 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints]
After SMT, in 55858ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 3318/3318 transitions.
Applied a total of 0 rules in 174 ms. Remains 632 /632 variables (removed 0) and now considering 3318/3318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 632/632 places, 3318/3318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 3318/3318 transitions.
Applied a total of 0 rules in 129 ms. Remains 632 /632 variables (removed 0) and now considering 3318/3318 (removed 0) transitions.
[2024-05-28 05:37:44] [INFO ] Flow matrix only has 3270 transitions (discarded 48 similar events)
[2024-05-28 05:37:44] [INFO ] Invariant cache hit.
[2024-05-28 05:37:45] [INFO ] Implicit Places using invariants in 1207 ms returned [6, 9, 172, 260, 282, 389, 427, 530]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1235 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 624/632 places, 3318/3318 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 3317
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 3317
Applied a total of 2 rules in 144 ms. Remains 623 /624 variables (removed 1) and now considering 3317/3318 (removed 1) transitions.
[2024-05-28 05:37:45] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
// Phase 1: matrix 3269 rows 623 cols
[2024-05-28 05:37:45] [INFO ] Computed 48 invariants in 106 ms
[2024-05-28 05:37:46] [INFO ] Implicit Places using invariants in 1286 ms returned []
[2024-05-28 05:37:46] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-05-28 05:37:46] [INFO ] Invariant cache hit.
[2024-05-28 05:37:49] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 05:38:20] [INFO ] Performed 435/623 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 05:38:30] [INFO ] Implicit Places using invariants and state equation in 43436 ms returned []
Implicit Place search using SMT with State Equation took 44726 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 623/632 places, 3317/3318 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46236 ms. Remains : 623/632 places, 3317/3318 transitions.
RANDOM walk for 40000 steps (412 resets) in 884 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (123 resets) in 685 ms. (58 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 56034 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 56034 steps, saw 20945 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-28 05:38:33] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-05-28 05:38:33] [INFO ] Invariant cache hit.
[2024-05-28 05:38:33] [INFO ] State equation strengthened by 224 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 324/381 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/385 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 231/616 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/617 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/617 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/623 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3892/3892 variables, and 671 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 623/623 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 324/381 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/385 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 231/616 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:39:49] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 2 ms to minimize.
[2024-05-28 05:39:49] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 2 ms to minimize.
[2024-05-28 05:39:49] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
[2024-05-28 05:39:49] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/617 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/623 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/623 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3892/3892 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11536 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 623/623 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints]
After SMT, in 86613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 57 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 3317/3317 transitions.
Applied a total of 0 rules in 87 ms. Remains 623 /623 variables (removed 0) and now considering 3317/3317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 623/623 places, 3317/3317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 3317/3317 transitions.
Applied a total of 0 rules in 86 ms. Remains 623 /623 variables (removed 0) and now considering 3317/3317 (removed 0) transitions.
[2024-05-28 05:40:00] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-05-28 05:40:00] [INFO ] Invariant cache hit.
[2024-05-28 05:40:01] [INFO ] Implicit Places using invariants in 1181 ms returned []
[2024-05-28 05:40:01] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-05-28 05:40:01] [INFO ] Invariant cache hit.
[2024-05-28 05:40:04] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 05:40:34] [INFO ] Performed 447/623 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 05:40:44] [INFO ] Implicit Places using invariants and state equation in 42435 ms returned []
Implicit Place search using SMT with State Equation took 43620 ms to find 0 implicit places.
[2024-05-28 05:40:44] [INFO ] Redundant transitions in 259 ms returned []
Running 3311 sub problems to find dead transitions.
[2024-05-28 05:40:44] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-05-28 05:40:44] [INFO ] Invariant cache hit.
[2024-05-28 05:40:44] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
[2024-05-28 05:41:48] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 4.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 2.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 2.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 3.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 2.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 4.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 3.0)
(s165 0.0)
(s166 0.0)
(s167 4.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 4.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 4.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 2.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 2.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 10.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 4.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 3.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/3892 variables, and 38 constraints, problems are : Problem set: 0 solved, 3311 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/623 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 3311/1511 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
[2024-05-28 05:41:55] [INFO ] Deduced a trap composed of 35 places in 688 ms of which 3 ms to minimize.
[2024-05-28 05:41:55] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 2 ms to minimize.
[2024-05-28 05:41:56] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 1 ms to minimize.
[2024-05-28 05:41:56] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-28 05:41:56] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-28 05:41:56] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-28 05:41:57] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 3 ms to minimize.
[2024-05-28 05:41:59] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-28 05:41:59] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-28 05:42:00] [INFO ] Deduced a trap composed of 38 places in 347 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 2)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 4)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 3)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 4)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s191 0)
(s192 1)
(s193 1)
(s194 0)
(s195 2)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 10)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 9)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 1)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 2)
(s304 0)
(s305 0)
(s306 1)
(s307 3)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 10)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 4)
(s320 1)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/3892 variables, and 48 constraints, problems are : Problem set: 0 solved, 3311 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/623 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1800/1511 constraints, Known Traps: 11/11 constraints]
After SMT, in 96434ms problems are : Problem set: 0 solved, 3311 unsolved
Search for dead transitions found 0 dead transitions in 96470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140457 ms. Remains : 623/623 places, 3317/3317 transitions.
[2024-05-28 05:42:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-28 05:42:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 623 places, 3317 transitions and 22385 arcs took 26 ms.
[2024-05-28 05:42:21] [INFO ] Flatten gal took : 327 ms
Total runtime 411169 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J06T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/423/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 623
TRANSITIONS: 3317
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.149s, Sys 0.012s]


SAVING FILE /home/mcc/execution/423/model (.net / .def) ...
EXPORT TIME: [User 0.013s, Sys 0.004s]


----------------------------------------------------------------------
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: 713
MODEL NAME: /home/mcc/execution/423/model
623 places, 3317 transitions.

No place bound informations found.
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..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="PolyORBLF-PT-S06J06T08"
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 PolyORBLF-PT-S06J06T08, 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 r289-tajo-171654445800358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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