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.r299-tajo-171654455700148.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 itstools
Input is PolyORBLF-PT-S02J04T10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455700148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 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 906K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717141548695

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-31 07:45:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:45:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:45:50] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-05-31 07:45:50] [INFO ] Transformed 752 places.
[2024-05-31 07:45:50] [INFO ] Transformed 1572 transitions.
[2024-05-31 07:45:50] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 314 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
[2024-05-31 07:45:51] [INFO ] Flatten gal took : 333 ms
RANDOM walk for 40000 steps (9 resets) in 2592 ms. (15 steps per ms) remains 22/752 properties
BEST_FIRST walk for 4002 steps (8 resets) in 232 ms. (17 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 22/22 properties
[2024-05-31 07:45:51] [INFO ] Flatten gal took : 200 ms
BEST_FIRST walk for 4001 steps (8 resets) in 232 ms. (17 steps per ms) remains 22/22 properties
[2024-05-31 07:45:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8648621085239694774.gal : 103 ms
BEST_FIRST walk for 4004 steps (8 resets) in 206 ms. (19 steps per ms) remains 22/22 properties
[2024-05-31 07:45:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3386061866133322629.prop : 1 ms
BEST_FIRST walk for 4001 steps (8 resets) in 260 ms. (15 steps per ms) remains 22/22 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8648621085239694774.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3386061866133322629.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (8 resets) in 216 ms. (18 steps per ms) remains 22/22 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 4003 steps (8 resets) in 247 ms. (16 steps per ms) remains 22/22 properties
Loading property file /tmp/ReachabilityCardinality3386061866133322629.prop.
BEST_FIRST walk for 4002 steps (8 resets) in 101 ms. (39 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 156 ms. (25 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
[2024-05-31 07:45:52] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-31 07:45:53] [INFO ] Computed 54 invariants in 131 ms
[2024-05-31 07:45:53] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :6 after 7
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :7 after 23
At refinement iteration 1 (OVERLAPS) 97/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :23 after 41
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 575/696 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :41 after 241
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :241 after 247
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 14/710 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :247 after 263
At refinement iteration 8 (INCLUDED_ONLY) 0/710 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 40/750 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :263 after 983
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :983 after 1073
At refinement iteration 11 (OVERLAPS) 1392/2142 variables, 750/803 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2142 variables, 120/923 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :1073 after 1393
At refinement iteration 13 (INCLUDED_ONLY) 0/2142 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/2144 variables, 2/925 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2144 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :1393 after 2768
At refinement iteration 17 (OVERLAPS) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 926 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4911 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 97/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 575/696 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:46:00] [INFO ] Deduced a trap composed of 241 places in 459 ms of which 49 ms to minimize.
[2024-05-31 07:46:00] [INFO ] Deduced a trap composed of 428 places in 598 ms of which 14 ms to minimize.
[2024-05-31 07:46:01] [INFO ] Deduced a trap composed of 437 places in 458 ms of which 13 ms to minimize.
[2024-05-31 07:46:01] [INFO ] Deduced a trap composed of 430 places in 363 ms of which 5 ms to minimize.
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :2768 after 7796
[2024-05-31 07:46:02] [INFO ] Deduced a trap composed of 373 places in 582 ms of which 5 ms to minimize.
[2024-05-31 07:46:03] [INFO ] Deduced a trap composed of 437 places in 452 ms of which 5 ms to minimize.
[2024-05-31 07:46:03] [INFO ] Deduced a trap composed of 380 places in 577 ms of which 4 ms to minimize.
SMT process timed out in 10823ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 466 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
Running 1140 sub problems to find dead transitions.
[2024-05-31 07:46:04] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2024-05-31 07:46:04] [INFO ] Computed 52 invariants in 34 ms
[2024-05-31 07:46:04] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,22 properties remain. new max is 32768
SDD size :7796 after 24119
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-31 07:46:15] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-31 07:46:16] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-05-31 07:46:16] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2024-05-31 07:46:16] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-31 07:46:16] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2024-05-31 07:46:17] [INFO ] Deduced a trap composed of 38 places in 759 ms of which 1 ms to minimize.
[2024-05-31 07:46:17] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-31 07:46:17] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2024-05-31 07:46:18] [INFO ] Deduced a trap composed of 39 places in 544 ms of which 1 ms to minimize.
[2024-05-31 07:46:18] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 0 ms to minimize.
[2024-05-31 07:46:19] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 2 ms to minimize.
[2024-05-31 07:46:20] [INFO ] Deduced a trap composed of 89 places in 340 ms of which 6 ms to minimize.
SDD proceeding with computation,22 properties remain. new max is 65536
SDD size :24119 after 94070
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 312 places in 213 ms of which 3 ms to minimize.
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 288 places in 217 ms of which 3 ms to minimize.
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 286 places in 204 ms of which 3 ms to minimize.
[2024-05-31 07:46:22] [INFO ] Deduced a trap composed of 206 places in 200 ms of which 2 ms to minimize.
[2024-05-31 07:46:22] [INFO ] Deduced a trap composed of 239 places in 203 ms of which 15 ms to minimize.
[2024-05-31 07:46:24] [INFO ] Deduced a trap composed of 178 places in 239 ms of which 3 ms to minimize.
[2024-05-31 07:46:24] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 3 ms to minimize.
[2024-05-31 07:46:24] [INFO ] Deduced a trap composed of 193 places in 221 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1602 variables, and 70 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 193 places in 336 ms of which 4 ms to minimize.
[2024-05-31 07:46:36] [INFO ] Deduced a trap composed of 262 places in 284 ms of which 4 ms to minimize.
[2024-05-31 07:46:36] [INFO ] Deduced a trap composed of 278 places in 262 ms of which 4 ms to minimize.
[2024-05-31 07:46:36] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 3 ms to minimize.
SDD proceeding with computation,22 properties remain. new max is 131072
SDD size :94070 after 681174
[2024-05-31 07:46:39] [INFO ] Deduced a trap composed of 169 places in 289 ms of which 4 ms to minimize.
[2024-05-31 07:46:47] [INFO ] Deduced a trap composed of 169 places in 283 ms of which 4 ms to minimize.
[2024-05-31 07:46:48] [INFO ] Deduced a trap composed of 208 places in 311 ms of which 4 ms to minimize.
SMT process timed out in 43932ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 43980ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44465 ms. Remains : 480/752 places, 1142/1412 transitions.
RANDOM walk for 4000000 steps (1355 resets) in 48332 ms. (82 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (52 resets) in 2098 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (63 resets) in 2402 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (54 resets) in 2283 ms. (175 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (56 resets) in 2104 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (59 resets) in 2394 ms. (167 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (67 resets) in 2092 ms. (191 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (47 resets) in 2230 ms. (179 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (55 resets) in 2336 ms. (171 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (57 resets) in 2105 ms. (189 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (54 resets) in 2355 ms. (169 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (57 resets) in 2108 ms. (189 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (58 resets) in 3039 ms. (131 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 3382 ms. (118 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (56 resets) in 3172 ms. (126 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (53 resets) in 3174 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (55 resets) in 2980 ms. (134 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (50 resets) in 3481 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (41 resets) in 3411 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (57 resets) in 2917 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (54 resets) in 3191 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 3185 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (44 resets) in 3486 ms. (114 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 262144
SDD size :681174 after 4.38695e+06
SDD proceeding with computation,22 properties remain. new max is 524288
SDD size :4.38695e+06 after 4.21072e+07
Interrupted probabilistic random walk after 3507204 steps, run timeout after 96001 ms. (steps per millisecond=36 ) properties seen :0 out of 22
Probabilistic random walk after 3507204 steps, saw 2141290 distinct states, run finished after 96015 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-31 07:48:56] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-31 07:48:56] [INFO ] Invariant cache hit.
[2024-05-31 07:48:56] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 19/427 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 50/477 variables, 28/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/478 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1600 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1600 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1600 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 2/1602 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1602 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1602 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/1602 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1602/1602 variables, and 652 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2838 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:49:02] [INFO ] Deduced a trap composed of 245 places in 705 ms of which 6 ms to minimize.
[2024-05-31 07:49:02] [INFO ] Deduced a trap composed of 206 places in 187 ms of which 2 ms to minimize.
[2024-05-31 07:49:03] [INFO ] Deduced a trap composed of 214 places in 191 ms of which 3 ms to minimize.
[2024-05-31 07:49:03] [INFO ] Deduced a trap composed of 206 places in 197 ms of which 3 ms to minimize.
[2024-05-31 07:49:03] [INFO ] Deduced a trap composed of 222 places in 192 ms of which 2 ms to minimize.
[2024-05-31 07:49:03] [INFO ] Deduced a trap composed of 223 places in 186 ms of which 3 ms to minimize.
[2024-05-31 07:49:03] [INFO ] Deduced a trap composed of 217 places in 186 ms of which 2 ms to minimize.
[2024-05-31 07:49:03] [INFO ] Deduced a trap composed of 226 places in 182 ms of which 2 ms to minimize.
[2024-05-31 07:49:04] [INFO ] Deduced a trap composed of 211 places in 201 ms of which 2 ms to minimize.
[2024-05-31 07:49:04] [INFO ] Deduced a trap composed of 209 places in 172 ms of which 2 ms to minimize.
[2024-05-31 07:49:04] [INFO ] Deduced a trap composed of 199 places in 188 ms of which 2 ms to minimize.
[2024-05-31 07:49:04] [INFO ] Deduced a trap composed of 206 places in 186 ms of which 3 ms to minimize.
[2024-05-31 07:49:05] [INFO ] Deduced a trap composed of 218 places in 198 ms of which 3 ms to minimize.
[2024-05-31 07:49:05] [INFO ] Deduced a trap composed of 215 places in 183 ms of which 3 ms to minimize.
[2024-05-31 07:49:05] [INFO ] Deduced a trap composed of 222 places in 193 ms of which 2 ms to minimize.
[2024-05-31 07:49:05] [INFO ] Deduced a trap composed of 254 places in 183 ms of which 3 ms to minimize.
[2024-05-31 07:49:05] [INFO ] Deduced a trap composed of 209 places in 188 ms of which 3 ms to minimize.
[2024-05-31 07:49:06] [INFO ] Deduced a trap composed of 218 places in 191 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 19/427 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 50/477 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:49:07] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-05-31 07:49:07] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-31 07:49:07] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-31 07:49:07] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-31 07:49:07] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 14 ms to minimize.
[2024-05-31 07:49:07] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-31 07:49:07] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-31 07:49:08] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-31 07:49:08] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:49:08] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/478 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1122/1600 variables, 478/557 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1600 variables, 120/677 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1600/1602 variables, and 699 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 478/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 28/28 constraints]
After SMT, in 47900ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 68 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 480/480 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 52 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-05-31 07:49:44] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-31 07:49:44] [INFO ] Invariant cache hit.
[2024-05-31 07:49:45] [INFO ] Implicit Places using invariants in 667 ms returned [3, 58, 120, 171, 248, 276, 333, 364, 372, 429]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 677 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/480 places, 1142/1142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 461 transition count 1133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 461 transition count 1133
Applied a total of 18 rules in 38 ms. Remains 461 /470 variables (removed 9) and now considering 1133/1142 (removed 9) transitions.
[2024-05-31 07:49:45] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
// Phase 1: matrix 1113 rows 461 cols
[2024-05-31 07:49:45] [INFO ] Computed 42 invariants in 13 ms
[2024-05-31 07:49:46] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-05-31 07:49:46] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-05-31 07:49:46] [INFO ] Invariant cache hit.
[2024-05-31 07:49:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 07:49:56] [INFO ] Implicit Places using invariants and state equation in 10317 ms returned []
Implicit Place search using SMT with State Equation took 11104 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/480 places, 1133/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11873 ms. Remains : 461/480 places, 1133/1142 transitions.
RANDOM walk for 4000000 steps (1424 resets) in 60979 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (57 resets) in 3154 ms. (126 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (58 resets) in 3120 ms. (128 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (50 resets) in 2797 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (53 resets) in 3248 ms. (123 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (53 resets) in 3203 ms. (124 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (60 resets) in 3439 ms. (116 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (49 resets) in 2877 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (58 resets) in 2968 ms. (134 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (61 resets) in 3343 ms. (119 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (50 resets) in 3514 ms. (113 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 2764 ms. (144 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (46 resets) in 2729 ms. (146 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (61 resets) in 2472 ms. (161 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (56 resets) in 2824 ms. (141 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (49 resets) in 2646 ms. (151 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (58 resets) in 2551 ms. (156 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (61 resets) in 2854 ms. (140 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (40 resets) in 3199 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (64 resets) in 2998 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (60 resets) in 2990 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (42 resets) in 3063 ms. (130 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 2855 ms. (140 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 1048576
SDD size :4.21072e+07 after 1.27169e+08
Interrupted probabilistic random walk after 4444436 steps, run timeout after 114001 ms. (steps per millisecond=38 ) properties seen :0 out of 22
Probabilistic random walk after 4444436 steps, saw 2250491 distinct states, run finished after 114001 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-31 07:52:29] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-05-31 07:52:29] [INFO ] Invariant cache hit.
[2024-05-31 07:52:29] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 57/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/459 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1113/1572 variables, 459/500 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1572 variables, 120/620 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1572 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 2/1574 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1574 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/1574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 623 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2822 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 57/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:52:32] [INFO ] Deduced a trap composed of 150 places in 187 ms of which 2 ms to minimize.
[2024-05-31 07:52:33] [INFO ] Deduced a trap composed of 225 places in 199 ms of which 3 ms to minimize.
[2024-05-31 07:52:33] [INFO ] Deduced a trap composed of 225 places in 193 ms of which 2 ms to minimize.
[2024-05-31 07:52:33] [INFO ] Deduced a trap composed of 233 places in 210 ms of which 2 ms to minimize.
[2024-05-31 07:52:33] [INFO ] Deduced a trap composed of 199 places in 189 ms of which 2 ms to minimize.
[2024-05-31 07:52:33] [INFO ] Deduced a trap composed of 231 places in 195 ms of which 2 ms to minimize.
[2024-05-31 07:52:34] [INFO ] Deduced a trap composed of 227 places in 208 ms of which 2 ms to minimize.
[2024-05-31 07:52:34] [INFO ] Deduced a trap composed of 218 places in 182 ms of which 3 ms to minimize.
[2024-05-31 07:52:34] [INFO ] Deduced a trap composed of 216 places in 191 ms of which 2 ms to minimize.
[2024-05-31 07:52:34] [INFO ] Deduced a trap composed of 219 places in 190 ms of which 3 ms to minimize.
[2024-05-31 07:52:34] [INFO ] Deduced a trap composed of 224 places in 185 ms of which 2 ms to minimize.
[2024-05-31 07:52:35] [INFO ] Deduced a trap composed of 230 places in 190 ms of which 2 ms to minimize.
[2024-05-31 07:52:35] [INFO ] Deduced a trap composed of 238 places in 188 ms of which 2 ms to minimize.
[2024-05-31 07:52:35] [INFO ] Deduced a trap composed of 220 places in 190 ms of which 2 ms to minimize.
[2024-05-31 07:52:35] [INFO ] Deduced a trap composed of 228 places in 184 ms of which 3 ms to minimize.
[2024-05-31 07:52:35] [INFO ] Deduced a trap composed of 234 places in 189 ms of which 3 ms to minimize.
[2024-05-31 07:52:36] [INFO ] Deduced a trap composed of 228 places in 187 ms of which 2 ms to minimize.
[2024-05-31 07:52:36] [INFO ] Deduced a trap composed of 230 places in 181 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:52:36] [INFO ] Deduced a trap composed of 264 places in 188 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 10/418 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 40/458 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:52:37] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-31 07:52:37] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-31 07:52:37] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-31 07:52:37] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-31 07:52:37] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-31 07:52:37] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-31 07:52:38] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-31 07:52:38] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-31 07:52:38] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/459 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1113/1572 variables, 459/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1572 variables, 120/648 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1572/1574 variables, and 670 constraints, problems are : Problem set: 0 solved, 22 unsolved in 75010 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 459/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 28/28 constraints]
After SMT, in 77862ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 22 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 461/461 places, 1133/1133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 20 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
[2024-05-31 07:53:47] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-05-31 07:53:47] [INFO ] Invariant cache hit.
[2024-05-31 07:53:47] [INFO ] Implicit Places using invariants in 848 ms returned []
[2024-05-31 07:53:47] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-05-31 07:53:47] [INFO ] Invariant cache hit.
[2024-05-31 07:53:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 07:53:59] [INFO ] Implicit Places using invariants and state equation in 11247 ms returned []
Implicit Place search using SMT with State Equation took 12098 ms to find 0 implicit places.
[2024-05-31 07:53:59] [INFO ] Redundant transitions in 70 ms returned []
Running 1131 sub problems to find dead transitions.
[2024-05-31 07:53:59] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-05-31 07:53:59] [INFO ] Invariant cache hit.
[2024-05-31 07:53:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-05-31 07:54:09] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-31 07:54:09] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2024-05-31 07:54:09] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-31 07:54:09] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-31 07:54:10] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-31 07:54:10] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-31 07:54:10] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-31 07:54:10] [INFO ] Deduced a trap composed of 38 places in 414 ms of which 1 ms to minimize.
[2024-05-31 07:54:10] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2024-05-31 07:54:11] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-31 07:54:11] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 1 ms to minimize.
[2024-05-31 07:54:11] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 07:54:12] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 3 ms to minimize.
[2024-05-31 07:54:12] [INFO ] Deduced a trap composed of 96 places in 182 ms of which 2 ms to minimize.
[2024-05-31 07:54:15] [INFO ] Deduced a trap composed of 271 places in 180 ms of which 3 ms to minimize.
[2024-05-31 07:54:15] [INFO ] Deduced a trap composed of 270 places in 180 ms of which 3 ms to minimize.
[2024-05-31 07:54:17] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 3 ms to minimize.
[2024-05-31 07:54:18] [INFO ] Deduced a trap composed of 181 places in 193 ms of which 3 ms to minimize.
[2024-05-31 07:54:18] [INFO ] Deduced a trap composed of 168 places in 269 ms of which 2 ms to minimize.
[2024-05-31 07:54:18] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-05-31 07:54:20] [INFO ] Deduced a trap composed of 184 places in 195 ms of which 3 ms to minimize.
[2024-05-31 07:54:20] [INFO ] Deduced a trap composed of 182 places in 197 ms of which 2 ms to minimize.
[2024-05-31 07:54:23] [INFO ] Deduced a trap composed of 198 places in 209 ms of which 3 ms to minimize.
[2024-05-31 07:54:25] [INFO ] Deduced a trap composed of 245 places in 213 ms of which 3 ms to minimize.
[2024-05-31 07:54:25] [INFO ] Deduced a trap composed of 204 places in 254 ms of which 2 ms to minimize.
[2024-05-31 07:54:26] [INFO ] Deduced a trap composed of 179 places in 232 ms of which 3 ms to minimize.
[2024-05-31 07:54:26] [INFO ] Deduced a trap composed of 172 places in 235 ms of which 3 ms to minimize.
[2024-05-31 07:54:27] [INFO ] Deduced a trap composed of 188 places in 222 ms of which 3 ms to minimize.
[2024-05-31 07:54:27] [INFO ] Deduced a trap composed of 190 places in 286 ms of which 4 ms to minimize.
[2024-05-31 07:54:28] [INFO ] Deduced a trap composed of 206 places in 215 ms of which 2 ms to minimize.
[2024-05-31 07:54:28] [INFO ] Deduced a trap composed of 185 places in 203 ms of which 2 ms to minimize.
[2024-05-31 07:54:28] [INFO ] Deduced a trap composed of 202 places in 185 ms of which 3 ms to minimize.
[2024-05-31 07:54:29] [INFO ] Deduced a trap composed of 172 places in 185 ms of which 3 ms to minimize.
[2024-05-31 07:54:29] [INFO ] Deduced a trap composed of 181 places in 197 ms of which 3 ms to minimize.
[2024-05-31 07:54:29] [INFO ] Deduced a trap composed of 173 places in 217 ms of which 3 ms to minimize.
[2024-05-31 07:54:30] [INFO ] Deduced a trap composed of 153 places in 216 ms of which 3 ms to minimize.
[2024-05-31 07:54:31] [INFO ] Deduced a trap composed of 275 places in 207 ms of which 3 ms to minimize.
[2024-05-31 07:54:31] [INFO ] Deduced a trap composed of 196 places in 208 ms of which 3 ms to minimize.
[2024-05-31 07:54:31] [INFO ] Deduced a trap composed of 275 places in 226 ms of which 3 ms to minimize.
[2024-05-31 07:54:31] [INFO ] Deduced a trap composed of 270 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1574 variables, and 80 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1131/1131 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 40/80 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-05-31 07:54:48] [INFO ] Deduced a trap composed of 240 places in 202 ms of which 2 ms to minimize.
[2024-05-31 07:54:48] [INFO ] Deduced a trap composed of 203 places in 203 ms of which 3 ms to minimize.
[2024-05-31 07:54:48] [INFO ] Deduced a trap composed of 186 places in 217 ms of which 3 ms to minimize.
[2024-05-31 07:54:48] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 3 ms to minimize.
[2024-05-31 07:54:51] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 3 ms to minimize.
[2024-05-31 07:54:51] [INFO ] Deduced a trap composed of 194 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1574 variables, and 86 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1131 constraints, Known Traps: 46/46 constraints]
After SMT, in 62652ms problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 62666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74866 ms. Remains : 461/461 places, 1133/1133 transitions.
RANDOM walk for 400000 steps (153 resets) in 7433 ms. (53 steps per ms) remains 22/22 properties
Running SMT prover for 22 properties.
[2024-05-31 07:55:04] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-05-31 07:55:04] [INFO ] Invariant cache hit.
[2024-05-31 07:55:04] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-31 07:55:04] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-31 07:55:05] [INFO ] After 1488ms SMT Verify possible using state equation in real domain returned unsat :2 sat :20
[2024-05-31 07:55:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 07:55:06] [INFO ] After 540ms SMT Verify possible using 120 Read/Feed constraints in real domain returned unsat :2 sat :20
TRAPS : Iteration 0
[2024-05-31 07:55:07] [INFO ] After 2082ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:20
[2024-05-31 07:55:07] [INFO ] After 3793ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:20
[2024-05-31 07:55:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 07:55:07] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-31 07:55:31] [INFO ] After 23116ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :20
[2024-05-31 07:55:37] [INFO ] After 6349ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :2 sat :20
TRAPS : Iteration 0
Detected timeout of ITS tools.
[2024-05-31 07:55:52] [INFO ] Flatten gal took : 200 ms
[2024-05-31 07:55:52] [INFO ] Applying decomposition
[2024-05-31 07:55:53] [INFO ] Flatten gal took : 146 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13396143435789303339.txt' '-o' '/tmp/graph13396143435789303339.bin' '-w' '/tmp/graph13396143435789303339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13396143435789303339.bin' '-l' '-1' '-v' '-w' '/tmp/graph13396143435789303339.weights' '-q' '0' '-e' '0.001'
[2024-05-31 07:55:53] [INFO ] Decomposing Gal with order
[2024-05-31 07:55:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 07:55:53] [INFO ] Removed a total of 979 redundant transitions.
[2024-05-31 07:55:54] [INFO ] Flatten gal took : 194 ms
[2024-05-31 07:55:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 69 ms.
[2024-05-31 07:55:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4981221868585635308.gal : 44 ms
[2024-05-31 07:55:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17724021427862645814.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4981221868585635308.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17724021427862645814.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17724021427862645814.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :1 after 4
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :4 after 6
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :6 after 7
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :7 after 10
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :10 after 41
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :41 after 153
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :153 after 273
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :273 after 273
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :273 after 273
SDD proceeding with computation,22 properties remain. new max is 32768
SDD size :273 after 1673
[2024-05-31 07:55:59] [INFO ] After 28841ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
SDD proceeding with computation,22 properties remain. new max is 65536
SDD size :1673 after 14403
[2024-05-31 07:56:07] [INFO ] After 59791ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 617414 ms.

BK_STOP 1717142167733

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-S02J04T10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is PolyORBLF-PT-S02J04T10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tajo-171654455700148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;