fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699200579
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15780.570 3600000.00 3612254.00 229974.70 ????FTF??F?????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200579.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200579
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 161K Mar 24 05:37 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 BusinessProcesses-PT-17-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589256381345

[2020-05-12 04:06:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 04:06:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:06:25] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2020-05-12 04:06:25] [INFO ] Transformed 650 places.
[2020-05-12 04:06:25] [INFO ] Transformed 580 transitions.
[2020-05-12 04:06:25] [INFO ] Found NUPN structural information;
[2020-05-12 04:06:25] [INFO ] Parsed PT model containing 650 places and 580 transitions in 808 ms.
Deduced a syphon composed of 4 places in 26 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 82 ms.
Incomplete random walk after 100000 steps, including 659 resets, run finished after 450 ms. (steps per millisecond=222 ) properties seen :[1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0]
// Phase 1: matrix 576 rows 646 cols
[2020-05-12 04:06:26] [INFO ] Computed 108 place invariants in 42 ms
[2020-05-12 04:06:26] [INFO ] [Real]Absence check using 62 positive place invariants in 92 ms returned sat
[2020-05-12 04:06:26] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 45 ms returned sat
[2020-05-12 04:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:06:27] [INFO ] [Real]Absence check using state equation in 1218 ms returned sat
[2020-05-12 04:06:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:06:28] [INFO ] [Nat]Absence check using 62 positive place invariants in 235 ms returned sat
[2020-05-12 04:06:28] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 175 ms returned sat
[2020-05-12 04:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:06:30] [INFO ] [Nat]Absence check using state equation in 2085 ms returned sat
[2020-05-12 04:06:31] [INFO ] Deduced a trap composed of 11 places in 523 ms
[2020-05-12 04:06:32] [INFO ] Deduced a trap composed of 17 places in 715 ms
[2020-05-12 04:06:32] [INFO ] Deduced a trap composed of 15 places in 270 ms
[2020-05-12 04:06:34] [INFO ] Deduced a trap composed of 19 places in 1789 ms
[2020-05-12 04:06:35] [INFO ] Deduced a trap composed of 21 places in 1241 ms
[2020-05-12 04:06:36] [INFO ] Deduced a trap composed of 16 places in 1334 ms
[2020-05-12 04:06:37] [INFO ] Deduced a trap composed of 120 places in 476 ms
[2020-05-12 04:06:37] [INFO ] Deduced a trap composed of 25 places in 288 ms
[2020-05-12 04:06:41] [INFO ] Deduced a trap composed of 26 places in 3324 ms
[2020-05-12 04:06:41] [INFO ] Deduced a trap composed of 22 places in 376 ms
[2020-05-12 04:06:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 10863 ms
[2020-05-12 04:06:41] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 68 ms.
[2020-05-12 04:06:48] [INFO ] Added : 420 causal constraints over 86 iterations in 6534 ms. Result :sat
[2020-05-12 04:06:48] [INFO ] Deduced a trap composed of 150 places in 237 ms
[2020-05-12 04:06:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s41 s42 s50 s51 s54 s55 s83 s84 s85 s96 s98 s106 s109 s110 s111 s125 s131 s143 s144 s145 s157 s158 s168 s171 s172 s214 s215 s216 s238 s239 s240 s259 s262 s302 s307 s312 s317 s322 s330 s332 s336 s341 s351 s356 s361 s371 s376 s386 s391 s416 s421 s426 s431 s436 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s490 s491 s503 s504 s505 s506 s507 s508 s515 s516 s517 s518 s519 s523 s524 s527 s528 s529 s542 s543 s544 s545 s552 s553 s556 s557 s558 s559 s562 s563 s564 s565 s566 s567 s570 s571 s572 s573 s574 s581 s582 s585 s586 s589 s590 s595 s596 s597 s598 s599 s600 s601 s602 s603 s604 s605 s606 s607 s608 s612 s613 s614 s622 s623 s631 s632 s633 s636 s640 s641 s642) 0)") while checking expression at index 0
[2020-05-12 04:06:48] [INFO ] [Real]Absence check using 62 positive place invariants in 285 ms returned sat
[2020-05-12 04:06:48] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 201 ms returned sat
[2020-05-12 04:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:06:51] [INFO ] [Real]Absence check using state equation in 2112 ms returned sat
[2020-05-12 04:06:51] [INFO ] Deduced a trap composed of 14 places in 420 ms
[2020-05-12 04:06:51] [INFO ] Deduced a trap composed of 125 places in 398 ms
[2020-05-12 04:06:52] [INFO ] Deduced a trap composed of 23 places in 369 ms
[2020-05-12 04:06:52] [INFO ] Deduced a trap composed of 16 places in 242 ms
[2020-05-12 04:06:52] [INFO ] Deduced a trap composed of 15 places in 157 ms
[2020-05-12 04:06:53] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2020-05-12 04:06:53] [INFO ] Deduced a trap composed of 21 places in 347 ms
[2020-05-12 04:06:53] [INFO ] Deduced a trap composed of 20 places in 176 ms
[2020-05-12 04:06:55] [INFO ] Deduced a trap composed of 18 places in 1554 ms
[2020-05-12 04:06:55] [INFO ] Deduced a trap composed of 25 places in 157 ms
[2020-05-12 04:06:55] [INFO ] Deduced a trap composed of 133 places in 198 ms
[2020-05-12 04:06:55] [INFO ] Deduced a trap composed of 31 places in 197 ms
[2020-05-12 04:06:56] [INFO ] Deduced a trap composed of 33 places in 185 ms
[2020-05-12 04:06:56] [INFO ] Deduced a trap composed of 29 places in 289 ms
[2020-05-12 04:06:56] [INFO ] Deduced a trap composed of 37 places in 198 ms
[2020-05-12 04:06:56] [INFO ] Deduced a trap composed of 32 places in 168 ms
[2020-05-12 04:06:57] [INFO ] Deduced a trap composed of 47 places in 218 ms
[2020-05-12 04:06:57] [INFO ] Deduced a trap composed of 25 places in 180 ms
[2020-05-12 04:06:57] [INFO ] Deduced a trap composed of 40 places in 148 ms
[2020-05-12 04:07:00] [INFO ] Deduced a trap composed of 47 places in 3149 ms
[2020-05-12 04:07:04] [INFO ] Deduced a trap composed of 134 places in 3848 ms
[2020-05-12 04:07:09] [INFO ] Deduced a trap composed of 44 places in 5034 ms
[2020-05-12 04:07:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s41 s42 s162 s163 s164 s165 s168 s176 s177 s178 s306 s307 s308 s311 s312 s313 s360 s361 s362 s366 s371 s376 s381 s538 s539 s548 s549) 0)") while checking expression at index 1
[2020-05-12 04:07:09] [INFO ] [Real]Absence check using 62 positive place invariants in 68 ms returned sat
[2020-05-12 04:07:09] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 25 ms returned sat
[2020-05-12 04:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:07:10] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2020-05-12 04:07:12] [INFO ] Deduced a trap composed of 18 places in 1573 ms
[2020-05-12 04:07:13] [INFO ] Deduced a trap composed of 14 places in 803 ms
[2020-05-12 04:07:13] [INFO ] Deduced a trap composed of 24 places in 361 ms
[2020-05-12 04:07:14] [INFO ] Deduced a trap composed of 11 places in 356 ms
[2020-05-12 04:07:18] [INFO ] Deduced a trap composed of 127 places in 4353 ms
[2020-05-12 04:07:20] [INFO ] Deduced a trap composed of 21 places in 2481 ms
[2020-05-12 04:07:21] [INFO ] Deduced a trap composed of 20 places in 103 ms
[2020-05-12 04:07:21] [INFO ] Deduced a trap composed of 23 places in 112 ms
[2020-05-12 04:07:24] [INFO ] Deduced a trap composed of 25 places in 3132 ms
[2020-05-12 04:07:24] [INFO ] Deduced a trap composed of 18 places in 254 ms
[2020-05-12 04:07:27] [INFO ] Deduced a trap composed of 34 places in 2471 ms
[2020-05-12 04:07:27] [INFO ] Deduced a trap composed of 57 places in 751 ms
[2020-05-12 04:07:28] [INFO ] Deduced a trap composed of 24 places in 124 ms
[2020-05-12 04:07:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 17353 ms
[2020-05-12 04:07:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:07:28] [INFO ] [Nat]Absence check using 62 positive place invariants in 102 ms returned sat
[2020-05-12 04:07:28] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 254 ms returned sat
[2020-05-12 04:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:07:31] [INFO ] [Nat]Absence check using state equation in 3006 ms returned sat
[2020-05-12 04:07:36] [INFO ] Deduced a trap composed of 12 places in 4882 ms
[2020-05-12 04:07:36] [INFO ] Deduced a trap composed of 17 places in 285 ms
[2020-05-12 04:07:37] [INFO ] Deduced a trap composed of 19 places in 176 ms
[2020-05-12 04:07:37] [INFO ] Deduced a trap composed of 11 places in 217 ms
[2020-05-12 04:07:38] [INFO ] Deduced a trap composed of 28 places in 848 ms
[2020-05-12 04:07:39] [INFO ] Deduced a trap composed of 21 places in 1463 ms
[2020-05-12 04:07:39] [INFO ] Deduced a trap composed of 24 places in 276 ms
[2020-05-12 04:07:40] [INFO ] Deduced a trap composed of 19 places in 558 ms
[2020-05-12 04:07:42] [INFO ] Deduced a trap composed of 15 places in 1419 ms
[2020-05-12 04:07:42] [INFO ] Deduced a trap composed of 16 places in 268 ms
[2020-05-12 04:07:43] [INFO ] Deduced a trap composed of 25 places in 930 ms
[2020-05-12 04:07:43] [INFO ] Deduced a trap composed of 72 places in 269 ms
[2020-05-12 04:07:43] [INFO ] Deduced a trap composed of 28 places in 200 ms
[2020-05-12 04:07:44] [INFO ] Deduced a trap composed of 128 places in 237 ms
[2020-05-12 04:07:44] [INFO ] Deduced a trap composed of 130 places in 321 ms
[2020-05-12 04:07:45] [INFO ] Deduced a trap composed of 133 places in 589 ms
[2020-05-12 04:07:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 13437 ms
[2020-05-12 04:07:45] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 41 ms.
[2020-05-12 04:07:48] [INFO ] Added : 315 causal constraints over 63 iterations in 3122 ms. Result :(error "Failed to check-sat")
[2020-05-12 04:07:48] [INFO ] [Real]Absence check using 62 positive place invariants in 89 ms returned sat
[2020-05-12 04:07:48] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 224 ms returned sat
[2020-05-12 04:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:07:50] [INFO ] [Real]Absence check using state equation in 2052 ms returned sat
[2020-05-12 04:07:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:07:51] [INFO ] [Nat]Absence check using 62 positive place invariants in 439 ms returned sat
[2020-05-12 04:07:51] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 60 ms returned sat
[2020-05-12 04:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:07:52] [INFO ] [Nat]Absence check using state equation in 981 ms returned sat
[2020-05-12 04:07:52] [INFO ] Deduced a trap composed of 30 places in 279 ms
[2020-05-12 04:07:52] [INFO ] Deduced a trap composed of 12 places in 207 ms
[2020-05-12 04:07:53] [INFO ] Deduced a trap composed of 137 places in 191 ms
[2020-05-12 04:07:53] [INFO ] Deduced a trap composed of 18 places in 209 ms
[2020-05-12 04:07:53] [INFO ] Deduced a trap composed of 116 places in 273 ms
[2020-05-12 04:07:54] [INFO ] Deduced a trap composed of 15 places in 396 ms
[2020-05-12 04:07:54] [INFO ] Deduced a trap composed of 18 places in 393 ms
[2020-05-12 04:07:54] [INFO ] Deduced a trap composed of 24 places in 391 ms
[2020-05-12 04:07:59] [INFO ] Deduced a trap composed of 21 places in 4976 ms
[2020-05-12 04:08:01] [INFO ] Deduced a trap composed of 21 places in 1747 ms
[2020-05-12 04:08:01] [INFO ] Deduced a trap composed of 20 places in 189 ms
[2020-05-12 04:08:03] [INFO ] Deduced a trap composed of 22 places in 1206 ms
[2020-05-12 04:08:03] [INFO ] Deduced a trap composed of 24 places in 683 ms
[2020-05-12 04:08:04] [INFO ] Deduced a trap composed of 23 places in 469 ms
[2020-05-12 04:08:04] [INFO ] Deduced a trap composed of 14 places in 543 ms
[2020-05-12 04:08:14] [INFO ] Deduced a trap composed of 22 places in 9278 ms
[2020-05-12 04:08:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s159 s380 s381 s382) 0)") while checking expression at index 3
[2020-05-12 04:08:14] [INFO ] [Real]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-05-12 04:08:14] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 41 ms returned sat
[2020-05-12 04:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:08:17] [INFO ] [Real]Absence check using state equation in 2898 ms returned sat
[2020-05-12 04:08:19] [INFO ] Deduced a trap composed of 11 places in 2174 ms
[2020-05-12 04:08:22] [INFO ] Deduced a trap composed of 15 places in 3260 ms
[2020-05-12 04:08:23] [INFO ] Deduced a trap composed of 27 places in 207 ms
[2020-05-12 04:08:28] [INFO ] Deduced a trap composed of 8 places in 4955 ms
[2020-05-12 04:08:32] [INFO ] Deduced a trap composed of 116 places in 3896 ms
[2020-05-12 04:08:32] [INFO ] Deduced a trap composed of 24 places in 393 ms
[2020-05-12 04:08:32] [INFO ] Deduced a trap composed of 28 places in 383 ms
[2020-05-12 04:08:33] [INFO ] Deduced a trap composed of 123 places in 400 ms
[2020-05-12 04:08:33] [INFO ] Deduced a trap composed of 18 places in 355 ms
[2020-05-12 04:08:34] [INFO ] Deduced a trap composed of 120 places in 363 ms
[2020-05-12 04:08:34] [INFO ] Deduced a trap composed of 28 places in 383 ms
[2020-05-12 04:08:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s168 s171 s172 s182 s183 s184 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s380 s381 s382 s386 s399 s401 s402 s403) 0)") while checking expression at index 4
[2020-05-12 04:08:34] [INFO ] [Real]Absence check using 62 positive place invariants in 108 ms returned sat
[2020-05-12 04:08:34] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 46 ms returned sat
[2020-05-12 04:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:08:36] [INFO ] [Real]Absence check using state equation in 2048 ms returned sat
[2020-05-12 04:08:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:08:37] [INFO ] [Nat]Absence check using 62 positive place invariants in 123 ms returned sat
[2020-05-12 04:08:37] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 35 ms returned sat
[2020-05-12 04:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:08:38] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2020-05-12 04:08:38] [INFO ] Deduced a trap composed of 14 places in 320 ms
[2020-05-12 04:08:42] [INFO ] Deduced a trap composed of 23 places in 3667 ms
[2020-05-12 04:08:42] [INFO ] Deduced a trap composed of 19 places in 574 ms
[2020-05-12 04:08:46] [INFO ] Deduced a trap composed of 12 places in 3962 ms
[2020-05-12 04:08:47] [INFO ] Deduced a trap composed of 12 places in 457 ms
[2020-05-12 04:08:49] [INFO ] Deduced a trap composed of 16 places in 2336 ms
[2020-05-12 04:08:49] [INFO ] Deduced a trap composed of 28 places in 217 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 19 places in 189 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 43 places in 224 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 26 places in 202 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 121 places in 180 ms
[2020-05-12 04:08:51] [INFO ] Deduced a trap composed of 23 places in 181 ms
[2020-05-12 04:08:51] [INFO ] Deduced a trap composed of 125 places in 173 ms
[2020-05-12 04:08:51] [INFO ] Deduced a trap composed of 34 places in 204 ms
[2020-05-12 04:08:51] [INFO ] Deduced a trap composed of 134 places in 170 ms
[2020-05-12 04:08:51] [INFO ] Deduced a trap composed of 129 places in 194 ms
[2020-05-12 04:08:52] [INFO ] Deduced a trap composed of 52 places in 323 ms
[2020-05-12 04:08:53] [INFO ] Deduced a trap composed of 30 places in 1281 ms
[2020-05-12 04:08:56] [INFO ] Deduced a trap composed of 36 places in 2810 ms
[2020-05-12 04:08:59] [INFO ] Deduced a trap composed of 58 places in 2994 ms
[2020-05-12 04:08:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s30 s31 s34 s35 s149 s150 s151 s157 s158 s168 s177 s178 s211 s297 s302 s307 s312 s355 s356 s357 s360 s361 s362 s366 s371 s376 s381 s396 s406 s416 s486 s487 s490 s491 s538 s539 s552 s553 s566 s567 s573 s574 s577 s578 s636 s640) 0)") while checking expression at index 5
[2020-05-12 04:08:59] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-05-12 04:08:59] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 314 ms returned sat
[2020-05-12 04:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:09:02] [INFO ] [Real]Absence check using state equation in 2843 ms returned sat
[2020-05-12 04:09:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:09:02] [INFO ] [Nat]Absence check using 62 positive place invariants in 98 ms returned sat
[2020-05-12 04:09:02] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-05-12 04:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:09:04] [INFO ] [Nat]Absence check using state equation in 1833 ms returned sat
[2020-05-12 04:09:05] [INFO ] Deduced a trap composed of 17 places in 202 ms
[2020-05-12 04:09:05] [INFO ] Deduced a trap composed of 14 places in 190 ms
[2020-05-12 04:09:05] [INFO ] Deduced a trap composed of 11 places in 183 ms
[2020-05-12 04:09:05] [INFO ] Deduced a trap composed of 11 places in 179 ms
[2020-05-12 04:09:05] [INFO ] Deduced a trap composed of 27 places in 185 ms
[2020-05-12 04:09:06] [INFO ] Deduced a trap composed of 122 places in 183 ms
[2020-05-12 04:09:06] [INFO ] Deduced a trap composed of 26 places in 201 ms
[2020-05-12 04:09:06] [INFO ] Deduced a trap composed of 21 places in 177 ms
[2020-05-12 04:09:06] [INFO ] Deduced a trap composed of 23 places in 218 ms
[2020-05-12 04:09:07] [INFO ] Deduced a trap composed of 19 places in 220 ms
[2020-05-12 04:09:09] [INFO ] Deduced a trap composed of 15 places in 2038 ms
[2020-05-12 04:09:10] [INFO ] Deduced a trap composed of 130 places in 1115 ms
[2020-05-12 04:09:17] [INFO ] Deduced a trap composed of 23 places in 7486 ms
[2020-05-12 04:09:21] [INFO ] Deduced a trap composed of 24 places in 4129 ms
[2020-05-12 04:09:27] [INFO ] Deduced a trap composed of 19 places in 5716 ms
[2020-05-12 04:09:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s238 s239 s240 s241 s244 s245 s246 s247 s435 s436 s437 s441) 0)") while checking expression at index 6
[2020-05-12 04:09:28] [INFO ] [Real]Absence check using 62 positive place invariants in 202 ms returned sat
[2020-05-12 04:09:28] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 198 ms returned sat
[2020-05-12 04:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:09:32] [INFO ] [Real]Absence check using state equation in 3916 ms returned sat
[2020-05-12 04:09:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:09:32] [INFO ] [Nat]Absence check using 62 positive place invariants in 245 ms returned sat
[2020-05-12 04:09:32] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 93 ms returned sat
[2020-05-12 04:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:09:36] [INFO ] [Nat]Absence check using state equation in 3844 ms returned sat
[2020-05-12 04:09:41] [INFO ] Deduced a trap composed of 17 places in 5215 ms
[2020-05-12 04:09:43] [INFO ] Deduced a trap composed of 128 places in 1854 ms
[2020-05-12 04:09:44] [INFO ] Deduced a trap composed of 15 places in 501 ms
[2020-05-12 04:09:45] [INFO ] Deduced a trap composed of 11 places in 952 ms
[2020-05-12 04:09:49] [INFO ] Deduced a trap composed of 18 places in 4441 ms
[2020-05-12 04:09:50] [INFO ] Deduced a trap composed of 20 places in 657 ms
[2020-05-12 04:09:50] [INFO ] Deduced a trap composed of 29 places in 320 ms
[2020-05-12 04:09:50] [INFO ] Deduced a trap composed of 121 places in 191 ms
[2020-05-12 04:09:51] [INFO ] Deduced a trap composed of 126 places in 187 ms
[2020-05-12 04:09:51] [INFO ] Deduced a trap composed of 24 places in 376 ms
[2020-05-12 04:09:52] [INFO ] Deduced a trap composed of 25 places in 611 ms
[2020-05-12 04:09:53] [INFO ] Deduced a trap composed of 117 places in 1159 ms
[2020-05-12 04:09:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s50 s51 s54 s55 s238 s239 s240 s246 s247 s251 s252 s253 s259 s262 s296 s297 s298 s301 s302 s303 s311 s312 s313 s317 s321 s322 s323 s336 s341 s360 s361 s362 s366 s371 s380 s381 s382 s391 s395 s396 s397 s416 s421 s441 s451 s460 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s479 s480 s481 s482 s483 s486 s487 s490 s491 s499 s500 s501 s502 s505 s506 s507 s508 s511 s512 s515 s516 s538 s539 s548 s549 s554 s555 s556 s557 s560 s561 s562 s563 s566 s567 s570 s571 s577 s578 s579 s580 s581 s582 s585 s586 s587 s588 s589 s590 s591 s592 s597 s598 s605 s606 s607) 0)") while checking expression at index 7
[2020-05-12 04:09:53] [INFO ] [Real]Absence check using 62 positive place invariants in 264 ms returned sat
[2020-05-12 04:09:53] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 133 ms returned sat
[2020-05-12 04:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:09:56] [INFO ] [Real]Absence check using state equation in 2686 ms returned sat
[2020-05-12 04:09:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:09:56] [INFO ] [Nat]Absence check using 62 positive place invariants in 325 ms returned sat
[2020-05-12 04:09:57] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 103 ms returned sat
[2020-05-12 04:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:10:01] [INFO ] [Nat]Absence check using state equation in 4872 ms returned sat
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 12 places in 162 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 11 places in 120 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 14 places in 117 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 23 places in 122 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 34 places in 122 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 27 places in 103 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 27 places in 102 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 22 places in 102 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 31 places in 104 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 30 places in 100 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 31 places in 101 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 61 places in 97 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 22 places in 104 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 28 places in 147 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 59 places in 96 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 55 places in 129 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 59 places in 282 ms
[2020-05-12 04:10:06] [INFO ] Deduced a trap composed of 26 places in 1227 ms
[2020-05-12 04:10:06] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4375 ms
[2020-05-12 04:10:06] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 40 ms.
[2020-05-12 04:10:11] [INFO ] Added : 416 causal constraints over 84 iterations in 5097 ms. Result :sat
[2020-05-12 04:10:11] [INFO ] Deduced a trap composed of 162 places in 288 ms
[2020-05-12 04:10:11] [INFO ] Deduced a trap composed of 165 places in 173 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 154 places in 211 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 158 places in 311 ms
[2020-05-12 04:10:13] [INFO ] Deduced a trap composed of 157 places in 328 ms
[2020-05-12 04:10:14] [INFO ] Deduced a trap composed of 151 places in 1651 ms
[2020-05-12 04:10:16] [INFO ] Deduced a trap composed of 162 places in 1422 ms
[2020-05-12 04:10:17] [INFO ] Deduced a trap composed of 152 places in 941 ms
[2020-05-12 04:10:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s50 s51 s54 s55 s65 s66 s69 s70 s75 s76 s94 s98 s100 s103 s119 s131 s137 s188 s189 s190 s214 s215 s216 s246 s247 s251 s252 s253 s263 s264 s265 s297 s312 s317 s322 s330 s332 s336 s350 s352 s356 s361 s366 s371 s376 s381 s386 s411 s421 s426 s436 s444 s446 s447 s448 s459 s460 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s479 s480 s481 s482 s483 s486 s487 s488 s489 s490 s491 s505 s506 s507 s508 s511 s512 s517 s520 s521 s523 s528 s529 s530 s531 s532 s533 s534 s535 s538 s539 s542 s543 s548 s549 s552 s553 s554 s555 s556 s557 s558 s559 s562 s563 s564 s565 s568 s569 s570 s571 s573 s574 s575 s576 s579 s580 s581 s582 s585 s586 s589 s590 s593 s594 s595 s596 s601 s602 s605 s606 s607 s616 s617 s618 s628 s629 s634 s635 s643) 0)") while checking expression at index 8
[2020-05-12 04:10:17] [INFO ] [Real]Absence check using 62 positive place invariants in 48 ms returned sat
[2020-05-12 04:10:17] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 25 ms returned sat
[2020-05-12 04:10:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:10:18] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2020-05-12 04:10:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:10:18] [INFO ] [Nat]Absence check using 62 positive place invariants in 317 ms returned sat
[2020-05-12 04:10:19] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 431 ms returned sat
[2020-05-12 04:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:10:21] [INFO ] [Nat]Absence check using state equation in 2708 ms returned sat
[2020-05-12 04:10:22] [INFO ] Deduced a trap composed of 14 places in 198 ms
[2020-05-12 04:10:22] [INFO ] Deduced a trap composed of 11 places in 194 ms
[2020-05-12 04:10:22] [INFO ] Deduced a trap composed of 11 places in 190 ms
[2020-05-12 04:10:22] [INFO ] Deduced a trap composed of 16 places in 209 ms
[2020-05-12 04:10:23] [INFO ] Deduced a trap composed of 23 places in 190 ms
[2020-05-12 04:10:23] [INFO ] Deduced a trap composed of 19 places in 188 ms
[2020-05-12 04:10:23] [INFO ] Deduced a trap composed of 20 places in 191 ms
[2020-05-12 04:10:23] [INFO ] Deduced a trap composed of 15 places in 188 ms
[2020-05-12 04:10:23] [INFO ] Deduced a trap composed of 121 places in 190 ms
[2020-05-12 04:10:24] [INFO ] Deduced a trap composed of 19 places in 188 ms
[2020-05-12 04:10:24] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-05-12 04:10:24] [INFO ] Deduced a trap composed of 17 places in 194 ms
[2020-05-12 04:10:24] [INFO ] Deduced a trap composed of 152 places in 195 ms
[2020-05-12 04:10:25] [INFO ] Deduced a trap composed of 29 places in 186 ms
[2020-05-12 04:10:25] [INFO ] Deduced a trap composed of 36 places in 185 ms
[2020-05-12 04:10:25] [INFO ] Deduced a trap composed of 17 places in 200 ms
[2020-05-12 04:10:25] [INFO ] Deduced a trap composed of 22 places in 211 ms
[2020-05-12 04:10:25] [INFO ] Deduced a trap composed of 130 places in 193 ms
[2020-05-12 04:10:26] [INFO ] Deduced a trap composed of 26 places in 228 ms
[2020-05-12 04:10:26] [INFO ] Deduced a trap composed of 23 places in 188 ms
[2020-05-12 04:10:26] [INFO ] Deduced a trap composed of 28 places in 189 ms
[2020-05-12 04:10:26] [INFO ] Deduced a trap composed of 136 places in 202 ms
[2020-05-12 04:10:27] [INFO ] Deduced a trap composed of 38 places in 187 ms
[2020-05-12 04:10:28] [INFO ] Deduced a trap composed of 147 places in 1630 ms
[2020-05-12 04:10:29] [INFO ] Deduced a trap composed of 30 places in 382 ms
[2020-05-12 04:10:29] [INFO ] Deduced a trap composed of 27 places in 196 ms
[2020-05-12 04:10:29] [INFO ] Deduced a trap composed of 20 places in 220 ms
[2020-05-12 04:10:30] [INFO ] Deduced a trap composed of 118 places in 903 ms
[2020-05-12 04:10:30] [INFO ] Deduced a trap composed of 32 places in 194 ms
[2020-05-12 04:10:31] [INFO ] Deduced a trap composed of 146 places in 196 ms
[2020-05-12 04:10:34] [INFO ] Deduced a trap composed of 151 places in 3512 ms
[2020-05-12 04:10:35] [INFO ] Deduced a trap composed of 136 places in 1172 ms
[2020-05-12 04:10:37] [INFO ] Deduced a trap composed of 44 places in 1641 ms
[2020-05-12 04:10:37] [INFO ] Deduced a trap composed of 39 places in 191 ms
[2020-05-12 04:10:38] [INFO ] Deduced a trap composed of 135 places in 194 ms
[2020-05-12 04:10:38] [INFO ] Deduced a trap composed of 129 places in 190 ms
[2020-05-12 04:10:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 04:10:42] [INFO ] Deduced a trap composed of 6 places in 4137 ms
[2020-05-12 04:10:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s254) 0)") while checking expression at index 9
[2020-05-12 04:10:43] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 04:10:43] [INFO ] Flatten gal took : 251 ms
[2020-05-12 04:10:43] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 04:10:43] [INFO ] Flatten gal took : 88 ms
FORMULA BusinessProcesses-PT-17-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 04:10:43] [INFO ] Applying decomposition
[2020-05-12 04:10:43] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11173182176825018451.txt, -o, /tmp/graph11173182176825018451.bin, -w, /tmp/graph11173182176825018451.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11173182176825018451.bin, -l, -1, -v, -w, /tmp/graph11173182176825018451.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 04:10:43] [INFO ] Decomposing Gal with order
[2020-05-12 04:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 04:10:44] [INFO ] Removed a total of 276 redundant transitions.
[2020-05-12 04:10:44] [INFO ] Flatten gal took : 452 ms
[2020-05-12 04:10:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 32 ms.
[2020-05-12 04:10:44] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 49 ms
[2020-05-12 04:10:44] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
built 62 ordering constraints for composite.
built 20 ordering constraints for composite.
built 31 ordering constraints for composite.
built 31 ordering constraints for composite.
built 22 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 29 ordering constraints for composite.
built 24 ordering constraints for composite.
built 27 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 81 ordering constraints for composite.
built 20 ordering constraints for composite.
built 24 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 15 ordering constraints for composite.
built 24 ordering constraints for composite.
built 25 ordering constraints for composite.
built 89 ordering constraints for composite.
built 17 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.74962e+26,5.96614,171768,16900,59,322379,924,1230,718367,66,2444,0


Converting to forward existential form...Done !
original formula: A(((i0.u91.p233!=0)&&(i4.u65.p160!=1)) U AG(((i5.u76.p192==0)||(i12.u45.p109==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(((i5.u76.p192==0)||(i12.u45.p109==1))))))))) * !(E(!(!(E(TRUE U !(((i5.u76.p192==0)||(i12.u45.p109==1)))))) U (!(((i0.u91.p233!=0)&&(i4.u65.p160!=1))) * !(!(E(TRUE U !(((i5.u76.p192==0)||(i12.u45.p109==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t80, t294, t304, t312, t418, t432, i0.t300, i0.t177, i0.u90.t307, i0.u92.t303, i0.u168.t178, i1.u78.t327, i1.u84.t319, i2.t442, i2.t427, i2.t422, i2.t115, i2.u16.t438, i2.u15.t440, i2.u20.t431, i2.u23.t425, i2.u24.t423, i2.u195.t119, i3.t413, i3.t411, i3.t409, i3.t407, i3.t404, i3.t402, i3.u27.t417, i4.t357, i4.t217, i4.u63.t355, i4.u65.t351, i4.u149.t218, i5.u74.t335, i5.u76.t331, i6.i0.i0.t290, i6.i0.i0.u97.t293, i6.i0.i1.u99.t286, i6.i0.i3.t157, i6.i0.i3.u178.t158, i6.i0.i4.t153, i6.i0.i4.u181.t154, i6.i1.i0.t297, i6.i1.i0.u94.t299, i6.i1.i1.t165, i6.i1.i1.u175.t166, i6.i1.i2.t161, i6.i1.i2.u177.t162, i7.t181, i7.t173, i7.t169, i7.u86.t315, i7.u88.t311, i7.u166.t182, i7.u170.t174, i7.u173.t170, i8.t229, i8.t225, i8.t221, i8.t213, i8.t205, i8.u142.t230, i8.u145.t226, i8.u146.t222, i8.u150.t214, i8.u155.t206, i9.t280, i9.t277, i9.t273, i9.t129, i9.u118.t281, i9.u119.t278, i9.u121.t274, i9.u187.t133, i10.u58.t365, i10.u60.t361, i10.u37.t395, i11.t435, i11.t269, i11.t265, i11.u17.t437, i11.u123.t270, i11.u125.t266, i12.t373, i12.t371, i12.t369, i12.t261, i12.t241, i12.t237, i12.u39.t377, i12.u39.t381, i12.u39.t385, i12.u39.t391, i12.u128.t262, i12.u136.t242, i12.u139.t238, i13.t253, i13.u25.t421, i13.u35.t399, i13.u131.t254, i14.t249, i14.t245, i14.t233, i14.u133.t250, i14.u134.t246, i14.u141.t234, i15.t209, i15.u67.t347, i15.u72.t339, i15.u153.t210, i16.t201, i16.t197, i16.t193, i16.t189, i16.t185, i16.u157.t202, i16.u158.t198, i16.u160.t194, i16.u162.t190, i16.u165.t186, i17.t147, i17.t140, i17.t135, i17.t131, i17.t127, i17.t125, i17.t122, i17.t117, i17.t113, i17.t110, i17.t108, i17.t106, i17.t104, i17.t101, i17.t73, i17.t70, i17.t67, i17.t65, i17.t62, i17.t59, i17.t57, i17.t55, i17.t53, i17.t50, i17.t47, i17.t37, i17.t34, i17.t31, i17.t28, i17.t25, i17.t22, i17.t20, i17.t17, i17.t14, i17.u250.t12, i17.u250.t44, i17.u250.t84, i17.u250.t88, i17.u250.t92, i17.u250.t98, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/376/163/575
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2020-05-12 04:32:10] [INFO ] Applying decomposition
[2020-05-12 04:32:11] [INFO ] Flatten gal took : 76 ms
[2020-05-12 04:32:11] [INFO ] Decomposing Gal with order
[2020-05-12 04:32:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 04:32:11] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 04:32:11] [INFO ] Flatten gal took : 169 ms
[2020-05-12 04:32:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 584 ms.
[2020-05-12 04:32:12] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 32 ms
[2020-05-12 04:32:12] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
built 2 ordering constraints for composite.
built 143 ordering constraints for composite.
built 78 ordering constraints for composite.
built 77 ordering constraints for composite.
built 76 ordering constraints for composite.
built 76 ordering constraints for composite.
built 74 ordering constraints for composite.
built 71 ordering constraints for composite.
built 69 ordering constraints for composite.
built 67 ordering constraints for composite.
built 65 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 ordering constraints for composite.
built 57 ordering constraints for composite.
built 55 ordering constraints for composite.
built 53 ordering constraints for composite.
built 51 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 67 ordering constraints for composite.
built 65 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 ordering constraints for composite.
built 59 ordering constraints for composite.
built 57 ordering constraints for composite.
built 55 ordering constraints for composite.
built 53 ordering constraints for composite.
built 51 ordering constraints for composite.
built 49 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 31 ordering constraints for composite.
built 29 ordering constraints for composite.
built 27 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 21 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 88 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 04:53:39] [INFO ] Flatten gal took : 303 ms
[2020-05-12 04:53:41] [INFO ] Input system was already deterministic with 576 transitions.
[2020-05-12 04:53:41] [INFO ] Transformed 646 places.
[2020-05-12 04:53:41] [INFO ] Transformed 576 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-12 04:54:11] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 37 ms
[2020-05-12 04:54:11] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BusinessProcesses-PT-17"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-17, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699200579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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