fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r223-tall-171649610600050
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for JoinFreeModules-PT-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12010.960 1756090.00 5207750.00 2012.30 ????T??T?F?FFT?? 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.r223-tall-171649610600050.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 JoinFreeModules-PT-0100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.7K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 11 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 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 304K 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-0100-CTLFireability-2024-00
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-01
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-02
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-03
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-04
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-05
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-06
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-07
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-08
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-09
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-10
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2024-11
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2023-12
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2023-13
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2023-14
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716498327052

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 21:05:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 21:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:05:28] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-23 21:05:28] [INFO ] Transformed 501 places.
[2024-05-23 21:05:28] [INFO ] Transformed 801 transitions.
[2024-05-23 21:05:28] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 42 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
// Phase 1: matrix 801 rows 500 cols
[2024-05-23 21:05:28] [INFO ] Computed 100 invariants in 24 ms
[2024-05-23 21:05:28] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 87.0)
(s3 4.0)
(s4 5.0)
(s5 92.0)
(s6 2.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s12 0.0)
(s13 4.0)
(s14 92.0)
(s15 5.0)
(s16 2.0)
(s17 87.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 87.0)
(s23 4.0)
(s24 5.0)
(s25 92.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 89.0)
(s32 0.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 89.0)
(s37 0.0)
(s38 4.0)
(s39 5.0)
(s40 92.0)
(s41 2.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 89.0)
(s47 0.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 89.0)
(s52 0.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 91.0)
(s59 5.0)
(s60 92.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 92.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 89.0)
(s72 0.0)
(s73 4.0)
(s74 5.0)
(s75 92.0)
(s76 2.0)
(s77 0.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s82 87.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 89.0)
(s87 0.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 89.0)
(s92 0.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s97 0.0)
(s98 91.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 92.0)
(s105 5.0)
(s106 89.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s112 87.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 0.0)
(s118 4.0)
(s119 92.0)
(s120 92.0)
(s121 2.0)
(s122 0.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s127 0.0)
(s128 91.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s137 0.0)
(s138 4.0)
(s139 92.0)
(s140 5.0)
(s141 2.0)
(s142 87.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s147 87.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s152 0.0)
(s153 91.0)
(s154 5.0)
(s155 92.0)
(s156 2.0)
(s157 0.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s162 0.0)
(s163 91.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s167 0.0)
(s168 91.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 87.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s177 87.0)
(s178 4.0)
(s179 5.0)
(s180 92.0)
(s181 2.0)
(s182 0.0)
(s183 4.0)
(s184 5.0)
(s185 92.0)
(s186 2.0)
(s187 0.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 0.0)
(s193 4.0)
(s194 92.0)
(s195 5.0)
(s196 89.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 92.0)
(s201 2.0)
(s202 0.0)
(s203 4.0)
(s204 5.0)
(s205 92.0)
(s206 2.0)
(s207 0.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 89.0)
(s212 0.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s217 87.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s222 0.0)
(s223 4.0)
(s224 92.0)
(s225 92.0)
(s226 2.0)
(s227 0.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s232 0.0)
(s233 4.0)
(s234 92.0)
(s235 5.0)
(s236 2.0)
(s237 87.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s242 0.0)
(s243 91.0)
(s244 5.0)
(s245 5.0)
(s246 89.0)
(s247 0.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s252 87.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s257 0.0)
(s258 91.0)
(s259 5.0)
(s260 5.0)
(s261 89.0)
(s262 0.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 89.0)
(s267 0.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 0.0)
(s273 91.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 0.0)
(s278 91.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s282 0.0)
(s283 4.0)
(s284 92.0)
(s285 5.0)
(s286 2.0)
(s287 87.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s292 0.0)
(s293 4.0)
(s294 92.0)
(s295 5.0)
(s296 89.0)
(s297 0.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 87.0)
(s302 0.0)
(s303 4.0)
(s304 7.0)
(s305 5.0)
(s306 2.0)
(s307 87.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s312 87.0)
(s313 4.0)
(s314 5.0)
(s315 timeout
5.0)
(s316 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20268ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20308ms
[2024-05-23 21:05:48] [INFO ] Invariant cache hit.
[2024-05-23 21:05:49] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-23 21:05:49] [INFO ] Invariant cache hit.
[2024-05-23 21:05:49] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-23 21:05:49] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:05:49] [INFO ] Invariant cache hit.
[2024-05-23 21:05:49] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 89.0)
(s2 0.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 89.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s12 0.0)
(s13 48.0)
(s14 48.0)
(s15 5.0)
(s16 2.0)
(s17 87.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 92.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 92.0)
(s35 5.0)
(s36 2.0)
(s37 86.0)
(s38 5.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 89.0)
(s52 0.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 87.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 92.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 86.0)
(s73 5.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 87.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 89.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 87.0)
(s92 0.0)
(s93 4.0)
(s94 7.0)
(s95 5.0)
(s96 2.0)
(s97 86.0)
(s98 5.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 92.0)
(s105 5.0)
(s106 2.0)
(s107 86.0)
(s108 5.0)
(s109 5.0)
(s110 5.0)
(s111 89.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 86.0)
(s118 5.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 86.0)
(s123 5.0)
(s124 5.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 92.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 48.0)
(s149 48.0)
(s150 5.0)
(s151 2.0)
(s152 0.0)
(s153 4.0)
(s154 92.0)
(s155 5.0)
(s156 88.0)
(s157 0.0)
(s158 5.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s162 86.0)
(s163 5.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s167 87.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 87.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 89.0)
(s177 0.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 89.0)
(s182 0.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 86.0)
(s188 5.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 87.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 89.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s202 86.0)
(s203 5.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s207 87.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s212 0.0)
(s213 4.0)
(s214 92.0)
(s215 5.0)
(s216 89.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s222 0.0)
(s223 48.0)
(s224 48.0)
(s225 5.0)
(s226 2.0)
(s227 87.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 89.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 87.0)
(s237 0.0)
(s238 4.0)
(s239 7.0)
(s240 5.0)
(s241 2.0)
(s242 0.0)
(s243 4.0)
(s244 92.0)
(s245 5.0)
(s246 89.0)
(s247 0.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 88.0)
(s252 0.0)
(s253 5.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s257 87.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 87.0)
(s262 0.0)
(s263 4.0)
(s264 7.0)
(s265 5.0)
(s266 89.0)
(s267 0.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 87.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 87.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s282 87.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 89.0)
(s287 0.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 87.0)
(s292 0.0)
(s293 4.0)
(s294 7.0)
(s295 5.0)
(s296 2.0)
(s297 0.0)
(s298 4.0)
(s299 92.0)
(s300 5.0)
(s301 2.0)
(s302 86.0)
(s303 5.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s307 86.0)
(s308 5.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s312 87.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 89.0)
(s317 0.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s322 87.0)
(s323 4.0)
(s324 5.0)
(s325 (/ 77.0 16.0))
(s326 (/ 1427.0 16.0))
(s327 0.0)
(s328 4.0)
(s329 5.0)
(s330 (/ 77.0 16.0))
(s331 2.0)
(s332 (/ 1379.0 16.0))
(s333 5.0)
(s334 5.0)
(s335 (/ 77.0 16.0))
(s336 2.0)
(s337 0.0)
(s338 4.0)
(s339 (/ 1475.0 16.0))
(s340 (/ 77.0 16.0))
(s341 2.0)
(s342 (/ 1379.0 16.0))
(s343 5.0)
(s344 5.0)
(s345 (/ 77.0 16.0))
(s346 2.0)
(s347 (/ 1395.0 16.0))
(s348 4.0)
(s349 5.0)
(s350 (/ 77.0 16.0))
(s351 (/ 1411.0 16.0))
(s352 0.0)
(s353 5.0)
(s354 5.0)
(s355 (/ 77.0 16.0))
(s356 (/ 1427.0 16.0))
(s357 0.0)
(s358 4.0)
(s359 5.0)
(s360 (/ 77.0 16.0))
(s361 (/ 1427.0 16.0))
(s362 0.0)
(s363 4.0)
(s364 5.0)
(s365 (/ 77.0 16.0))
(s366 2.0)
(s367 0.0)
(s368 4.0)
(s369 (/ 1475.0 16.0))
(s370 (/ 77.0 16.0))
(s371 (/ 699.0 8.0))
(s372 0.0)
(s373 4.0)
(s374 (/ 109.0 16.0))
(s375 (/ 77.0 16.0))
(s376 2.0)
(s377 0.0)
(s378 4.0)
(s379 (/ 1475.0 16.0))
(s380 (/ 77.0 16.0))
(s381 2.0)
(s382 (/ 1379.0 16.0))
(s383 5.0)
(s384 5.0)
(s385 (/ 77.0 16.0))
(s386 (/ 699.0 8.0))
(s387 0.0)
(s388 timeout
4.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-23 21:06:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 8 ms to minimize.
[2024-05-23 21:06:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2024-05-23 21:06:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:06:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 21:06:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 5 ms to minimize.
[2024-05-23 21:06:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Finished structural reductions in LTL mode , in 1 iterations and 81023 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 76 out of 500 places after structural reductions.
[2024-05-23 21:06:49] [INFO ] Flatten gal took : 70 ms
[2024-05-23 21:06:49] [INFO ] Flatten gal took : 36 ms
[2024-05-23 21:06:49] [INFO ] Input system was already deterministic with 801 transitions.
RANDOM walk for 40158 steps (8 resets) in 653 ms. (61 steps per ms) remains 8/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 2/3 properties
[2024-05-23 21:06:50] [INFO ] Invariant cache hit.
[2024-05-23 21:06:50] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:06:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 21:06:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 21:06:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/1301 variables, and 24 constraints, problems are : Problem set: 0 solved, 2 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/1301 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 29 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 7 ms.
[2024-05-23 21:06:51] [INFO ] Flatten gal took : 30 ms
[2024-05-23 21:06:51] [INFO ] Flatten gal took : 29 ms
[2024-05-23 21:06:51] [INFO ] Input system was already deterministic with 801 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 45 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:06:51] [INFO ] Invariant cache hit.
[2024-05-23 21:06:51] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20110ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20116ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20163 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:07:11] [INFO ] Flatten gal took : 36 ms
[2024-05-23 21:07:11] [INFO ] Flatten gal took : 23 ms
[2024-05-23 21:07:11] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:07:11] [INFO ] Invariant cache hit.
[2024-05-23 21:07:11] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20102ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20107ms
Finished structural reductions in LTL mode , in 1 iterations and 20120 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:07:31] [INFO ] Flatten gal took : 21 ms
[2024-05-23 21:07:31] [INFO ] Flatten gal took : 21 ms
[2024-05-23 21:07:31] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 28 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:07:31] [INFO ] Invariant cache hit.
[2024-05-23 21:07:31] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20092ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20098ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20127 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:07:51] [INFO ] Flatten gal took : 22 ms
[2024-05-23 21:07:51] [INFO ] Flatten gal took : 31 ms
[2024-05-23 21:07:51] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:07:52] [INFO ] Invariant cache hit.
[2024-05-23 21:07:52] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20094ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20100ms
Finished structural reductions in LTL mode , in 1 iterations and 20111 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:08:12] [INFO ] Flatten gal took : 20 ms
[2024-05-23 21:08:12] [INFO ] Flatten gal took : 17 ms
[2024-05-23 21:08:12] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:08:12] [INFO ] Invariant cache hit.
[2024-05-23 21:08:12] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20087ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20093ms
Finished structural reductions in LTL mode , in 1 iterations and 20101 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:08:32] [INFO ] Flatten gal took : 18 ms
[2024-05-23 21:08:32] [INFO ] Flatten gal took : 18 ms
[2024-05-23 21:08:32] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:08:32] [INFO ] Invariant cache hit.
[2024-05-23 21:08:32] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20103ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20109ms
Finished structural reductions in LTL mode , in 1 iterations and 20127 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:08:52] [INFO ] Flatten gal took : 16 ms
[2024-05-23 21:08:52] [INFO ] Flatten gal took : 16 ms
[2024-05-23 21:08:52] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:08:52] [INFO ] Invariant cache hit.
[2024-05-23 21:08:52] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20086ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20091ms
Finished structural reductions in LTL mode , in 1 iterations and 20097 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:09:12] [INFO ] Flatten gal took : 16 ms
[2024-05-23 21:09:12] [INFO ] Flatten gal took : 15 ms
[2024-05-23 21:09:12] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:09:12] [INFO ] Invariant cache hit.
[2024-05-23 21:09:12] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20100ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20106ms
Finished structural reductions in LTL mode , in 1 iterations and 20112 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:09:32] [INFO ] Flatten gal took : 25 ms
[2024-05-23 21:09:32] [INFO ] Flatten gal took : 15 ms
[2024-05-23 21:09:32] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:09:32] [INFO ] Invariant cache hit.
[2024-05-23 21:09:32] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20087ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20093ms
Finished structural reductions in LTL mode , in 1 iterations and 20098 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:09:53] [INFO ] Flatten gal took : 15 ms
[2024-05-23 21:09:53] [INFO ] Flatten gal took : 15 ms
[2024-05-23 21:09:53] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:09:53] [INFO ] Invariant cache hit.
[2024-05-23 21:09:53] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 89.0)
(s2 0.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s7 0.0)
(s8 91.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s12 0.0)
(s13 91.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s17 87.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 92.0)
(s25 5.0)
(s26 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20087ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20092ms
Finished structural reductions in LTL mode , in 1 iterations and 20097 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:10:13] [INFO ] Flatten gal took : 17 ms
[2024-05-23 21:10:13] [INFO ] Flatten gal took : 14 ms
[2024-05-23 21:10:13] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-05-23 21:10:13] [INFO ] Invariant cache hit.
[2024-05-23 21:10:13] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20090ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20095ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20115 ms. Remains : 500/500 places, 801/801 transitions.
[2024-05-23 21:10:33] [INFO ] Flatten gal took : 14 ms
[2024-05-23 21:10:33] [INFO ] Flatten gal took : 14 ms
[2024-05-23 21:10:33] [INFO ] Input system was already deterministic with 801 transitions.
[2024-05-23 21:10:33] [INFO ] Flatten gal took : 15 ms
[2024-05-23 21:10:33] [INFO ] Flatten gal took : 14 ms
[2024-05-23 21:10:33] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-23 21:10:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 500 places, 801 transitions and 2300 arcs took 12 ms.
Total runtime 305307 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-0100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 500
TRANSITIONS: 801
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.004s]


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


----------------------------------------------------------------------
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: 650
MODEL NAME: /home/mcc/execution/412/model
500 places, 801 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 JoinFreeModules-PT-0100-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0100-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716500083142

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-0100"
export BK_EXAMINATION="CTLFireability"
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 JoinFreeModules-PT-0100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649610600050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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