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.r399-tall-171690529900214.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyCommit-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529900214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 126M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 126M 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 StigmergyCommit-PT-09b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2023-09
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716997835702

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 15:50:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 15:50:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 15:50:41] [INFO ] Load time of PNML (sax parser for PT used): 4603 ms
[2024-05-29 15:50:41] [INFO ] Transformed 3049 places.
[2024-05-29 15:50:42] [INFO ] Transformed 122340 transitions.
[2024-05-29 15:50:42] [INFO ] Found NUPN structural information;
[2024-05-29 15:50:42] [INFO ] Parsed PT model containing 3049 places and 122340 transitions and 2389246 arcs in 5312 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (219 resets) in 5598 ms. (7 steps per ms) remains 15/16 properties
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 5490 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :0 out of 15
Probabilistic random walk after 5490 steps, saw 4662 distinct states, run finished after 3013 ms. (steps per millisecond=1 ) properties seen :0
// Phase 1: matrix 122340 rows 3049 cols
[2024-05-29 15:50:56] [INFO ] Computed 11 invariants in 7769 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2935/3049 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3049 variables, 2935/3060 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3049 variables, 0/3060 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 14017ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 114 out of 3049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3049/3049 places, 122340/122340 transitions.
Graph (trivial) has 2799 edges and 3049 vertex of which 184 / 3049 are part of one of the 28 SCC in 31 ms
Free SCC test removed 156 places
Drop transitions (Empty/Sink Transition effects.) removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Graph (complete) has 5432 edges and 2893 vertex of which 2873 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.364 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2044 transitions
Trivial Post-agglo rules discarded 2044 transitions
Performed 2044 trivial Post agglomeration. Transition count delta: 2044
Iterating post reduction 0 with 2054 rules applied. Total rules applied 2056 place count 2873 transition count 120077
Reduce places removed 2044 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 2094 rules applied. Total rules applied 4150 place count 829 transition count 120027
Reduce places removed 22 places and 0 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Iterating post reduction 2 with 117 rules applied. Total rules applied 4267 place count 807 transition count 119932
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 3 with 95 rules applied. Total rules applied 4362 place count 712 transition count 119932
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 4362 place count 712 transition count 119825
Deduced a syphon composed of 107 places in 117 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 4576 place count 605 transition count 119825
Discarding 107 places :
Symmetric choice reduction at 4 with 107 rule applications. Total rules 4683 place count 498 transition count 119718
Iterating global reduction 4 with 107 rules applied. Total rules applied 4790 place count 498 transition count 119718
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4793 place count 498 transition count 119715
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 4844 place count 447 transition count 4126
Iterating global reduction 5 with 51 rules applied. Total rules applied 4895 place count 447 transition count 4126
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 4910 place count 447 transition count 4111
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4914 place count 443 transition count 4107
Iterating global reduction 6 with 4 rules applied. Total rules applied 4918 place count 443 transition count 4107
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 4920 place count 441 transition count 4105
Iterating global reduction 6 with 2 rules applied. Total rules applied 4922 place count 441 transition count 4105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4924 place count 441 transition count 4103
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 4994 place count 406 transition count 4068
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 5003 place count 397 transition count 4059
Iterating global reduction 7 with 9 rules applied. Total rules applied 5012 place count 397 transition count 4059
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 5018 place count 391 transition count 4053
Iterating global reduction 7 with 6 rules applied. Total rules applied 5024 place count 391 transition count 4053
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 5028 place count 387 transition count 4049
Iterating global reduction 7 with 4 rules applied. Total rules applied 5032 place count 387 transition count 4049
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 5038 place count 384 transition count 4068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 5039 place count 384 transition count 4067
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 5044 place count 384 transition count 4062
Free-agglomeration rule applied 85 times.
Iterating global reduction 8 with 85 rules applied. Total rules applied 5129 place count 384 transition count 3977
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 8 with 85 rules applied. Total rules applied 5214 place count 299 transition count 3977
Drop transitions (Redundant composition of simpler transitions.) removed 1532 transitions
Redundant transition composition rules discarded 1532 transitions
Iterating global reduction 9 with 1532 rules applied. Total rules applied 6746 place count 299 transition count 2445
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 6750 place count 299 transition count 2441
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 6754 place count 295 transition count 2441
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 6765 place count 295 transition count 2441
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 6766 place count 295 transition count 2441
Applied a total of 6766 rules in 34500 ms. Remains 295 /3049 variables (removed 2754) and now considering 2441/122340 (removed 119899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34516 ms. Remains : 295/3049 places, 2441/122340 transitions.
RANDOM walk for 40000 steps (615 resets) in 1393 ms. (28 steps per ms) remains 9/15 properties
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (89 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (86 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (86 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (84 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (88 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (86 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (85 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (84 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
// Phase 1: matrix 2441 rows 295 cols
[2024-05-29 15:51:37] [INFO ] Computed 11 invariants in 22 ms
[2024-05-29 15:51:38] [INFO ] State equation strengthened by 1984 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 229/293 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/295 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2441/2736 variables, 295/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2736 variables, 1984/2290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2736 variables, 0/2290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/2736 variables, 0/2290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2736/2736 variables, and 2290 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3126 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 295/295 constraints, ReadFeed: 1984/1984 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 229/293 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 15:51:42] [INFO ] Deduced a trap composed of 41 places in 1074 ms of which 26 ms to minimize.
[2024-05-29 15:51:44] [INFO ] Deduced a trap composed of 33 places in 1985 ms of which 3 ms to minimize.
[2024-05-29 15:51:45] [INFO ] Deduced a trap composed of 34 places in 828 ms of which 7 ms to minimize.
[2024-05-29 15:51:46] [INFO ] Deduced a trap composed of 27 places in 754 ms of which 1 ms to minimize.
[2024-05-29 15:51:47] [INFO ] Deduced a trap composed of 38 places in 718 ms of which 2 ms to minimize.
[2024-05-29 15:51:48] [INFO ] Deduced a trap composed of 33 places in 698 ms of which 4 ms to minimize.
[2024-05-29 15:51:48] [INFO ] Deduced a trap composed of 32 places in 705 ms of which 1 ms to minimize.
[2024-05-29 15:51:49] [INFO ] Deduced a trap composed of 40 places in 689 ms of which 15 ms to minimize.
[2024-05-29 15:51:50] [INFO ] Deduced a trap composed of 37 places in 647 ms of which 2 ms to minimize.
[2024-05-29 15:51:50] [INFO ] Deduced a trap composed of 34 places in 671 ms of which 1 ms to minimize.
[2024-05-29 15:51:51] [INFO ] Deduced a trap composed of 32 places in 660 ms of which 0 ms to minimize.
[2024-05-29 15:51:52] [INFO ] Deduced a trap composed of 35 places in 623 ms of which 4 ms to minimize.
[2024-05-29 15:51:52] [INFO ] Deduced a trap composed of 46 places in 630 ms of which 1 ms to minimize.
[2024-05-29 15:51:53] [INFO ] Deduced a trap composed of 44 places in 778 ms of which 1 ms to minimize.
[2024-05-29 15:51:54] [INFO ] Deduced a trap composed of 39 places in 807 ms of which 2 ms to minimize.
[2024-05-29 15:51:55] [INFO ] Deduced a trap composed of 38 places in 811 ms of which 1 ms to minimize.
[2024-05-29 15:51:55] [INFO ] Deduced a trap composed of 32 places in 793 ms of which 1 ms to minimize.
[2024-05-29 15:51:56] [INFO ] Deduced a trap composed of 42 places in 766 ms of which 1 ms to minimize.
[2024-05-29 15:51:57] [INFO ] Deduced a trap composed of 31 places in 777 ms of which 1 ms to minimize.
[2024-05-29 15:51:58] [INFO ] Deduced a trap composed of 38 places in 775 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 15:51:59] [INFO ] Deduced a trap composed of 55 places in 781 ms of which 2 ms to minimize.
[2024-05-29 15:51:59] [INFO ] Deduced a trap composed of 41 places in 711 ms of which 3 ms to minimize.
[2024-05-29 15:52:00] [INFO ] Deduced a trap composed of 34 places in 696 ms of which 3 ms to minimize.
[2024-05-29 15:52:01] [INFO ] Deduced a trap composed of 22 places in 719 ms of which 1 ms to minimize.
[2024-05-29 15:52:02] [INFO ] Deduced a trap composed of 36 places in 667 ms of which 2 ms to minimize.
[2024-05-29 15:52:02] [INFO ] Deduced a trap composed of 50 places in 675 ms of which 2 ms to minimize.
[2024-05-29 15:52:03] [INFO ] Deduced a trap composed of 35 places in 658 ms of which 1 ms to minimize.
[2024-05-29 15:52:04] [INFO ] Deduced a trap composed of 49 places in 657 ms of which 1 ms to minimize.
[2024-05-29 15:52:04] [INFO ] Deduced a trap composed of 39 places in 657 ms of which 2 ms to minimize.
[2024-05-29 15:52:05] [INFO ] Deduced a trap composed of 34 places in 696 ms of which 1 ms to minimize.
[2024-05-29 15:52:06] [INFO ] Deduced a trap composed of 28 places in 666 ms of which 1 ms to minimize.
[2024-05-29 15:52:06] [INFO ] Deduced a trap composed of 32 places in 726 ms of which 1 ms to minimize.
[2024-05-29 15:52:07] [INFO ] Deduced a trap composed of 43 places in 699 ms of which 2 ms to minimize.
[2024-05-29 15:52:08] [INFO ] Deduced a trap composed of 45 places in 777 ms of which 4 ms to minimize.
Problem StigmergyCommit-PT-09b-ReachabilityCardinality-2023-09 is UNSAT
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2023-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 15:52:09] [INFO ] Deduced a trap composed of 44 places in 748 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 15/45 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 15:52:10] [INFO ] Deduced a trap composed of 47 places in 736 ms of which 1 ms to minimize.
[2024-05-29 15:52:10] [INFO ] Deduced a trap composed of 40 places in 647 ms of which 1 ms to minimize.
[2024-05-29 15:52:11] [INFO ] Deduced a trap composed of 42 places in 791 ms of which 2 ms to minimize.
[2024-05-29 15:52:12] [INFO ] Deduced a trap composed of 31 places in 834 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 4/49 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 15:52:13] [INFO ] Deduced a trap composed of 47 places in 712 ms of which 2 ms to minimize.
[2024-05-29 15:52:13] [INFO ] Deduced a trap composed of 57 places in 736 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 2/51 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 15:52:14] [INFO ] Deduced a trap composed of 41 places in 655 ms of which 2 ms to minimize.
[2024-05-29 15:52:15] [INFO ] Deduced a trap composed of 56 places in 674 ms of which 1 ms to minimize.
[2024-05-29 15:52:16] [INFO ] Deduced a trap composed of 37 places in 664 ms of which 2 ms to minimize.
[2024-05-29 15:52:16] [INFO ] Deduced a trap composed of 39 places in 584 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 4/55 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 15:52:17] [INFO ] Deduced a trap composed of 51 places in 621 ms of which 1 ms to minimize.
[2024-05-29 15:52:18] [INFO ] Deduced a trap composed of 42 places in 588 ms of which 1 ms to minimize.
[2024-05-29 15:52:18] [INFO ] Deduced a trap composed of 42 places in 706 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 3/58 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/295 variables, 1/59 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 15:52:19] [INFO ] Deduced a trap composed of 48 places in 565 ms of which 1 ms to minimize.
[2024-05-29 15:52:20] [INFO ] Deduced a trap composed of 31 places in 670 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 2/61 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2441/2736 variables, 295/356 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2736 variables, 1984/2340 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2736 variables, 8/2348 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 15:52:26] [INFO ] Deduced a trap composed of 44 places in 796 ms of which 3 ms to minimize.
[2024-05-29 15:52:27] [INFO ] Deduced a trap composed of 32 places in 738 ms of which 2 ms to minimize.
SMT process timed out in 49238ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 362 ms.
Support contains 58 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 2441/2441 transitions.
Graph (trivial) has 114 edges and 295 vertex of which 4 / 295 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 293 transition count 2389
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 59 rules applied. Total rules applied 108 place count 245 transition count 2378
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 119 place count 236 transition count 2376
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 119 place count 236 transition count 2370
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 131 place count 230 transition count 2370
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 137 place count 224 transition count 2364
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 224 transition count 2364
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 148 place count 219 transition count 2359
Iterating global reduction 3 with 5 rules applied. Total rules applied 153 place count 219 transition count 2359
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 177 place count 207 transition count 2346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 179 place count 207 transition count 2344
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 196 place count 190 transition count 2327
Iterating global reduction 4 with 17 rules applied. Total rules applied 213 place count 190 transition count 2327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 215 place count 190 transition count 2325
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 218 place count 187 transition count 2322
Iterating global reduction 5 with 3 rules applied. Total rules applied 221 place count 187 transition count 2322
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 222 place count 186 transition count 2321
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 186 transition count 2321
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 235 place count 186 transition count 2309
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 246 place count 186 transition count 2298
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 258 place count 175 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 261 place count 175 transition count 2297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 175 transition count 2296
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 264 place count 175 transition count 2294
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 265 place count 174 transition count 2292
Iterating global reduction 7 with 1 rules applied. Total rules applied 266 place count 174 transition count 2292
Applied a total of 266 rules in 2002 ms. Remains 174 /295 variables (removed 121) and now considering 2292/2441 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2002 ms. Remains : 174/295 places, 2292/2441 transitions.
RANDOM walk for 40000 steps (912 resets) in 553 ms. (72 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (85 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (88 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (85 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (87 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (83 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (67 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (86 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (86 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 320344 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 8
Probabilistic random walk after 320344 steps, saw 53822 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
// Phase 1: matrix 2292 rows 174 cols
[2024-05-29 15:52:32] [INFO ] Computed 11 invariants in 13 ms
[2024-05-29 15:52:33] [INFO ] State equation strengthened by 2104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 115/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/174 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2292/2466 variables, 174/185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2466 variables, 2104/2289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2466 variables, 0/2289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/2466 variables, 0/2289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2466/2466 variables, and 2289 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2583 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 174/174 constraints, ReadFeed: 2104/2104 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 115/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 15:52:36] [INFO ] Deduced a trap composed of 18 places in 721 ms of which 2 ms to minimize.
[2024-05-29 15:52:37] [INFO ] Deduced a trap composed of 19 places in 683 ms of which 1 ms to minimize.
[2024-05-29 15:52:38] [INFO ] Deduced a trap composed of 20 places in 666 ms of which 1 ms to minimize.
[2024-05-29 15:52:38] [INFO ] Deduced a trap composed of 22 places in 682 ms of which 1 ms to minimize.
[2024-05-29 15:52:39] [INFO ] Deduced a trap composed of 26 places in 701 ms of which 17 ms to minimize.
[2024-05-29 15:52:40] [INFO ] Deduced a trap composed of 26 places in 675 ms of which 1 ms to minimize.
[2024-05-29 15:52:40] [INFO ] Deduced a trap composed of 27 places in 685 ms of which 1 ms to minimize.
[2024-05-29 15:52:41] [INFO ] Deduced a trap composed of 28 places in 691 ms of which 1 ms to minimize.
[2024-05-29 15:52:42] [INFO ] Deduced a trap composed of 24 places in 624 ms of which 1 ms to minimize.
[2024-05-29 15:52:42] [INFO ] Deduced a trap composed of 19 places in 617 ms of which 1 ms to minimize.
[2024-05-29 15:52:43] [INFO ] Deduced a trap composed of 28 places in 545 ms of which 1 ms to minimize.
[2024-05-29 15:52:44] [INFO ] Deduced a trap composed of 27 places in 720 ms of which 1 ms to minimize.
[2024-05-29 15:52:44] [INFO ] Deduced a trap composed of 24 places in 574 ms of which 1 ms to minimize.
[2024-05-29 15:52:45] [INFO ] Deduced a trap composed of 24 places in 577 ms of which 1 ms to minimize.
[2024-05-29 15:52:45] [INFO ] Deduced a trap composed of 23 places in 543 ms of which 1 ms to minimize.
[2024-05-29 15:52:46] [INFO ] Deduced a trap composed of 29 places in 780 ms of which 1 ms to minimize.
[2024-05-29 15:52:47] [INFO ] Deduced a trap composed of 26 places in 704 ms of which 1 ms to minimize.
[2024-05-29 15:52:48] [INFO ] Deduced a trap composed of 27 places in 708 ms of which 2 ms to minimize.
[2024-05-29 15:52:48] [INFO ] Deduced a trap composed of 21 places in 576 ms of which 1 ms to minimize.
[2024-05-29 15:52:49] [INFO ] Deduced a trap composed of 30 places in 586 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 15:52:49] [INFO ] Deduced a trap composed of 21 places in 578 ms of which 0 ms to minimize.
[2024-05-29 15:52:50] [INFO ] Deduced a trap composed of 25 places in 638 ms of which 2 ms to minimize.
[2024-05-29 15:52:51] [INFO ] Deduced a trap composed of 30 places in 609 ms of which 1 ms to minimize.
[2024-05-29 15:52:51] [INFO ] Deduced a trap composed of 33 places in 501 ms of which 1 ms to minimize.
[2024-05-29 15:52:52] [INFO ] Deduced a trap composed of 33 places in 519 ms of which 1 ms to minimize.
[2024-05-29 15:52:52] [INFO ] Deduced a trap composed of 28 places in 479 ms of which 1 ms to minimize.
[2024-05-29 15:52:53] [INFO ] Deduced a trap composed of 25 places in 447 ms of which 1 ms to minimize.
[2024-05-29 15:52:53] [INFO ] Deduced a trap composed of 36 places in 407 ms of which 0 ms to minimize.
[2024-05-29 15:52:54] [INFO ] Deduced a trap composed of 23 places in 948 ms of which 2 ms to minimize.
[2024-05-29 15:52:55] [INFO ] Deduced a trap composed of 24 places in 679 ms of which 1 ms to minimize.
[2024-05-29 15:52:55] [INFO ] Deduced a trap composed of 22 places in 630 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 15:52:56] [INFO ] Deduced a trap composed of 29 places in 512 ms of which 1 ms to minimize.
[2024-05-29 15:52:56] [INFO ] Deduced a trap composed of 34 places in 475 ms of which 1 ms to minimize.
[2024-05-29 15:52:57] [INFO ] Deduced a trap composed of 28 places in 589 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/174 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2292/2466 variables, 174/219 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2466 variables, 2104/2323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2466 variables, 8/2331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 15:53:03] [INFO ] Deduced a trap composed of 35 places in 600 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2466 variables, 1/2332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2466 variables, 0/2332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/2466 variables, 0/2332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2466/2466 variables, and 2332 constraints, problems are : Problem set: 0 solved, 8 unsolved in 31632 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 174/174 constraints, ReadFeed: 2104/2104 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 35/35 constraints]
After SMT, in 34737ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3608 ms.
Support contains 56 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 2292/2292 transitions.
Graph (trivial) has 15 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 2289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 172 transition count 2289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 170 transition count 2287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 170 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 169 transition count 2284
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 169 transition count 2284
Applied a total of 11 rules in 401 ms. Remains 169 /174 variables (removed 5) and now considering 2284/2292 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 169/174 places, 2284/2292 transitions.
RANDOM walk for 40000 steps (910 resets) in 430 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (85 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (88 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (87 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (66 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (87 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 346009 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 6
Probabilistic random walk after 346009 steps, saw 58405 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 2284 rows 169 cols
[2024-05-29 15:53:14] [INFO ] Computed 11 invariants in 13 ms
[2024-05-29 15:53:15] [INFO ] State equation strengthened by 2101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 112/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2284/2453 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2453 variables, 2101/2281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2453 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/2453 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2453/2453 variables, and 2281 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2361 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 169/169 constraints, ReadFeed: 2101/2101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 112/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 15:53:18] [INFO ] Deduced a trap composed of 23 places in 757 ms of which 2 ms to minimize.
[2024-05-29 15:53:19] [INFO ] Deduced a trap composed of 25 places in 633 ms of which 1 ms to minimize.
[2024-05-29 15:53:19] [INFO ] Deduced a trap composed of 16 places in 546 ms of which 1 ms to minimize.
[2024-05-29 15:53:20] [INFO ] Deduced a trap composed of 17 places in 604 ms of which 1 ms to minimize.
[2024-05-29 15:53:20] [INFO ] Deduced a trap composed of 20 places in 626 ms of which 1 ms to minimize.
[2024-05-29 15:53:21] [INFO ] Deduced a trap composed of 18 places in 619 ms of which 1 ms to minimize.
[2024-05-29 15:53:22] [INFO ] Deduced a trap composed of 19 places in 649 ms of which 1 ms to minimize.
[2024-05-29 15:53:22] [INFO ] Deduced a trap composed of 15 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:53:23] [INFO ] Deduced a trap composed of 27 places in 609 ms of which 1 ms to minimize.
[2024-05-29 15:53:23] [INFO ] Deduced a trap composed of 20 places in 591 ms of which 1 ms to minimize.
[2024-05-29 15:53:24] [INFO ] Deduced a trap composed of 24 places in 562 ms of which 1 ms to minimize.
[2024-05-29 15:53:25] [INFO ] Deduced a trap composed of 19 places in 505 ms of which 1 ms to minimize.
[2024-05-29 15:53:25] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 1 ms to minimize.
[2024-05-29 15:53:25] [INFO ] Deduced a trap composed of 20 places in 518 ms of which 1 ms to minimize.
[2024-05-29 15:53:26] [INFO ] Deduced a trap composed of 23 places in 462 ms of which 1 ms to minimize.
[2024-05-29 15:53:26] [INFO ] Deduced a trap composed of 26 places in 428 ms of which 1 ms to minimize.
[2024-05-29 15:53:27] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 1 ms to minimize.
[2024-05-29 15:53:27] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 0 ms to minimize.
[2024-05-29 15:53:28] [INFO ] Deduced a trap composed of 26 places in 626 ms of which 1 ms to minimize.
[2024-05-29 15:53:28] [INFO ] Deduced a trap composed of 16 places in 652 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 15:53:29] [INFO ] Deduced a trap composed of 23 places in 827 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 15:53:30] [INFO ] Deduced a trap composed of 21 places in 697 ms of which 1 ms to minimize.
[2024-05-29 15:53:31] [INFO ] Deduced a trap composed of 26 places in 723 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2284/2453 variables, 169/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2453 variables, 2101/2304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2453 variables, 6/2310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2453 variables, 0/2310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/2453 variables, 0/2310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2453/2453 variables, and 2310 constraints, problems are : Problem set: 0 solved, 6 unsolved in 18509 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 169/169 constraints, ReadFeed: 2101/2101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 23/23 constraints]
After SMT, in 21213ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 397 ms.
Support contains 56 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 2284/2284 transitions.
Applied a total of 0 rules in 349 ms. Remains 169 /169 variables (removed 0) and now considering 2284/2284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 169/169 places, 2284/2284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 2284/2284 transitions.
Applied a total of 0 rules in 355 ms. Remains 169 /169 variables (removed 0) and now considering 2284/2284 (removed 0) transitions.
[2024-05-29 15:53:37] [INFO ] Invariant cache hit.
[2024-05-29 15:53:37] [INFO ] Implicit Places using invariants in 530 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 540 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 168/169 places, 2284/2284 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 168 transition count 2271
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 155 transition count 2268
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 152 transition count 2268
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 32 place count 152 transition count 2263
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 42 place count 147 transition count 2263
Performed 21 Post agglomeration using F-continuation condition with reduction of 1327 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 84 place count 126 transition count 915
Ensure Unique test removed 363 transitions
Reduce isomorphic transitions removed 363 transitions.
Iterating post reduction 3 with 363 rules applied. Total rules applied 447 place count 126 transition count 552
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 450 place count 123 transition count 328
Iterating global reduction 4 with 3 rules applied. Total rules applied 453 place count 123 transition count 328
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 461 place count 119 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 463 place count 118 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 478 place count 118 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 480 place count 117 transition count 321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 484 place count 115 transition count 344
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 490 place count 115 transition count 338
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 496 place count 109 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 499 place count 109 transition count 335
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 501 place count 109 transition count 335
Applied a total of 501 rules in 159 ms. Remains 109 /168 variables (removed 59) and now considering 335/2284 (removed 1949) transitions.
// Phase 1: matrix 335 rows 109 cols
[2024-05-29 15:53:37] [INFO ] Computed 10 invariants in 2 ms
[2024-05-29 15:53:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 15:53:38] [INFO ] Invariant cache hit.
[2024-05-29 15:53:38] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-29 15:53:38] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 109/169 places, 335/2284 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1523 ms. Remains : 109/169 places, 335/2284 transitions.
RANDOM walk for 40000 steps (1459 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (152 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (150 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (150 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (151 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (111 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (150 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 993618 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 6
Probabilistic random walk after 993618 steps, saw 138587 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
[2024-05-29 15:53:41] [INFO ] Invariant cache hit.
[2024-05-29 15:53:41] [INFO ] State equation strengthened by 196 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 53/109 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 335/444 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 196/315 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/444 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 315 constraints, problems are : Problem set: 0 solved, 6 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 53/109 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-29 15:53:42] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 15:53:43] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2024-05-29 15:53:43] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-29 15:53:43] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:53:43] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:53:43] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 335/444 variables, 109/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 196/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 15:53:43] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/444 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 337 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 16/16 constraints]
After SMT, in 2640ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 908 ms.
Support contains 56 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 335/335 transitions.
Applied a total of 0 rules in 12 ms. Remains 109 /109 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 109/109 places, 335/335 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 335/335 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-05-29 15:53:45] [INFO ] Invariant cache hit.
[2024-05-29 15:53:45] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 15:53:45] [INFO ] Invariant cache hit.
[2024-05-29 15:53:45] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-29 15:53:45] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-29 15:53:45] [INFO ] Redundant transitions in 22 ms returned []
Running 311 sub problems to find dead transitions.
[2024-05-29 15:53:45] [INFO ] Invariant cache hit.
[2024-05-29 15:53:45] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-05-29 15:53:47] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-29 15:53:48] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-29 15:53:49] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-29 15:53:49] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-29 15:53:49] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:53:49] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:53:49] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:53:49] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:53:49] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 0 ms to minimize.
[2024-05-29 15:53:49] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:53:50] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-05-29 15:53:51] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-05-29 15:53:52] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-29 15:53:53] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:53:54] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:53:54] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 335/444 variables, 109/171 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 196/367 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/444 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 367 constraints, problems are : Problem set: 0 solved, 311 unsolved in 22749 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-05-29 15:54:10] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:54:10] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-29 15:54:10] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-29 15:54:10] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:54:10] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-05-29 15:54:12] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-05-29 15:54:12] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:54:13] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 335/444 variables, 109/179 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 196/375 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 311/686 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-05-29 15:54:25] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:54:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:54:25] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-29 15:54:25] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 15:54:26] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2024-05-29 15:54:27] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 6/692 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 692 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 66/66 constraints]
After SMT, in 53848ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 53853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54201 ms. Remains : 109/109 places, 335/335 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-29 15:54:39] [INFO ] Invariant cache hit.
[2024-05-29 15:54:39] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 15:54:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-29 15:54:39] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-29 15:54:39] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:54:39] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 448 ms
[2024-05-29 15:54:40] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 380 ms
TRAPS : Iteration 1
[2024-05-29 15:54:40] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-05-29 15:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-29 15:54:41] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-29 15:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
TRAPS : Iteration 2
[2024-05-29 15:54:41] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-29 15:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
TRAPS : Iteration 3
[2024-05-29 15:54:41] [INFO ] After 1894ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-29 15:54:41] [INFO ] After 2045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 2122 ms.
[2024-05-29 15:54:41] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 15:54:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 335 transitions and 4414 arcs took 7 ms.
[2024-05-29 15:54:41] [INFO ] Flatten gal took : 89 ms
Total runtime 244881 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-09b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 109
TRANSITIONS: 335
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.007s]


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


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

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

Process ID: 1233
MODEL NAME: /home/mcc/execution/408/model
109 places, 335 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716998082999

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyCommit-PT-09b, 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 r399-tall-171690529900214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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