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

About the Execution of GreatSPN+red for Referendum-PT-1000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14657.012 952426.00 3133353.00 1181.20 FT??FTT??T?FT?T? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 40M
-rw-r--r-- 1 mcc users 1.4M Apr 11 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Apr 11 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 430K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 429K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7M Apr 11 22:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13M Apr 11 22:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.0M Apr 11 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 83K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Referendum-PT-1000-CTLFireability-2024-00
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-01
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-02
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-03
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-04
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-05
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-06
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-07
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-08
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-09
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-10
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-11
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-12
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-13
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-14
FORMULA_NAME Referendum-PT-1000-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716763763336

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 22:49:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 22:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:49:24] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-26 22:49:24] [INFO ] Transformed 3001 places.
[2024-05-26 22:49:24] [INFO ] Transformed 2001 transitions.
[2024-05-26 22:49:24] [INFO ] Found NUPN structural information;
[2024-05-26 22:49:24] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 161 ms.
Support contains 1001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 2000 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 3000 place count 1001 transition count 1001
Applied a total of 3000 rules in 78 ms. Remains 1001 /3001 variables (removed 2000) and now considering 1001/2001 (removed 1000) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2024-05-26 22:49:25] [INFO ] Computed 0 invariants in 25 ms
[2024-05-26 22:49:25] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-26 22:49:25] [INFO ] Invariant cache hit.
[2024-05-26 22:49:26] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
Running 1000 sub problems to find dead transitions.
[2024-05-26 22:49:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2001/2002 variables, and 2000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30046 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2001 variables, 1000/3000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2001/2002 variables, and 3000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30021 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 61004ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 61035ms
Starting structural reductions in LTL mode, iteration 1 : 1001/3001 places, 1001/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62105 ms. Remains : 1001/3001 places, 1001/2001 transitions.
Support contains 1001 out of 1001 places after structural reductions.
[2024-05-26 22:50:28] [INFO ] Flatten gal took : 350 ms
[2024-05-26 22:50:29] [INFO ] Flatten gal took : 346 ms
[2024-05-26 22:50:31] [INFO ] Input system was already deterministic with 1001 transitions.
Reduction of identical properties reduced properties to check from 59 to 53
RANDOM walk for 40000 steps (36 resets) in 4076 ms. (9 steps per ms) remains 3/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10936 ms. (3 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3653 ms. (10 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7115 ms. (5 steps per ms) remains 3/3 properties
[2024-05-26 22:50:38] [INFO ] Invariant cache hit.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp11 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 1001/1001 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 0/1001 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 2002/2002 variables, and 2002 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1083 ms.
Refiners :[Domain max(s): 1001/1001 constraints, State Equation: 1001/1001 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
After SMT solving in domain Int declared 1001/2002 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 150 ms.
Refiners :[Domain max(s): 0/1001 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4993ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-26 22:50:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-26 22:50:43] [INFO ] Flatten gal took : 149 ms
FORMULA Referendum-PT-1000-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:50:44] [INFO ] Flatten gal took : 148 ms
[2024-05-26 22:50:44] [INFO ] Input system was already deterministic with 1001 transitions.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA Referendum-PT-1000-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 5 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2024-05-26 22:50:44] [INFO ] Flatten gal took : 96 ms
[2024-05-26 22:50:44] [INFO ] Flatten gal took : 96 ms
[2024-05-26 22:50:44] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 5 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2024-05-26 22:50:44] [INFO ] Flatten gal took : 132 ms
[2024-05-26 22:50:45] [INFO ] Flatten gal took : 116 ms
[2024-05-26 22:50:45] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 999 places :
Symmetric choice reduction at 0 with 999 rule applications. Total rules 999 place count 2 transition count 2
Iterating global reduction 0 with 999 rules applied. Total rules applied 1998 place count 2 transition count 2
Applied a total of 1998 rules in 41 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 2/1001 places, 2/1001 transitions.
[2024-05-26 22:50:45] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:50:45] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:50:45] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 17 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2024-05-26 22:50:45] [INFO ] Flatten gal took : 112 ms
[2024-05-26 22:50:45] [INFO ] Flatten gal took : 119 ms
[2024-05-26 22:50:45] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 5 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2024-05-26 22:50:45] [INFO ] Flatten gal took : 105 ms
[2024-05-26 22:50:45] [INFO ] Flatten gal took : 108 ms
[2024-05-26 22:50:45] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 4 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 117 ms
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 125 ms
[2024-05-26 22:50:46] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 5 are kept as prefixes of interest. Removing 996 places using SCC suffix rule.10 ms
Discarding 996 places :
Also discarding 996 output transitions
Drop transitions (Output transitions of discarded places.) removed 996 transitions
Applied a total of 1 rules in 20 ms. Remains 5 /1001 variables (removed 996) and now considering 5/1001 (removed 996) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 5/1001 places, 5/1001 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:50:46] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 4 are kept as prefixes of interest. Removing 997 places using SCC suffix rule.2 ms
Discarding 997 places :
Also discarding 997 output transitions
Drop transitions (Output transitions of discarded places.) removed 997 transitions
Applied a total of 1 rules in 5 ms. Remains 4 /1001 variables (removed 997) and now considering 4/1001 (removed 997) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 4/1001 places, 4/1001 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:50:46] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 993 places :
Symmetric choice reduction at 0 with 993 rule applications. Total rules 993 place count 8 transition count 8
Iterating global reduction 0 with 993 rules applied. Total rules applied 1986 place count 8 transition count 8
Applied a total of 1986 rules in 27 ms. Remains 8 /1001 variables (removed 993) and now considering 8/1001 (removed 993) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 8/1001 places, 8/1001 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:50:46] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 993 places :
Symmetric choice reduction at 0 with 993 rule applications. Total rules 993 place count 8 transition count 8
Iterating global reduction 0 with 993 rules applied. Total rules applied 1986 place count 8 transition count 8
Applied a total of 1986 rules in 14 ms. Remains 8 /1001 variables (removed 993) and now considering 8/1001 (removed 993) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 8/1001 places, 8/1001 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:50:46] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 6 are kept as prefixes of interest. Removing 995 places using SCC suffix rule.2 ms
Discarding 995 places :
Also discarding 995 output transitions
Drop transitions (Output transitions of discarded places.) removed 995 transitions
Applied a total of 1 rules in 4 ms. Remains 6 /1001 variables (removed 995) and now considering 6/1001 (removed 995) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 6/1001 places, 6/1001 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:50:46] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 979 places :
Symmetric choice reduction at 0 with 979 rule applications. Total rules 979 place count 22 transition count 22
Iterating global reduction 0 with 979 rules applied. Total rules applied 1958 place count 22 transition count 22
Applied a total of 1958 rules in 14 ms. Remains 22 /1001 variables (removed 979) and now considering 22/1001 (removed 979) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 22/1001 places, 22/1001 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:50:46] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 980 places :
Symmetric choice reduction at 0 with 980 rule applications. Total rules 980 place count 21 transition count 21
Iterating global reduction 0 with 980 rules applied. Total rules applied 1960 place count 21 transition count 21
Applied a total of 1960 rules in 21 ms. Remains 21 /1001 variables (removed 980) and now considering 21/1001 (removed 980) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 21/1001 places, 21/1001 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:50:46] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-26 22:50:46] [INFO ] Flatten gal took : 157 ms
[2024-05-26 22:50:47] [INFO ] Flatten gal took : 156 ms
[2024-05-26 22:50:47] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 53 ms.
[2024-05-26 22:50:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1001 places, 1001 transitions and 2001 arcs took 6 ms.
Total runtime 83197 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Referendum-PT-1000

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 566
MODEL NAME: /home/mcc/execution/404/model
1001 places, 1001 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Referendum-PT-1000-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-1000-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-1000-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-1000-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-1000-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-1000-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-1000-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA Referendum-PT-1000-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA Referendum-PT-1000-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA Referendum-PT-1000-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA Referendum-PT-1000-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA Referendum-PT-1000-CTLFireability-2024-13 CANNOT_COMPUTE
FORMULA Referendum-PT-1000-CTLFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716764715762

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Referendum-PT-1000"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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