Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407300278.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Peterson-PT-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 110K Apr 12 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 458K Apr 12 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 47K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 173K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 733K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 289K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K 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 Peterson-PT-5-ReachabilityCardinality-2024-00
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-01
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-02
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-03
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-04
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-05
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-06
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-07
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-08
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-09
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-10
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-11
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-12
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-13
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-14
FORMULA_NAME Peterson-PT-5-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717273470020

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:24:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:24:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:24:33] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2024-06-01 20:24:33] [INFO ] Transformed 834 places.
[2024-06-01 20:24:33] [INFO ] Transformed 1242 transitions.
[2024-06-01 20:24:33] [INFO ] Found NUPN structural information;
[2024-06-01 20:24:33] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 648 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 100 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3547 ms. (11 steps per ms) remains 10/12 properties
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1255 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1320 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2344 ms. (17 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 10/10 properties
[2024-06-01 20:24:36] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:24:36] [INFO ] Computed 23 invariants in 45 ms
[2024-06-01 20:24:36] [INFO ] State equation strengthened by 205 read => feed constraints.
Problem Peterson-PT-5-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/793 variables, 793/793 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem Peterson-PT-5-ReachabilityCardinality-2024-02 is UNSAT
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-5-ReachabilityCardinality-2024-03 is UNSAT
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-5-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-5-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/793 variables, 6/799 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 0/799 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 11/804 variables, 7/806 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 11/817 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 0/817 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/810 variables, 6/823 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 6/829 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 0/829 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1122/1932 variables, 810/1639 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1932 variables, 205/1844 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 0/1844 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 24/1956 variables, 24/1868 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1956 variables, 24/1892 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1956 variables, 4/1896 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1956 variables, 0/1896 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1956 variables, 0/1896 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1896 constraints, problems are : Problem set: 5 solved, 5 unsolved in 4109 ms.
Refiners :[Domain max(s): 834/834 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 743/800 variables, 9/66 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/800 variables, 743/809 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-01 20:24:44] [INFO ] Deduced a trap composed of 105 places in 705 ms of which 130 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/800 variables, 1/810 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-01 20:24:45] [INFO ] Deduced a trap composed of 93 places in 482 ms of which 12 ms to minimize.
[2024-06-01 20:24:45] [INFO ] Deduced a trap composed of 93 places in 364 ms of which 7 ms to minimize.
[2024-06-01 20:24:45] [INFO ] Deduced a trap composed of 93 places in 355 ms of which 7 ms to minimize.
[2024-06-01 20:24:46] [INFO ] Deduced a trap composed of 93 places in 315 ms of which 6 ms to minimize.
[2024-06-01 20:24:46] [INFO ] Deduced a trap composed of 93 places in 448 ms of which 9 ms to minimize.
[2024-06-01 20:24:47] [INFO ] Deduced a trap composed of 139 places in 761 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/800 variables, 6/816 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/800 variables, 0/816 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 4/804 variables, 4/820 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 4/824 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/1956 variables, and 824 constraints, problems are : Problem set: 5 solved, 5 unsolved in 5011 ms.
Refiners :[Domain max(s): 804/834 constraints, Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 7/7 constraints]
After SMT, in 11191ms problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 284 place count 834 transition count 958
Reduce places removed 284 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 304 rules applied. Total rules applied 588 place count 550 transition count 938
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 608 place count 530 transition count 938
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 608 place count 530 transition count 781
Deduced a syphon composed of 157 places in 2 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 922 place count 373 transition count 781
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 974 place count 347 transition count 755
Applied a total of 974 rules in 216 ms. Remains 347 /834 variables (removed 487) and now considering 755/1242 (removed 487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 347/834 places, 755/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 675 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 327824 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 5
Probabilistic random walk after 327824 steps, saw 49137 distinct states, run finished after 3009 ms. (steps per millisecond=108 ) properties seen :0
[2024-06-01 20:24:51] [INFO ] Flow matrix only has 635 transitions (discarded 120 similar events)
// Phase 1: matrix 635 rows 347 cols
[2024-06-01 20:24:51] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 20:24:51] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 255/312 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 255/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/317 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/323 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 635/958 variables, 323/665 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/958 variables, 205/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/958 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 24/982 variables, 24/894 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 24/918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 4/922 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/982 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/982 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 922 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1338 ms.
Refiners :[Domain max(s): 347/347 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 347/347 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 255/312 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 255/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/317 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/323 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:24:53] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:24:54] [INFO ] Deduced a trap composed of 47 places in 348 ms of which 4 ms to minimize.
[2024-06-01 20:24:54] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 3 ms to minimize.
[2024-06-01 20:24:54] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 13 ms to minimize.
[2024-06-01 20:24:54] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
Problem Peterson-PT-5-ReachabilityCardinality-2024-09 is UNSAT
FORMULA Peterson-PT-5-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 20:24:54] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:24:55] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:24:55] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 5 ms to minimize.
[2024-06-01 20:24:55] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 4 ms to minimize.
[2024-06-01 20:24:55] [INFO ] Deduced a trap composed of 58 places in 244 ms of which 3 ms to minimize.
[2024-06-01 20:24:56] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:24:56] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:24:56] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:24:56] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 14/356 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 20:24:56] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/357 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/357 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 635/958 variables, 323/680 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/958 variables, 205/885 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/958 variables, 2/887 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 20:24:57] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/958 variables, 1/888 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/958 variables, 0/888 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 24/982 variables, 24/912 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/982 variables, 24/936 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/982 variables, 4/940 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/982 variables, 2/942 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 20:24:58] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:24:58] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:24:59] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:24:59] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:24:59] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 4 ms to minimize.
[2024-06-01 20:24:59] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 4 ms to minimize.
[2024-06-01 20:25:00] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:25:00] [INFO ] Deduced a trap composed of 98 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:25:00] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:25:01] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 5 ms to minimize.
[2024-06-01 20:25:01] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 5 ms to minimize.
[2024-06-01 20:25:01] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 6 ms to minimize.
[2024-06-01 20:25:02] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 4 ms to minimize.
[2024-06-01 20:25:02] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 4 ms to minimize.
[2024-06-01 20:25:02] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 4 ms to minimize.
[2024-06-01 20:25:02] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:25:03] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:25:03] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:25:03] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 4 ms to minimize.
[2024-06-01 20:25:04] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/982 variables, 20/962 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 20:25:04] [INFO ] Deduced a trap composed of 10 places in 322 ms of which 5 ms to minimize.
[2024-06-01 20:25:05] [INFO ] Deduced a trap composed of 35 places in 305 ms of which 3 ms to minimize.
[2024-06-01 20:25:05] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 5 ms to minimize.
[2024-06-01 20:25:05] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:25:05] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:25:06] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 5 ms to minimize.
[2024-06-01 20:25:06] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:25:07] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 6 ms to minimize.
[2024-06-01 20:25:07] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 4 ms to minimize.
[2024-06-01 20:25:07] [INFO ] Deduced a trap composed of 49 places in 325 ms of which 5 ms to minimize.
[2024-06-01 20:25:08] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 5 ms to minimize.
[2024-06-01 20:25:08] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 4 ms to minimize.
[2024-06-01 20:25:08] [INFO ] Deduced a trap composed of 36 places in 305 ms of which 4 ms to minimize.
[2024-06-01 20:25:09] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 5 ms to minimize.
[2024-06-01 20:25:09] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 5 ms to minimize.
[2024-06-01 20:25:09] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:25:10] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/982 variables, 17/979 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 20:25:11] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 5 ms to minimize.
[2024-06-01 20:25:11] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 4 ms to minimize.
[2024-06-01 20:25:11] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 5 ms to minimize.
[2024-06-01 20:25:12] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 5 ms to minimize.
[2024-06-01 20:25:12] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 4 ms to minimize.
[2024-06-01 20:25:12] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/982 variables, 6/985 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/982 variables, 0/985 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/982 variables, 0/985 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 982/982 variables, and 985 constraints, problems are : Problem set: 1 solved, 4 unsolved in 20960 ms.
Refiners :[Domain max(s): 347/347 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 347/347 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 59/59 constraints]
After SMT, in 22347ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 1412 ms.
Support contains 33 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 755/755 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 347 transition count 744
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 336 transition count 744
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 22 place count 336 transition count 724
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 62 place count 316 transition count 724
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 315 transition count 723
Applied a total of 64 rules in 190 ms. Remains 315 /347 variables (removed 32) and now considering 723/755 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 315/347 places, 723/755 transitions.
RANDOM walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 554890 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 4
Probabilistic random walk after 554890 steps, saw 82023 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-06-01 20:25:19] [INFO ] Flow matrix only has 603 transitions (discarded 120 similar events)
// Phase 1: matrix 603 rows 315 cols
[2024-06-01 20:25:19] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 20:25:19] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 241/274 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 241/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/279 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/285 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 603/888 variables, 285/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/888 variables, 205/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/888 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 30/918 variables, 30/823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/918 variables, 30/853 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/918 variables, 5/858 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/918 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/918 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 918/918 variables, and 858 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1015 ms.
Refiners :[Domain max(s): 315/315 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 315/315 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 241/274 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 241/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/279 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/285 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:20] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:25:20] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 603/888 variables, 285/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/888 variables, 205/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/888 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/888 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 30/918 variables, 30/827 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/918 variables, 30/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/918 variables, 5/862 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/918 variables, 2/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:21] [INFO ] Deduced a trap composed of 43 places in 313 ms of which 5 ms to minimize.
[2024-06-01 20:25:21] [INFO ] Deduced a trap composed of 30 places in 353 ms of which 5 ms to minimize.
[2024-06-01 20:25:22] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 5 ms to minimize.
[2024-06-01 20:25:22] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 4 ms to minimize.
[2024-06-01 20:25:23] [INFO ] Deduced a trap composed of 23 places in 340 ms of which 7 ms to minimize.
[2024-06-01 20:25:23] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 5 ms to minimize.
[2024-06-01 20:25:23] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 5 ms to minimize.
[2024-06-01 20:25:24] [INFO ] Deduced a trap composed of 13 places in 338 ms of which 5 ms to minimize.
[2024-06-01 20:25:24] [INFO ] Deduced a trap composed of 35 places in 331 ms of which 5 ms to minimize.
[2024-06-01 20:25:24] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 4 ms to minimize.
[2024-06-01 20:25:25] [INFO ] Deduced a trap composed of 29 places in 327 ms of which 4 ms to minimize.
[2024-06-01 20:25:25] [INFO ] Deduced a trap composed of 22 places in 330 ms of which 4 ms to minimize.
[2024-06-01 20:25:26] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 4 ms to minimize.
[2024-06-01 20:25:26] [INFO ] Deduced a trap composed of 33 places in 344 ms of which 5 ms to minimize.
[2024-06-01 20:25:26] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 4 ms to minimize.
[2024-06-01 20:25:27] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:25:27] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 4 ms to minimize.
[2024-06-01 20:25:27] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 4 ms to minimize.
[2024-06-01 20:25:28] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 4 ms to minimize.
[2024-06-01 20:25:28] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/918 variables, 20/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:28] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:25:29] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:25:29] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 5 ms to minimize.
[2024-06-01 20:25:29] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 4 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 4 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:25:31] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:25:31] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:25:31] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/918 variables, 11/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:32] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:25:32] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 5 ms to minimize.
[2024-06-01 20:25:32] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:25:32] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/918 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:33] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:25:33] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 5 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 5 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/918 variables, 6/905 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/918 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/918 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 918/918 variables, and 905 constraints, problems are : Problem set: 0 solved, 4 unsolved in 15819 ms.
Refiners :[Domain max(s): 315/315 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 315/315 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 43/43 constraints]
After SMT, in 16862ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 447 ms.
Support contains 33 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 723/723 transitions.
Applied a total of 0 rules in 25 ms. Remains 315 /315 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 315/315 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 723/723 transitions.
Applied a total of 0 rules in 18 ms. Remains 315 /315 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 20:25:36] [INFO ] Flow matrix only has 603 transitions (discarded 120 similar events)
[2024-06-01 20:25:36] [INFO ] Invariant cache hit.
[2024-06-01 20:25:36] [INFO ] Implicit Places using invariants in 331 ms returned [278, 291, 293, 294, 295]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 345 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 310/315 places, 723/723 transitions.
Applied a total of 0 rules in 25 ms. Remains 310 /310 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 389 ms. Remains : 310/315 places, 723/723 transitions.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 494403 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 4
Probabilistic random walk after 494403 steps, saw 73149 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2024-06-01 20:25:39] [INFO ] Flow matrix only has 603 transitions (discarded 120 similar events)
// Phase 1: matrix 603 rows 310 cols
[2024-06-01 20:25:39] [INFO ] Computed 18 invariants in 5 ms
[2024-06-01 20:25:39] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 241/274 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 241/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/279 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 603/883 variables, 280/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/883 variables, 205/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/883 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 30/913 variables, 30/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/913 variables, 30/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/913 variables, 5/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/913 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/913 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 843 constraints, problems are : Problem set: 0 solved, 4 unsolved in 896 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 310/310 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 241/274 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 241/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:41] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:25:41] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5/279 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/280 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 603/883 variables, 280/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/883 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/883 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/883 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 30/913 variables, 30/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/913 variables, 30/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/913 variables, 5/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/913 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:42] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:25:42] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 4 ms to minimize.
[2024-06-01 20:25:43] [INFO ] Deduced a trap composed of 73 places in 247 ms of which 3 ms to minimize.
[2024-06-01 20:25:43] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 5 ms to minimize.
[2024-06-01 20:25:43] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-06-01 20:25:43] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:25:44] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:25:44] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:25:44] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 5 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 3 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 5 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 4 ms to minimize.
[2024-06-01 20:25:47] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:25:47] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 5 ms to minimize.
[2024-06-01 20:25:47] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 5 ms to minimize.
[2024-06-01 20:25:48] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/913 variables, 20/869 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:48] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 5 ms to minimize.
[2024-06-01 20:25:48] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 4 ms to minimize.
[2024-06-01 20:25:49] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 5 ms to minimize.
[2024-06-01 20:25:49] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 4 ms to minimize.
[2024-06-01 20:25:49] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 4 ms to minimize.
[2024-06-01 20:25:50] [INFO ] Deduced a trap composed of 28 places in 343 ms of which 5 ms to minimize.
[2024-06-01 20:25:50] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:25:50] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:25:50] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:25:51] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 3 ms to minimize.
[2024-06-01 20:25:51] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:25:51] [INFO ] Deduced a trap composed of 58 places in 318 ms of which 4 ms to minimize.
[2024-06-01 20:25:52] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 4 ms to minimize.
[2024-06-01 20:25:52] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 4 ms to minimize.
[2024-06-01 20:25:52] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:25:53] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:25:53] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/913 variables, 17/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:54] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 4 ms to minimize.
[2024-06-01 20:25:54] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:25:54] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 6 ms to minimize.
[2024-06-01 20:25:55] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 4 ms to minimize.
[2024-06-01 20:25:55] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 4 ms to minimize.
[2024-06-01 20:25:55] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:25:56] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:25:56] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:25:56] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:25:56] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/913 variables, 10/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:25:57] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 4 ms to minimize.
[2024-06-01 20:25:57] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 2 ms to minimize.
[2024-06-01 20:25:58] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 4 ms to minimize.
[2024-06-01 20:25:58] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 4 ms to minimize.
[2024-06-01 20:25:58] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:25:59] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 4 ms to minimize.
[2024-06-01 20:25:59] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 4 ms to minimize.
[2024-06-01 20:25:59] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 4 ms to minimize.
[2024-06-01 20:25:59] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:26:00] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:26:00] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:26:00] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:26:01] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:26:01] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:26:01] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/913 variables, 15/911 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:26:02] [INFO ] Deduced a trap composed of 39 places in 411 ms of which 8 ms to minimize.
[2024-06-01 20:26:02] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 4 ms to minimize.
[2024-06-01 20:26:02] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:26:03] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:26:03] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/913 variables, 5/916 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/913 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:26:04] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/913 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/913 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/913 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 917 constraints, problems are : Problem set: 0 solved, 4 unsolved in 24089 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 310/310 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 70/70 constraints]
After SMT, in 25010ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 929 ms.
Support contains 33 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 723/723 transitions.
Applied a total of 0 rules in 17 ms. Remains 310 /310 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 310/310 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 723/723 transitions.
Applied a total of 0 rules in 15 ms. Remains 310 /310 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 20:26:05] [INFO ] Flow matrix only has 603 transitions (discarded 120 similar events)
[2024-06-01 20:26:05] [INFO ] Invariant cache hit.
[2024-06-01 20:26:06] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-01 20:26:06] [INFO ] Flow matrix only has 603 transitions (discarded 120 similar events)
[2024-06-01 20:26:06] [INFO ] Invariant cache hit.
[2024-06-01 20:26:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:26:07] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2071 ms to find 0 implicit places.
[2024-06-01 20:26:08] [INFO ] Redundant transitions in 67 ms returned []
Running 717 sub problems to find dead transitions.
[2024-06-01 20:26:08] [INFO ] Flow matrix only has 603 transitions (discarded 120 similar events)
[2024-06-01 20:26:08] [INFO ] Invariant cache hit.
[2024-06-01 20:26:08] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 309/309 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 15/324 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-06-01 20:26:15] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:26:16] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:26:16] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:26:16] [INFO ] Deduced a trap composed of 43 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:26:16] [INFO ] Deduced a trap composed of 83 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:26:17] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:26:17] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:26:17] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:26:17] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:26:17] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:26:17] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:26:18] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:26:18] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:26:18] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:26:18] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:26:18] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:26:18] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:26:18] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:26:19] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 3 ms to minimize.
[2024-06-01 20:26:19] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-06-01 20:26:19] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 4 ms to minimize.
[2024-06-01 20:26:19] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:26:20] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:26:20] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:26:20] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:26:21] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:26:21] [INFO ] Deduced a trap composed of 47 places in 287 ms of which 3 ms to minimize.
[2024-06-01 20:26:21] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 3 ms to minimize.
[2024-06-01 20:26:21] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 4 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 4 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 4 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:26:24] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-06-01 20:26:32] [INFO ] Deduced a trap composed of 73 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:26:32] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:26:32] [INFO ] Deduced a trap composed of 81 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:26:33] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:26:33] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 4 ms to minimize.
[2024-06-01 20:26:34] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:26:34] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:26:34] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:26:34] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:26:35] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
[2024-06-01 20:26:35] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:26:35] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 4 ms to minimize.
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-06-01 20:26:37] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-06-01 20:26:37] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-06-01 20:26:38] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:26:38] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 4 ms to minimize.
SMT process timed out in 30594ms, After SMT, problems are : Problem set: 0 solved, 717 unsolved
Search for dead transitions found 0 dead transitions in 30611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32786 ms. Remains : 310/310 places, 723/723 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 469 edges and 310 vertex of which 116 / 310 are part of one of the 26 SCC in 6 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 180 transitions
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 311 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 412
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 2 place count 219 transition count 401
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 24 place count 208 transition count 401
Performed 44 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 1 with 88 rules applied. Total rules applied 112 place count 164 transition count 343
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 124 place count 164 transition count 331
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 171 place count 138 transition count 414
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 60 edges and 138 vertex of which 12 / 138 are part of one of the 2 SCC in 1 ms
Free SCC test removed 10 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 186 place count 128 transition count 400
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 198 place count 128 transition count 388
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 204 place count 125 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 261 place count 125 transition count 328
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 265 place count 125 transition count 324
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 271 place count 121 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 273 place count 119 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 273 place count 119 transition count 321
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 275 place count 118 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 276 place count 118 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 277 place count 118 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 278 place count 117 transition count 319
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 286 place count 117 transition count 311
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 294 place count 109 transition count 311
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 304 place count 109 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 310 place count 109 transition count 305
Applied a total of 310 rules in 176 ms. Remains 109 /310 variables (removed 201) and now considering 305/723 (removed 418) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 305 rows 109 cols
[2024-06-01 20:26:38] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 20:26:39] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 20:26:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 20:26:39] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 20:26:39] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 20:26:39] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 862 ms.
[2024-06-01 20:26:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 20:26:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 310 places, 723 transitions and 2780 arcs took 17 ms.
[2024-06-01 20:26:40] [INFO ] Flatten gal took : 222 ms
Total runtime 127734 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Peterson-PT-5-ReachabilityCardinality-2024-08
Could not compute solution for formula : Peterson-PT-5-ReachabilityCardinality-2024-10
Could not compute solution for formula : Peterson-PT-5-ReachabilityCardinality-2024-11
Could not compute solution for formula : Peterson-PT-5-ReachabilityCardinality-2024-13

BK_STOP 1717273600774

--------------------
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
mcc2024
rfs formula name Peterson-PT-5-ReachabilityCardinality-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1295/inv_0_
rfs formula name Peterson-PT-5-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/1295/inv_1_
rfs formula name Peterson-PT-5-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/1295/inv_2_
rfs formula name Peterson-PT-5-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/1295/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="Peterson-PT-5"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Peterson-PT-5, 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 r512-smll-171654407300278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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