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-171654445700342.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-S06J06T04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 16K Apr 11 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 855K Apr 11 17:23 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 9.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 341K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 483K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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 6.9M 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-S06J06T04-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716873477547

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-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:17:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:17:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:17:59] [INFO ] Load time of PNML (sax parser for PT used): 396 ms
[2024-05-28 05:17:59] [INFO ] Transformed 506 places.
[2024-05-28 05:17:59] [INFO ] Transformed 7154 transitions.
[2024-05-28 05:17:59] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
RANDOM walk for 40000 steps (206 resets) in 2910 ms. (13 steps per ms) remains 13/16 properties
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (64 resets) in 377 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (102 resets) in 444 ms. (89 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (55 resets) in 412 ms. (96 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (21 resets) in 523 ms. (76 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (82 resets) in 607 ms. (65 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (90 resets) in 265 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (37 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (66 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (68 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (86 resets) in 434 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (97 resets) in 291 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 861 ms. (46 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (31 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
[2024-05-28 05:18:02] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2024-05-28 05:18:02] [INFO ] Computed 54 invariants in 89 ms
[2024-05-28 05:18:02] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 133/418 variables, 20/22 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 2/24 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/24 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/422 variables, 2/26 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PolyORBLF-PT-S06J06T04-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 84/506 variables, 28/54 constraints. Problems are: Problem set: 12 solved, 1 unsolved
[2024-05-28 05:18:03] [INFO ] Deduced a trap composed of 91 places in 372 ms of which 40 ms to minimize.
[2024-05-28 05:18:04] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 3 ms to minimize.
[2024-05-28 05:18:04] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-28 05:18:04] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 4/58 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/58 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2256/2256 variables, and 564 constraints, problems are : Problem set: 12 solved, 1 unsolved in 2931 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 506/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 345/358 variables, 8/9 constraints. Problems are: Problem set: 12 solved, 1 unsolved
[2024-05-28 05:18:05] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 1/10 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/449 variables, 20/30 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/30 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/503 variables, 23/53 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 4/57 constraints. Problems are: Problem set: 12 solved, 1 unsolved
[2024-05-28 05:18:06] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 1/58 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/58 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/504 variables, 1/59 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/59 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2254/2256 variables, and 563 constraints, problems are : Problem set: 12 solved, 1 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 504/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 6/6 constraints]
After SMT, in 5431ms problems are : Problem set: 12 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 5 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 500 transition count 1742
Reduce places removed 32 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 468 transition count 1738
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 278 place count 364 transition count 1638
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 286 place count 364 transition count 1630
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 294 place count 356 transition count 1630
Applied a total of 294 rules in 387 ms. Remains 356 /506 variables (removed 150) and now considering 1630/1774 (removed 144) transitions.
Running 1624 sub problems to find dead transitions.
[2024-05-28 05:18:08] [INFO ] Flow matrix only has 1606 transitions (discarded 24 similar events)
// Phase 1: matrix 1606 rows 356 cols
[2024-05-28 05:18:08] [INFO ] Computed 48 invariants in 71 ms
[2024-05-28 05:18:08] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
[2024-05-28 05:18:34] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-28 05:18:35] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1962 variables, and 39 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1624/1624 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
[2024-05-28 05:18:52] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
[2024-05-28 05:19:00] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 2 ms to minimize.
[2024-05-28 05:19:00] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-05-28 05:19:01] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-28 05:19:01] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 3)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 4)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 2)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 1)
(s101 1)
(s102 2)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 4)
(s118 0)
(s119 4)
(s120 0)
(s121 4)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 4)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 1)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 4)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 4)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 1)
(s187 10)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 2)
(s203 0)
(s204 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1962 variables, and 44 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1624 constraints, Known Traps: 7/7 constraints]
After SMT, in 58258ms problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 58289ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58707 ms. Remains : 356/506 places, 1630/1774 transitions.
RANDOM walk for 40000 steps (369 resets) in 725 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (68 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 170937 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 170937 steps, saw 84048 distinct states, run finished after 3006 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-28 05:19:09] [INFO ] Flow matrix only has 1606 transitions (discarded 24 similar events)
[2024-05-28 05:19:09] [INFO ] Invariant cache hit.
[2024-05-28 05:19:09] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/241 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/280 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/354 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:19:10] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 4 ms to minimize.
[2024-05-28 05:19:10] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2024-05-28 05:19:10] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1606/1960 variables, 354/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 112/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1962 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1962 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2213 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 356/356 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/241 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/280 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/354 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:19:12] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1606/1960 variables, 354/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 112/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:19:15] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1962 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1962 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1962 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1962 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3842 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 356/356 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 6074ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 5 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 1630/1630 transitions.
Applied a total of 0 rules in 47 ms. Remains 356 /356 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 356/356 places, 1630/1630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 1630/1630 transitions.
Applied a total of 0 rules in 44 ms. Remains 356 /356 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2024-05-28 05:19:16] [INFO ] Flow matrix only has 1606 transitions (discarded 24 similar events)
[2024-05-28 05:19:16] [INFO ] Invariant cache hit.
[2024-05-28 05:19:16] [INFO ] Implicit Places using invariants in 677 ms returned [17, 72, 147, 295]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 689 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/356 places, 1630/1630 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1626
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1626
Applied a total of 8 rules in 44 ms. Remains 348 /352 variables (removed 4) and now considering 1626/1630 (removed 4) transitions.
[2024-05-28 05:19:16] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
// Phase 1: matrix 1602 rows 348 cols
[2024-05-28 05:19:16] [INFO ] Computed 44 invariants in 35 ms
[2024-05-28 05:19:17] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-28 05:19:17] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2024-05-28 05:19:17] [INFO ] Invariant cache hit.
[2024-05-28 05:19:18] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 05:19:28] [INFO ] Implicit Places using invariants and state equation in 10759 ms returned []
Implicit Place search using SMT with State Equation took 11407 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 348/356 places, 1626/1630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12185 ms. Remains : 348/356 places, 1626/1630 transitions.
RANDOM walk for 40000 steps (362 resets) in 783 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198021 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 198021 steps, saw 108803 distinct states, run finished after 3002 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-28 05:19:31] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2024-05-28 05:19:31] [INFO ] Invariant cache hit.
[2024-05-28 05:19:31] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/164 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/249 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/345 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:19:32] [INFO ] Deduced a trap composed of 57 places in 306 ms of which 3 ms to minimize.
[2024-05-28 05:19:32] [INFO ] Deduced a trap composed of 57 places in 320 ms of which 3 ms to minimize.
[2024-05-28 05:19:32] [INFO ] Deduced a trap composed of 57 places in 327 ms of which 2 ms to minimize.
[2024-05-28 05:19:33] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 2 ms to minimize.
[2024-05-28 05:19:33] [INFO ] Deduced a trap composed of 124 places in 407 ms of which 3 ms to minimize.
[2024-05-28 05:19:33] [INFO ] Deduced a trap composed of 38 places in 392 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1602/1948 variables, 346/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1948 variables, 112/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1948 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1950 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1950 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1950 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1950 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3481 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 348/348 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/164 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/249 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/345 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1602/1948 variables, 346/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1948 variables, 112/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1948 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1948 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1950 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1950 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1950 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1950 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1950/1950 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2210 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 348/348 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 5707ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 5 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1626/1626 transitions.
Applied a total of 0 rules in 34 ms. Remains 348 /348 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 348/348 places, 1626/1626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1626/1626 transitions.
Applied a total of 0 rules in 71 ms. Remains 348 /348 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
[2024-05-28 05:19:37] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2024-05-28 05:19:37] [INFO ] Invariant cache hit.
[2024-05-28 05:19:38] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-28 05:19:38] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2024-05-28 05:19:38] [INFO ] Invariant cache hit.
[2024-05-28 05:19:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 05:19:49] [INFO ] Implicit Places using invariants and state equation in 11467 ms returned []
Implicit Place search using SMT with State Equation took 12209 ms to find 0 implicit places.
[2024-05-28 05:19:49] [INFO ] Redundant transitions in 116 ms returned []
Running 1620 sub problems to find dead transitions.
[2024-05-28 05:19:49] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2024-05-28 05:19:49] [INFO ] Invariant cache hit.
[2024-05-28 05:19:49] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
[2024-05-28 05:20:32] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 1 ms to minimize.
[2024-05-28 05:20:32] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2024-05-28 05:20:33] [INFO ] Deduced a trap composed of 39 places in 330 ms of which 2 ms to minimize.
[2024-05-28 05:20:34] [INFO ] Deduced a trap composed of 98 places in 318 ms of which 2 ms to minimize.
[2024-05-28 05:20:38] [INFO ] Deduced a trap composed of 89 places in 286 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 2.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.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 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.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 0.0)
(s125 2.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 2.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.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 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 2.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 10.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 10.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 4.0)
(s256 10.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1950 variables, and 42 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 19/23 constraints, State Equation: 0/348 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
[2024-05-28 05:20:44] [INFO ] Deduced a trap composed of 102 places in 364 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1950 variables, and 43 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 19/23 constraints, State Equation: 0/348 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1620 constraints, Known Traps: 6/6 constraints]
After SMT, in 80108ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 80133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92548 ms. Remains : 348/348 places, 1626/1626 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 348 transition count 1602
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 348 transition count 1578
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 348 transition count 1574
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 344 transition count 1574
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 344 transition count 1570
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 340 transition count 1570
Applied a total of 64 rules in 254 ms. Remains 340 /348 variables (removed 8) and now considering 1570/1626 (removed 56) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1570 rows 340 cols
[2024-05-28 05:21:10] [INFO ] Computed 44 invariants in 63 ms
[2024-05-28 05:21:10] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-05-28 05:21:10] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-28 05:21:11] [INFO ] After 1230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 05:21:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-28 05:21:11] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 30 ms returned sat
[2024-05-28 05:21:13] [INFO ] After 1503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 05:21:21] [INFO ] Deduced a trap composed of 55 places in 568 ms of which 3 ms to minimize.
[2024-05-28 05:21:22] [INFO ] Deduced a trap composed of 98 places in 556 ms of which 3 ms to minimize.
[2024-05-28 05:21:23] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2024-05-28 05:21:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2888 ms
TRAPS : Iteration 1
[2024-05-28 05:21:23] [INFO ] After 12134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 05:21:24] [INFO ] After 12701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 14311 ms.
[2024-05-28 05:21:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-28 05:21:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 348 places, 1626 transitions and 11210 arcs took 21 ms.
[2024-05-28 05:21:25] [INFO ] Flatten gal took : 338 ms
Total runtime 206044 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J06T04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/436/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 348
TRANSITIONS: 1626
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.090s, Sys 0.003s]


SAVING FILE /home/mcc/execution/436/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 787
MODEL NAME: /home/mcc/execution/436/model
348 places, 1626 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-S06J06T04"
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-S06J06T04, 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-171654445700342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 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 ;