About the Execution of LTSMin+red for JoinFreeModules-PT-2000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7245.735 | 93759.00 | 168335.00 | 292.10 | FTFFFFFTFFTTFFTF | normal |
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.r504-tall-171649612000086.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is JoinFreeModules-PT-2000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612000086
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 11 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 6.2M May 18 16:42 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 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-00
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-01
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-04
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-06
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-07
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-08
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-09
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-10
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-11
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-12
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-13
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-14
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717222311224
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:11:52] [INFO ] Load time of PNML (sax parser for PT used): 445 ms
[2024-06-01 06:11:52] [INFO ] Transformed 10001 places.
[2024-06-01 06:11:52] [INFO ] Transformed 16001 transitions.
[2024-06-01 06:11:53] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 613 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 43041 steps (8 resets) in 5586 ms. (7 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3923 ms. (10 steps per ms) remains 11/12 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4243 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3944 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3743 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4846 ms. (8 steps per ms) remains 10/11 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4783 ms. (8 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4314 ms. (9 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3737 ms. (10 steps per ms) remains 9/10 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 3771 ms. (10 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3721 ms. (10 steps per ms) remains 8/9 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 3971 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3901 ms. (10 steps per ms) remains 8/8 properties
// Phase 1: matrix 16001 rows 10000 cols
[2024-06-01 06:12:07] [INFO ] Computed 2000 invariants in 99 ms
[2024-06-01 06:12:07] [INFO ] State equation strengthened by 2000 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 639/805 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1288/2093 variables, 805/966 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2093 variables, 161/1127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2093 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/2093 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2093/26001 variables, and 1127 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 161/2000 constraints, State Equation: 805/10000 constraints, ReadFeed: 161/2000 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/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 639/805 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 23 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 10 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
SMT process timed out in 6907ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 166 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 805 are kept as prefixes of interest. Removing 9195 places using SCC suffix rule.25 ms
Discarding 9195 places :
Also discarding 14712 output transitions
Drop transitions (Output transitions of discarded places.) removed 14712 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 805 transition count 1288
Applied a total of 2 rules in 156 ms. Remains 805 /10000 variables (removed 9195) and now considering 1288/16001 (removed 14713) transitions.
Running 966 sub problems to find dead transitions.
// Phase 1: matrix 1288 rows 805 cols
[2024-06-01 06:12:14] [INFO ] Computed 161 invariants in 7 ms
[2024-06-01 06:12:14] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (OVERLAPS) 161/805 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/2093 variables, and 161 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/805 constraints, ReadFeed: 0/161 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (OVERLAPS) 161/805 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 2)
(s2 0)
(s3 1991)
(s4 5)
(s5 5)
(s6 1989)
(s7 0)
(s8 4)
(s9 5)
(s10 5)
(s11 2)
(s12 1987)
(s13 4)
(s14 5)
(s15 5)
(s16 2)
(s17 1987)
(s18 4)
(s19 5)
(s20 5)
(s21 2)
(s22 0)
(s23 1991)
(s24 5)
(s25 1992)
(s26 2)
(s27 0)
(s28 4)
(s29 5)
(s30 5)
(s31 2)
(s32 0)
(s33 1991)
(s34 5)
(s35 5)
(s36 2)
(s37 1987)
(s38 4)
(s39 5)
(s40 5)
(s41 1989)
(s42 0)
(s43 4)
(s44 5)
(s45 1992)
(s46 2)
(s47 0)
(s48 4)
(s49 5)
(s50 5)
(s51 2)
(s52 0)
(s53 1991)
(s54 5)
(s55 5)
(s56 2)
(s57 0)
(s58 1991)
(s59 5)
(s60 1992)
(s61 2)
(s62 0)
(s63 4)
(s64 5)
(s65 5)
(s66 2)
(s67 1987)
(s68 4)
(s69 5)
(s70 5)
(s71 2)
(s72 1987)
(s73 4)
(s74 5)
(s75 5)
(s76 1989)
(s77 0)
(s78 4)
(s79 5)
(s80 5)
(s81 2)
(s82 0)
(s83 1991)
(s84 5)
(s85 5)
(s86 2)
(s87 1987)
(s88 4)
(s89 5)
(s90 1992)
(s91 2)
(s92 0)
(s93 4)
(s94 5)
(s95 5)
(s96 1989)
(s97 0)
(s98 4)
(s99 5)
(s100 5)
(s101 2)
(s102 1987)
(s103 4)
(s104 5)
(s105 5)
(s106 2)
(s107 0)
(s108 4)
(s109 1992)
(s110 1992)
(s111 2)
(s112 0)
(s113 4)
(s114 5)
(s115 5)
(s116 2)
(s117 1987)
(s118 4)
(s119 5)
(s120 5)
(s121 2)
(s122 0)
(s123 4)
(s124 1992)
(s125 5)
(s126 2)
(s127 0)
(s128 4)
(s129 1992)
(s130 5)
(s131 2)
(s132 0)
(s133 4)
(s134 1992)
(s135 5)
(s136 2)
(s137 0)
(s138 4)
(s139 1992)
(s140 5)
(s141 2)
(s142 1987)
(s143 4)
(s144 5)
(s145 5)
(s146 1989)
(s147 0)
(s148 4)
(s149 5)
(s150 5)
(s151 2)
(s152 0)
(s153 1991)
(s154 5)
(s155 5)
(s156 2)
(s157 1987)
(s158 4)
(s159 5)
(s160 5)
(s161 2)
(s162 1987)
(s163 4)
(s164 5)
(s165 5)
(s166 2)
(s167 0)
(s168 4)
(s169 1992)
(s170 5)
(s171 1989)
(s172 0)
(s173 4)
(s174 5)
(s175 5)
(s176 2)
(s177 0)
(s178 1991)
(s179 5)
(s180 5)
(s181 2)
(s182 0)
(s183 1991)
(s184 5)
(s185 5)
(s186 2)
(s187 1987)
(s188 4)
(s189 5)
(s190 5)
(s191 2)
(s192 1987)
(s193 4)
(s194 5)
(s195 5)
(s196 2)
(s197 0)
(s198 4)
(s199 1992)
(s200 5)
(s201 2)
(s202 1987)
(s203 4)
(s204 5)
(s205 5)
(s206 2)
(s207 1987)
(s208 4)
(s209 5)
(s210 5)
(s211 2)
(s212 0)
(s213 1991)
(s214 5)
(s215 5)
(s216 2)
(s217 0)
(s218 1991)
(s219 5)
(s220 1992)
(s221 2)
(s222 0)
(s223 4)
(s224 5)
(s225 5)
(s226 2)
(s227 0)
(s228 1991)
(s229 5)
(s230 5)
(s231 2)
(s232 0)
(s233 1991)
(s234 5)
(s235 5)
(s236 2)
(s237 1987)
(s238 4)
(s239 5)
(s240 5)
(s241 1989)
(s242 0)
(s243 4)
(s244 5)
(s245 5)
(s246 1989)
(s247 0)
(s248 4)
(s249 5)
(s250 1992)
(s251 2)
(s252 0)
(s253 4)
(s254 5)
(s255 5)
(s256 2)
(s257 1987)
(s258 4)
(s259 5)
(s260 5)
(s261 2)
(s262 0)
(s263 4)
(s264 1992)
(s265 5)
(s266 2)
(s267 1987)
(s268 4)
(s269 5)
(s270 1992)
(s271 2)
(s272 0)
(s273 4)
(s274 5)
(s275 5)
(s276 2)
(s277 0)
(s278 4)
(s279 1992)
(s280 1992)
(s281 2)
(s282 0)
(s283 4)
(s284 5)
(s285 1992)
(s286 2)
(s287 0)
(s288 4)
(s289 5)
(s290 5)
(s291 1989)
(s292 0)
(s293 4)
(s294 5)
(s295 5)
(s296 2)
(s297 0)
(s298 4)
(s299 1992)
(s300 5)
(s301 2)
(s302 1987)
(s303 4)
(s304 5)
(s305 5)
(s306 1989)
(s307 0)
(s308 4)
(s309 5)
(s310 5)
(s311 2)
(s312 0)
(s313 4)
(s314 1992)
(s315 5)
(s316 2)
(s317 0)
(s318 1991)
(s319 5)
(s320 5)
(s321 2)
(s322 1987)
(s323 4)
(s324 5)
(s325 5)
(s326 2)
(s327 1987)
(s328 4)
(s329 5)
(s330 5)
(s331 2)
(s332 1987)
(s333 4)
(s334 5)
(s335 1992)
(s336 2)
(s337 0)
(s338 4)
(s339 5)
(s340 5)
(s341 2)
(s342 0)
(s343 1991)
(s344 5)
(s345 5)
(s346 1989)
(s347 0)
(s348 4)
(s349 5)
(s350 5)
(s351 1989)
(s352 0)
(s353 4)
(s354 5)
(s355 1992)
(s356 2)
(s357 0)
(s358 4)
(s359 5)
(s360 5)
(s361 1989)
(s362 0)
(s363 4)
(s364 5)
(s365 5)
(s366 1989)
(s367 0)
(s368 4)
(s369 5)
(s370 5)
(s371 1989)
(s372 0)
(s373 4)
(s374 5)
(s375 5)
(s376 1989)
(s377 0)
(s378 4)
(s379 5)
(s380 5)
(s381 2)
(s382 0)
(s383 4)
(s384 1992)
(s385 5)
(s386 2)
(s387 0)
(s388 1991)
(s389 5)
(s390 5)
(s391 2)
(s392 0)
(s393 1991)
(s394 5)
(s395 1992)
(s396 2)
(s397 0)
(s398 4)
(s399 5)
(s400 5)
(s401 1989)
(s402 0)
(s403 4)
(s404 5)
(s405 1992)
(s406 2)
(s407 0)
(s408 4)
(s409 5)
(s410 5)
(s411 2)
(s412 0)
(s413 1991)
(s414 5)
(s415 5)
(s416 2)
(s417 1987)
(s418 4)
(s419 5)
(s420 5)
(s421 2)
(s422 1987)
(s423 4)
(s424 5)
(s425 5)
(s426 2)
(s427 1987)
(s428 4)
(s429 5)
(s430 5)
(s431 1989)
(s432 0)
(s433 4)
(s434 5)
(s435 5)
(s436 1989)
(s437 0)
(s438 4)
(s439 5)
(s440 5)
(s441 2)
(s442 1987)
(s443 4)
(s444 5)
(s445 5)
(s446 1989)
(s447 0)
(s448 4)
(s449 5)
(s450 5)
(s451 2)
(s452 0)
(s453 4)
(s454 1992)
(s455 5)
(s456 2)
(s457 1987)
(s458 4)
(s459 5)
(s460 5)
(s461 1989)
(s462 0)
(s463 4)
(s464 5)
(s465 5)
(s466 1989)
(s467 0)
(s468 4)
(s469 5)
(s470 5)
(s471 2)
(s472 1987)
(s473 4)
(s474 5)
(s475 1992)
(s476 2)
(s477 0)
(s478 4)
(s479 5)
(s480 5)
(s481 2)
(s482 1987)
(s483 4)
(s484 5)
(s485 5)
(s486 2)
(s487 0)
(s488 1991)
(s489 5)
(s490 5)
(s491 1989)
(s492 0)
(s493 4)
(s494 5)
(s495 5)
(s496 2)
(s497 0)
(s498 4)
(s499 1992)
(s500 5)
(s501 1989)
(s502 0)
(s503 4)
(s504 5)
(s505 5)
(s506 2)
(s507 0)
(s508 4)
(s509 1992)
(s510 5)
(s511 1989)
(s512 0)
(s513 4)
(s514 5)
(s515 5)
(s516 2)
(s517 0)
(s518 1991)
(s519 5)
(s520 5)
(s521 2)
(s522 1987)
(s523 4)
(s524 5)
(s525 5)
(s526 2)
(s527 1987)
(s528 4)
(s529 5)
(s530 1992)
(s531 2)
(s532 0)
(s533 4)
(s534 5)
(s535 5)
(s536 1989)
(s537 0)
(s538 4)
(s539 5)
(s540 5)
(s541 2)
(s542 0)
(s543 1991)
(s544 5)
(s545 5)
(s546 1989)
(s547 0)
(s548 4)
(s549 5)
(s550 5)
(s551 2)
(s552 0)
(s553 4)
(s554 1992)
(s555 1992)
(s556 2)
(s557 0)
(s558 4)
(s559 5)
(s560 5)
(s561 2)
(s562 0)
(s563 1991)
(s564 5)
(s565 5)
(s566 2)
(s567 0)
(s568 1991)
(s569 5)
(s570 5)
(s571 1989)
(s572 0)
(s573 4)
(s574 5)
(s575 1992)
(s576 2)
(s577 0)
(s578 4)
(s579 5)
(s580 5)
(s581 2)
(s582 0)
(s583 1991)
(s584 5)
(s585 5)
(s586 2)
(s587 0)
(s588 1991)
(s589 5)
(s590 5)
(s591 2)
(s592 0)
(s593 1991)
(s594 5)
(s595 5)
(s596 2)
(s597 1987)
(s598 4)
(s599 5)
(s600 1992)
(s601 2)
(s602 0)
(s603 4)
(s604 5)
(s605 5)
(s606 2)
(s607 0)
(s608 4)
(s609 1992)
(s610 5)
(s611 2)
(s612 0)
(s613 4)
(s614 1992)
(s615 5)
(s616 2)
(s617 0)
(s618 4)
(s619 1992)
(s620 5)
(s621 2)
(s622 1987)
(s623 4)
(s624 5)
(s625 5)
(s626 1989)
(s627 0)
(s628 timeout
4 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/2093 variables, and 161 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/805 constraints, ReadFeed: 0/161 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 0/0 constraints]
After SMT, in 40313ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40501 ms. Remains : 805/10000 places, 1288/16001 transitions.
RANDOM walk for 42038 steps (8 resets) in 503 ms. (83 steps per ms) remains 7/8 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 7/7 properties
[2024-06-01 06:12:56] [INFO ] Invariant cache hit.
[2024-06-01 06:12:56] [INFO ] State equation strengthened by 161 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 615/775 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/775 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1240/2015 variables, 775/930 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2015 variables, 155/1085 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2015 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/2015 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2015/2093 variables, and 1085 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 155/161 constraints, State Equation: 775/805 constraints, ReadFeed: 155/161 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 615/775 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 3 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/775 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/775 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 17/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:13:02] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1240/2015 variables, 775/1008 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2015 variables, 155/1163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2015 variables, 7/1170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:13:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:13:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:13:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:13:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:13:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:13:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2015 variables, 6/1176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2015 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/2015 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2015/2093 variables, and 1176 constraints, problems are : Problem set: 0 solved, 7 unsolved in 17653 ms.
Refiners :[Positive P Invariants (semi-flows): 155/161 constraints, State Equation: 775/805 constraints, ReadFeed: 155/161 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 84/84 constraints]
After SMT, in 19045ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 322542 steps, including 0 resets, run visited all 7 properties in 9465 ms. (steps per millisecond=34 )
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 9488 ms.
All properties solved without resorting to model-checking.
Total runtime 92541 ms.
ITS solved all properties within timeout
BK_STOP 1717222404983
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-2000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-2000, 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 r504-tall-171649612000086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 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 '
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 ;