MCC'2024- Execution of r516-tajo-171654446900322

About the Execution of LTSMin+red for PolyORBLF-PT-S06J04T06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
9163.084	954992.00	1172774.00	197.80	F???????FF???F?T	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446900322.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S06J04T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446900322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 25K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 329K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 160K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 538K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717255589423

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:26:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:26:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:26:31] [INFO ] Load time of PNML (sax parser for PT used): 552 ms
[2024-06-01 15:26:31] [INFO ] Transformed 632 places.
[2024-06-01 15:26:31] [INFO ] Transformed 10500 transitions.
[2024-06-01 15:26:31] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 814 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
[2024-06-01 15:26:31] [INFO ] Reduced 960 identical enabling conditions.
[2024-06-01 15:26:31] [INFO ] Reduced 960 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 398 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Applied a total of 0 rules in 78 ms. Remains 632 /632 variables (removed 0) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-06-01 15:26:31] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-06-01 15:26:32] [INFO ] Computed 54 invariants in 174 ms
[2024-06-01 15:26:32] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/3026 variables, and 37 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/37 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2424/1170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 122 places in 184 ms of which 28 ms to minimize.
[2024-06-01 15:27:13] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 3)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 9)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 4)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 4)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 3)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 4)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 3)
(s146 2)
(s147 2)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 4)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 10)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 4)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 1)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 2)
(s214 0)
(s215 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 3)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 1)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 6)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 2)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 1)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 4)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 2)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 1)
(s347 1)
(s348 0)
(s349 1)
(s350 1)
(s351 0)
(s352 2)
(s353 0)
(s354 0)
(s355 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/3026 variables, and 39 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/37 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1170 constraints, Known Traps: 2/2 constraints]
After SMT, in 58592ms problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 58677ms
[2024-06-01 15:27:30] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 15:27:30] [INFO ] Invariant cache hit.
[2024-06-01 15:27:30] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-01 15:27:30] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 15:27:30] [INFO ] Invariant cache hit.
[2024-06-01 15:27:32] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:27:42] [INFO ] Implicit Places using invariants and state equation in 11718 ms returned []
Implicit Place search using SMT with State Equation took 12094 ms to find 0 implicit places.
Running 2424 sub problems to find dead transitions.
[2024-06-01 15:27:42] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 15:27:42] [INFO ] Invariant cache hit.
[2024-06-01 15:27:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 15:28:22] [INFO ] Deduced a trap composed of 123 places in 178 ms of which 4 ms to minimize.
[2024-06-01 15:28:23] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s3 0.0)
(s4 1.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 3.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 9.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 4.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 4.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 3.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 4.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 3.0)
(s146 2.0)
(s147 2.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 4.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 10.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 4.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 2.0)
(s214 0.0)
(s215 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 3.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 4.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 2.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 4.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 2.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 2.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 4.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 2.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 2.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 3.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 2.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 1.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 2.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 3.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 4.0)
(s518 0.0)
(s519 4.0)
(s520 0.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/3026 variables, and 39 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/37 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2424/1170 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 15:28:35] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 3 ms to minimize.
[2024-06-01 15:28:35] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:28:35] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:28:35] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:28:40] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/3026 variables, and 44 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/37 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1170 constraints, Known Traps: 7/7 constraints]
After SMT, in 80519ms problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 80552ms
Finished structural reductions in LTL mode , in 1 iterations and 151467 ms. Remains : 632/632 places, 2430/2430 transitions.
Support contains 398 out of 632 places after structural reductions.
[2024-06-01 15:29:03] [INFO ] Flatten gal took : 446 ms
[2024-06-01 15:29:04] [INFO ] Flatten gal took : 159 ms
[2024-06-01 15:29:04] [INFO ] Input system was already deterministic with 2430 transitions.
Support contains 392 out of 632 places (down from 398) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 79
RANDOM walk for 40000 steps (252 resets) in 2976 ms. (13 steps per ms) remains 36/79 properties
BEST_FIRST walk for 4001 steps (11 resets) in 61 ms. (64 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 74 ms. (53 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (11 resets) in 189 ms. (21 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (9 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 45 ms. (86 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (17 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 481 ms. (8 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (9 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
[2024-06-01 15:29:06] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 15:29:06] [INFO ] Invariant cache hit.
[2024-06-01 15:29:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 2 (OVERLAPS) 129/176 variables, 8/9 constraints. Problems are: Problem set: 21 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 21 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 12/188 variables, 3/12 constraints. Problems are: Problem set: 21 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 21 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 27/215 variables, 1/13 constraints. Problems are: Problem set: 21 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 21 solved, 15 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 8 (OVERLAPS) 400/615 variables, 29/42 constraints. Problems are: Problem set: 33 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/42 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/622 variables, 3/45 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 0/45 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8/630 variables, 8/53 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/630 variables, 0/53 constraints. Problems are: Problem set: 33 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3024/3026 variables, and 683 constraints, problems are : Problem set: 33 solved, 3 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 630/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 36/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 33 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 76/84 variables, 4/4 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/104 variables, 4/8 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 74/178 variables, 4/12 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 426/604 variables, 23/35 constraints. Problems are: Problem set: 33 solved, 3 unsolved
[2024-06-01 15:29:13] [INFO ] Deduced a trap composed of 86 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:29:13] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:29:14] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:29:14] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 4/39 constraints. Problems are: Problem set: 33 solved, 3 unsolved
[2024-06-01 15:29:14] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:29:14] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 2/41 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/41 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 8/612 variables, 4/45 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/45 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 18/630 variables, 14/59 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/630 variables, 0/59 constraints. Problems are: Problem set: 33 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3024/3026 variables, and 689 constraints, problems are : Problem set: 33 solved, 3 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 630/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 11784ms problems are : Problem set: 33 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 626 transition count 2382
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 102 place count 578 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 102 place count 578 transition count 2310
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 246 place count 506 transition count 2310
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 390 place count 434 transition count 2238
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 406 place count 434 transition count 2222
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 422 place count 418 transition count 2222
Applied a total of 422 rules in 513 ms. Remains 418 /632 variables (removed 214) and now considering 2222/2430 (removed 208) transitions.
Running 2216 sub problems to find dead transitions.
[2024-06-01 15:29:18] [INFO ] Flow matrix only has 2186 transitions (discarded 36 similar events)
// Phase 1: matrix 2186 rows 418 cols
[2024-06-01 15:29:19] [INFO ] Computed 48 invariants in 62 ms
[2024-06-01 15:29:19] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/2604 variables, and 39 constraints, problems are : Problem set: 0 solved, 2216 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/418 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2216/884 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
[2024-06-01 15:30:06] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 1 ms to minimize.
[2024-06-01 15:30:06] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:30:07] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:30:07] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/2604 variables, and 43 constraints, problems are : Problem set: 0 solved, 2216 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/418 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1332/884 constraints, Known Traps: 6/6 constraints]
After SMT, in 63433ms problems are : Problem set: 0 solved, 2216 unsolved
Search for dead transitions found 0 dead transitions in 63473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63996 ms. Remains : 418/632 places, 2222/2430 transitions.
RANDOM walk for 40000 steps (476 resets) in 1165 ms. (34 steps per ms) remains 0/3 properties
Successfully simplified 33 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:30:23] [INFO ] Flatten gal took : 196 ms
[2024-06-01 15:30:23] [INFO ] Flatten gal took : 196 ms
[2024-06-01 15:30:23] [INFO ] Input system was already deterministic with 2430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 626 transition count 2382
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 578 transition count 2376
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 108 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 252 place count 500 transition count 2304
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 384 place count 434 transition count 2238
Applied a total of 384 rules in 238 ms. Remains 434 /632 variables (removed 198) and now considering 2238/2430 (removed 192) transitions.
Running 2232 sub problems to find dead transitions.
[2024-06-01 15:30:24] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 434 cols
[2024-06-01 15:30:24] [INFO ] Computed 48 invariants in 37 ms
[2024-06-01 15:30:24] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 15:30:57] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:30:58] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/2636 variables, and 39 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 15:31:07] [INFO ] Deduced a trap composed of 53 places in 378 ms of which 1 ms to minimize.
[2024-06-01 15:31:07] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 1 ms to minimize.
[2024-06-01 15:31:07] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:31:07] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:31:11] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:31:11] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:31:12] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:31:13] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/2636 variables, and 47 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 10/10 constraints]
After SMT, in 60585ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 60607ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60863 ms. Remains : 434/632 places, 2238/2430 transitions.
[2024-06-01 15:31:24] [INFO ] Flatten gal took : 93 ms
[2024-06-01 15:31:24] [INFO ] Flatten gal took : 102 ms
[2024-06-01 15:31:25] [INFO ] Input system was already deterministic with 2238 transitions.
RANDOM walk for 100 steps (2 resets) in 6 ms. (14 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J04T06-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 159 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:31:25] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-06-01 15:31:25] [INFO ] Computed 48 invariants in 43 ms
[2024-06-01 15:31:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:32:13] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 83 places in 493 ms of which 4 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 83 places in 434 ms of which 2 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 4 ms to minimize.
[2024-06-01 15:32:19] [INFO ] Deduced a trap composed of 47 places in 464 ms of which 3 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 112 places in 212 ms of which 8 ms to minimize.
[2024-06-01 15:32:27] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 68468ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 68499ms
Finished structural reductions in LTL mode , in 1 iterations and 68669 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 15:32:33] [INFO ] Flatten gal took : 95 ms
[2024-06-01 15:32:33] [INFO ] Flatten gal took : 94 ms
[2024-06-01 15:32:34] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 500 transition count 2304
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 324 place count 464 transition count 2268
Applied a total of 324 rules in 162 ms. Remains 464 /632 variables (removed 168) and now considering 2268/2430 (removed 162) transitions.
Running 2262 sub problems to find dead transitions.
[2024-06-01 15:32:34] [INFO ] Flow matrix only has 2232 transitions (discarded 36 similar events)
// Phase 1: matrix 2232 rows 464 cols
[2024-06-01 15:32:34] [INFO ] Computed 48 invariants in 37 ms
[2024-06-01 15:32:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-06-01 15:33:12] [INFO ] Deduced a trap composed of 174 places in 369 ms of which 3 ms to minimize.
[2024-06-01 15:33:12] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 1 ms to minimize.
[2024-06-01 15:33:13] [INFO ] Deduced a trap composed of 63 places in 337 ms of which 2 ms to minimize.
[2024-06-01 15:33:15] [INFO ] Deduced a trap composed of 114 places in 285 ms of which 2 ms to minimize.
[2024-06-01 15:33:15] [INFO ] Deduced a trap composed of 91 places in 306 ms of which 2 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 8.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 2.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 6.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 2.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 3.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s187 0.0)
(s188 0.0)
(s189 2.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 2.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 2.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 2.0)
(s431 1.0)
(s432 1.0)
(s433 0.0)
(s434 4.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s443 1.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/2696 variables, and 47 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2262/1008 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-06-01 15:33:23] [INFO ] Deduced a trap composed of 150 places in 429 ms of which 2 ms to minimize.
[2024-06-01 15:33:28] [INFO ] Deduced a trap composed of 168 places in 325 ms of which 2 ms to minimize.
[2024-06-01 15:33:30] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 4 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 75 places in 387 ms of which 3 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 62 places in 396 ms of which 3 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/2696 variables, and 55 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 24/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1008 constraints, Known Traps: 14/14 constraints]
After SMT, in 63616ms problems are : Problem set: 0 solved, 2262 unsolved
Search for dead transitions found 0 dead transitions in 63647ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 63815 ms. Remains : 464/632 places, 2268/2430 transitions.
[2024-06-01 15:33:38] [INFO ] Flatten gal took : 142 ms
[2024-06-01 15:33:38] [INFO ] Flatten gal took : 125 ms
[2024-06-01 15:33:38] [INFO ] Input system was already deterministic with 2268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Applied a total of 6 rules in 42 ms. Remains 626 /632 variables (removed 6) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-06-01 15:33:38] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 626 cols
[2024-06-01 15:33:38] [INFO ] Computed 48 invariants in 89 ms
[2024-06-01 15:33:38] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 15:34:23] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/3020 variables, and 38 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/626 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2424/1170 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 15:34:26] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 4 ms to minimize.
[2024-06-01 15:34:32] [INFO ] Deduced a trap composed of 15 places in 489 ms of which 3 ms to minimize.
[2024-06-01 15:34:32] [INFO ] Deduced a trap composed of 72 places in 397 ms of which 2 ms to minimize.
[2024-06-01 15:34:33] [INFO ] Deduced a trap composed of 35 places in 343 ms of which 2 ms to minimize.
[2024-06-01 15:34:33] [INFO ] Deduced a trap composed of 86 places in 350 ms of which 2 ms to minimize.
[2024-06-01 15:34:33] [INFO ] Deduced a trap composed of 47 places in 357 ms of which 2 ms to minimize.
[2024-06-01 15:34:34] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:34:34] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/3020 variables, and 46 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/626 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1170 constraints, Known Traps: 9/9 constraints]
After SMT, in 64841ms problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 64871ms
Finished structural reductions in LTL mode , in 1 iterations and 64919 ms. Remains : 626/632 places, 2430/2430 transitions.
[2024-06-01 15:34:43] [INFO ] Flatten gal took : 80 ms
[2024-06-01 15:34:43] [INFO ] Flatten gal took : 89 ms
[2024-06-01 15:34:43] [INFO ] Input system was already deterministic with 2430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Applied a total of 0 rules in 30 ms. Remains 632 /632 variables (removed 0) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-06-01 15:34:43] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-06-01 15:34:44] [INFO ] Computed 54 invariants in 43 ms
[2024-06-01 15:34:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 15:35:27] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:35:28] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
SMT process timed out in 44622ms, After SMT, problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 44662ms
Finished structural reductions in LTL mode , in 1 iterations and 44698 ms. Remains : 632/632 places, 2430/2430 transitions.
[2024-06-01 15:35:28] [INFO ] Flatten gal took : 99 ms
[2024-06-01 15:35:28] [INFO ] Flatten gal took : 168 ms
[2024-06-01 15:35:29] [INFO ] Input system was already deterministic with 2430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 121 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:35:29] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-06-01 15:35:29] [INFO ] Computed 48 invariants in 85 ms
[2024-06-01 15:35:29] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:36:12] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:36:15] [INFO ] Deduced a trap composed of 83 places in 475 ms of which 3 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 83 places in 578 ms of which 2 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:36:19] [INFO ] Deduced a trap composed of 47 places in 525 ms of which 2 ms to minimize.
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 1 ms to minimize.
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:36:21] [INFO ] Deduced a trap composed of 112 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:36:27] [INFO ] Deduced a trap composed of 110 places in 176 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 63926ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 63962ms
Finished structural reductions in LTL mode , in 1 iterations and 64092 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 15:36:33] [INFO ] Flatten gal took : 81 ms
[2024-06-01 15:36:33] [INFO ] Flatten gal took : 85 ms
[2024-06-01 15:36:33] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 80 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:36:33] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:36:33] [INFO ] Invariant cache hit.
[2024-06-01 15:36:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:37:14] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:37:18] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:37:19] [INFO ] Deduced a trap composed of 85 places in 609 ms of which 3 ms to minimize.
[2024-06-01 15:37:20] [INFO ] Deduced a trap composed of 41 places in 504 ms of which 2 ms to minimize.
[2024-06-01 15:37:20] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:37:20] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:37:20] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:37:24] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:37:33] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 46 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 63277ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 63304ms
Finished structural reductions in LTL mode , in 1 iterations and 63390 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 15:37:37] [INFO ] Flatten gal took : 92 ms
[2024-06-01 15:37:37] [INFO ] Flatten gal took : 91 ms
[2024-06-01 15:37:37] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 78 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:37:37] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:37:37] [INFO ] Invariant cache hit.
[2024-06-01 15:37:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:38:15] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 85 places in 475 ms of which 3 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 41 places in 402 ms of which 3 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:38:26] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:38:34] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 3)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 4)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 3)
(s143 2)
(s144 2)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 4)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 10)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 4)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 1)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 2)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 3)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 6)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 2)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 4)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 2)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 46 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 60982ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61006ms
Finished structural reductions in LTL mode , in 1 iterations and 61090 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 15:38:38] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:38:38] [INFO ] Flatten gal took : 85 ms
[2024-06-01 15:38:38] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 626 transition count 2382
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 578 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 96 place count 578 transition count 2310
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 240 place count 506 transition count 2310
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 384 place count 434 transition count 2238
Applied a total of 384 rules in 118 ms. Remains 434 /632 variables (removed 198) and now considering 2238/2430 (removed 192) transitions.
Running 2232 sub problems to find dead transitions.
[2024-06-01 15:38:39] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 434 cols
[2024-06-01 15:38:39] [INFO ] Computed 48 invariants in 28 ms
[2024-06-01 15:38:39] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 15:39:11] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:39:12] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2024-06-01 15:39:16] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/2636 variables, and 40 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 23/33 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 35 places in 439 ms of which 2 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 53 places in 410 ms of which 2 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/2636 variables, and 46 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 23/33 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 9/9 constraints]
After SMT, in 60729ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 60752ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60876 ms. Remains : 434/632 places, 2238/2430 transitions.
[2024-06-01 15:39:39] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:39:39] [INFO ] Flatten gal took : 85 ms
[2024-06-01 15:39:40] [INFO ] Input system was already deterministic with 2238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 61 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:39:40] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-06-01 15:39:40] [INFO ] Computed 48 invariants in 37 ms
[2024-06-01 15:39:40] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:40:19] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:40:23] [INFO ] Deduced a trap composed of 83 places in 453 ms of which 2 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 83 places in 420 ms of which 3 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 47 places in 464 ms of which 2 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:40:29] [INFO ] Deduced a trap composed of 112 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 110 places in 170 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 61265ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61288ms
Finished structural reductions in LTL mode , in 1 iterations and 61354 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 15:40:41] [INFO ] Flatten gal took : 81 ms
[2024-06-01 15:40:41] [INFO ] Flatten gal took : 90 ms
[2024-06-01 15:40:41] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 69 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:40:41] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:40:41] [INFO ] Invariant cache hit.
[2024-06-01 15:40:41] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:41:20] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 85 places in 444 ms of which 2 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 41 places in 538 ms of which 4 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:41:26] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:41:37] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 46 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 60624ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60649ms
Finished structural reductions in LTL mode , in 1 iterations and 60723 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 15:41:42] [INFO ] Flatten gal took : 72 ms
[2024-06-01 15:41:42] [INFO ] Flatten gal took : 78 ms
[2024-06-01 15:41:42] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 59 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:41:42] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:41:42] [INFO ] Invariant cache hit.
[2024-06-01 15:41:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:42:20] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 15 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 2 ms to minimize.
SMT process timed out in 40419ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 40441ms
Finished structural reductions in LTL mode , in 1 iterations and 40505 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 15:42:23] [INFO ] Flatten gal took : 72 ms
[2024-06-01 15:42:23] [INFO ] Flatten gal took : 95 ms
[2024-06-01 15:42:23] [INFO ] Input system was already deterministic with 2418 transitions.
[2024-06-01 15:42:23] [INFO ] Flatten gal took : 87 ms
[2024-06-01 15:42:23] [INFO ] Flatten gal took : 103 ms
[2024-06-01 15:42:24] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2024-06-01 15:42:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 632 places, 2430 transitions and 14880 arcs took 14 ms.
Total runtime 953435 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLFireability-2024-14

BK_STOP 1717256544415

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1035/ctl_0_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1035/ctl_1_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1035/ctl_2_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1035/ctl_3_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1035/ctl_4_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1035/ctl_5_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1035/ctl_6_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1035/ctl_7_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1035/ctl_8_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1035/ctl_9_
ctl formula name PolyORBLF-PT-S06J04T06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1035/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T06"
export BK_EXAMINATION="CTLFireability"
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 PolyORBLF-PT-S06J04T06, 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 r516-tajo-171654446900322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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