fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r126-tajo-158961390300426
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for PolyORBLF-PT-S02J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.190 3600000.00 6939845.00 6046.20 ????T????F??TTF? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390300426.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-PT-S02J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390300426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.3K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 12 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 04:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 04:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.0K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 9 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBLF-PT-S02J04T10-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-15

=== Now, execution of the tool begins

BK_START 1589816072770

[2020-05-18 15:34:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-18 15:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 15:34:34] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-05-18 15:34:34] [INFO ] Transformed 752 places.
[2020-05-18 15:34:34] [INFO ] Transformed 1572 transitions.
[2020-05-18 15:34:34] [INFO ] Parsed PT model containing 752 places and 1572 transitions in 156 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 14 resets, run finished after 790 ms. (steps per millisecond=126 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1]
[2020-05-18 15:34:35] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2020-05-18 15:34:35] [INFO ] Computed 54 place invariants in 123 ms
[2020-05-18 15:34:35] [INFO ] [Real]Absence check using 15 positive place invariants in 33 ms returned sat
[2020-05-18 15:34:35] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 40 ms returned sat
[2020-05-18 15:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:34:40] [INFO ] [Real]Absence check using state equation in 4133 ms returned sat
[2020-05-18 15:34:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:34:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-05-18 15:34:40] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 65 ms returned sat
[2020-05-18 15:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:34:43] [INFO ] [Nat]Absence check using state equation in 3296 ms returned sat
[2020-05-18 15:34:43] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-05-18 15:34:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:34:48] [INFO ] [Nat]Added 130 Read/Feed constraints in 4737 ms returned sat
[2020-05-18 15:34:49] [INFO ] Deduced a trap composed of 65 places in 643 ms
[2020-05-18 15:34:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:34:54] [INFO ] Deduced a trap composed of 66 places in 535 ms
[2020-05-18 15:34:55] [INFO ] Deduced a trap composed of 65 places in 676 ms
[2020-05-18 15:34:55] [INFO ] Deduced a trap composed of 65 places in 158 ms
[2020-05-18 15:34:57] [INFO ] Deduced a trap composed of 23 places in 224 ms
[2020-05-18 15:34:57] [INFO ] Deduced a trap composed of 66 places in 63 ms
[2020-05-18 15:34:58] [INFO ] Deduced a trap composed of 429 places in 564 ms
[2020-05-18 15:34:58] [INFO ] Deduced a trap composed of 395 places in 507 ms
[2020-05-18 15:34:58] [INFO ] Deduced a trap composed of 66 places in 63 ms
[2020-05-18 15:34:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 10715 ms
[2020-05-18 15:34:59] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 174 ms.
[2020-05-18 15:35:00] [INFO ] Added : 25 causal constraints over 5 iterations in 1054 ms. Result :unknown
[2020-05-18 15:35:00] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-05-18 15:35:00] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 50 ms returned unsat
[2020-05-18 15:35:00] [INFO ] [Real]Absence check using 15 positive place invariants in 68 ms returned sat
[2020-05-18 15:35:00] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 53 ms returned unsat
[2020-05-18 15:35:00] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-05-18 15:35:00] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 47 ms returned sat
[2020-05-18 15:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:35:04] [INFO ] [Real]Absence check using state equation in 3790 ms returned sat
[2020-05-18 15:35:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:35:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-05-18 15:35:04] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 34 ms returned sat
[2020-05-18 15:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:35:13] [INFO ] [Nat]Absence check using state equation in 9146 ms returned sat
[2020-05-18 15:35:14] [INFO ] [Nat]Added 130 Read/Feed constraints in 849 ms returned sat
[2020-05-18 15:35:14] [INFO ] Deduced a trap composed of 65 places in 208 ms
[2020-05-18 15:35:15] [INFO ] Deduced a trap composed of 65 places in 211 ms
[2020-05-18 15:35:15] [INFO ] Deduced a trap composed of 65 places in 191 ms
[2020-05-18 15:35:16] [INFO ] Deduced a trap composed of 65 places in 197 ms
[2020-05-18 15:35:16] [INFO ] Deduced a trap composed of 65 places in 150 ms
[2020-05-18 15:35:16] [INFO ] Deduced a trap composed of 66 places in 119 ms
[2020-05-18 15:35:17] [INFO ] Deduced a trap composed of 66 places in 64 ms
[2020-05-18 15:35:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2777 ms
[2020-05-18 15:35:17] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 138 ms.
[2020-05-18 15:35:24] [INFO ] Added : 120 causal constraints over 24 iterations in 7116 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-18 15:35:24] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-05-18 15:35:24] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 50 ms returned sat
[2020-05-18 15:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:35:29] [INFO ] [Real]Absence check using state equation in 4192 ms returned sat
[2020-05-18 15:35:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:35:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-05-18 15:35:29] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 46 ms returned sat
[2020-05-18 15:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:35:38] [INFO ] [Nat]Absence check using state equation in 9207 ms returned sat
[2020-05-18 15:35:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:35:42] [INFO ] [Nat]Added 130 Read/Feed constraints in 3931 ms returned sat
[2020-05-18 15:35:42] [INFO ] Deduced a trap composed of 66 places in 325 ms
[2020-05-18 15:35:42] [INFO ] Deduced a trap composed of 66 places in 128 ms
[2020-05-18 15:35:43] [INFO ] Deduced a trap composed of 66 places in 89 ms
[2020-05-18 15:35:43] [INFO ] Deduced a trap composed of 66 places in 59 ms
[2020-05-18 15:35:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1013 ms
[2020-05-18 15:35:43] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 127 ms.
[2020-05-18 15:35:49] [INFO ] Added : 30 causal constraints over 6 iterations in 5694 ms. Result :unknown
[2020-05-18 15:35:49] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-05-18 15:35:49] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 40 ms returned sat
[2020-05-18 15:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:35:52] [INFO ] [Real]Absence check using state equation in 3374 ms returned sat
[2020-05-18 15:35:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:35:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-05-18 15:35:52] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 62 ms returned sat
[2020-05-18 15:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:35:58] [INFO ] [Nat]Absence check using state equation in 6053 ms returned sat
[2020-05-18 15:35:59] [INFO ] [Nat]Added 130 Read/Feed constraints in 1168 ms returned sat
[2020-05-18 15:36:00] [INFO ] Deduced a trap composed of 65 places in 163 ms
[2020-05-18 15:36:01] [INFO ] Deduced a trap composed of 65 places in 119 ms
[2020-05-18 15:36:03] [INFO ] Deduced a trap composed of 65 places in 185 ms
[2020-05-18 15:36:05] [INFO ] Deduced a trap composed of 65 places in 181 ms
[2020-05-18 15:36:06] [INFO ] Deduced a trap composed of 65 places in 82 ms
[2020-05-18 15:36:06] [INFO ] Deduced a trap composed of 67 places in 96 ms
[2020-05-18 15:36:07] [INFO ] Deduced a trap composed of 66 places in 67 ms
[2020-05-18 15:36:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 8410 ms
[2020-05-18 15:36:08] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 123 ms.
[2020-05-18 15:36:12] [INFO ] Added : 20 causal constraints over 4 iterations in 4245 ms. Result :unknown
[2020-05-18 15:36:12] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-05-18 15:36:12] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 51 ms returned sat
[2020-05-18 15:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:36:16] [INFO ] [Real]Absence check using state equation in 3322 ms returned sat
[2020-05-18 15:36:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:36:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-05-18 15:36:16] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 60 ms returned sat
[2020-05-18 15:36:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:36:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:36:28] [INFO ] [Nat]Absence check using state equation in 11820 ms returned unknown
[2020-05-18 15:36:28] [INFO ] [Real]Absence check using 15 positive place invariants in 41 ms returned sat
[2020-05-18 15:36:28] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 57 ms returned sat
[2020-05-18 15:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:36:31] [INFO ] [Real]Absence check using state equation in 3055 ms returned sat
[2020-05-18 15:36:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:36:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-05-18 15:36:31] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 44 ms returned sat
[2020-05-18 15:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:36:35] [INFO ] [Nat]Absence check using state equation in 4062 ms returned sat
[2020-05-18 15:36:36] [INFO ] [Nat]Added 130 Read/Feed constraints in 1246 ms returned sat
[2020-05-18 15:36:37] [INFO ] Deduced a trap composed of 66 places in 163 ms
[2020-05-18 15:36:37] [INFO ] Deduced a trap composed of 66 places in 96 ms
[2020-05-18 15:36:38] [INFO ] Deduced a trap composed of 66 places in 76 ms
[2020-05-18 15:36:38] [INFO ] Deduced a trap composed of 66 places in 66 ms
[2020-05-18 15:36:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2243 ms
[2020-05-18 15:36:39] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 156 ms.
[2020-05-18 15:36:51] [INFO ] Added : 215 causal constraints over 43 iterations in 12302 ms. Result :unknown
[2020-05-18 15:36:51] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-05-18 15:36:51] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 52 ms returned sat
[2020-05-18 15:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:36:56] [INFO ] [Real]Absence check using state equation in 4502 ms returned sat
[2020-05-18 15:36:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:36:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-05-18 15:36:56] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 46 ms returned sat
[2020-05-18 15:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:37:00] [INFO ] [Nat]Absence check using state equation in 4312 ms returned sat
[2020-05-18 15:37:01] [INFO ] [Nat]Added 130 Read/Feed constraints in 818 ms returned sat
[2020-05-18 15:37:01] [INFO ] Deduced a trap composed of 65 places in 158 ms
[2020-05-18 15:37:02] [INFO ] Deduced a trap composed of 66 places in 155 ms
[2020-05-18 15:37:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:37:17] [INFO ] Deduced a trap composed of 3 places in 847 ms
[2020-05-18 15:37: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 (> (+ s217 s524 s706) 0)") while checking expression at index 8
[2020-05-18 15:37:17] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2020-05-18 15:37:17] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 33 ms returned sat
[2020-05-18 15:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:37:20] [INFO ] [Real]Absence check using state equation in 3310 ms returned sat
[2020-05-18 15:37:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:37:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned sat
[2020-05-18 15:37:20] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 35 ms returned sat
[2020-05-18 15:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:37:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:37:33] [INFO ] [Nat]Absence check using state equation in 12546 ms returned unknown
[2020-05-18 15:37:33] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-05-18 15:37:33] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 50 ms returned sat
[2020-05-18 15:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:37:36] [INFO ] [Real]Absence check using state equation in 2848 ms returned sat
[2020-05-18 15:37:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:37:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-05-18 15:37:36] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 46 ms returned sat
[2020-05-18 15:37:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:37:44] [INFO ] [Nat]Absence check using state equation in 7831 ms returned sat
[2020-05-18 15:37:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:37:49] [INFO ] [Nat]Added 130 Read/Feed constraints in 4872 ms returned sat
[2020-05-18 15:37:49] [INFO ] Deduced a trap composed of 114 places in 560 ms
[2020-05-18 15:37:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:37:54] [INFO ] Deduced a trap composed of 65 places in 95 ms
[2020-05-18 15:37:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:37:57] [INFO ] Deduced a trap composed of 3 places in 708 ms
[2020-05-18 15:37:57] [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 (> (+ s217 s524 s706) 0)") while checking expression at index 10
[2020-05-18 15:37:57] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-05-18 15:37:57] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 32 ms returned sat
[2020-05-18 15:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:37:59] [INFO ] [Real]Absence check using state equation in 2701 ms returned sat
[2020-05-18 15:37:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:38:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 24 ms returned sat
[2020-05-18 15:38:00] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 39 ms returned sat
[2020-05-18 15:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:38:05] [INFO ] [Nat]Absence check using state equation in 5421 ms returned sat
[2020-05-18 15:38:05] [INFO ] [Nat]Added 130 Read/Feed constraints in 222 ms returned sat
[2020-05-18 15:38:06] [INFO ] Deduced a trap composed of 66 places in 233 ms
[2020-05-18 15:38:06] [INFO ] Deduced a trap composed of 65 places in 165 ms
[2020-05-18 15:38:06] [INFO ] Deduced a trap composed of 65 places in 142 ms
[2020-05-18 15:38:06] [INFO ] Deduced a trap composed of 65 places in 105 ms
[2020-05-18 15:38:06] [INFO ] Deduced a trap composed of 66 places in 51 ms
[2020-05-18 15:38:06] [INFO ] Deduced a trap composed of 66 places in 64 ms
[2020-05-18 15:38:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1098 ms
[2020-05-18 15:38:07] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 115 ms.
[2020-05-18 15:38:19] [INFO ] Added : 80 causal constraints over 16 iterations in 13000 ms. Result :unknown
[2020-05-18 15:38:20] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-05-18 15:38:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 53 ms returned sat
[2020-05-18 15:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:38:23] [INFO ] [Real]Absence check using state equation in 2991 ms returned sat
[2020-05-18 15:38:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:38:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 39 ms returned sat
[2020-05-18 15:38:23] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 58 ms returned sat
[2020-05-18 15:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:38:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:38:34] [INFO ] [Nat]Absence check using state equation in 11384 ms returned unknown
[2020-05-18 15:38:34] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-05-18 15:38:34] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 61 ms returned sat
[2020-05-18 15:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:38:39] [INFO ] [Real]Absence check using state equation in 4072 ms returned sat
[2020-05-18 15:38:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:38:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-05-18 15:38:39] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 44 ms returned sat
[2020-05-18 15:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:38:43] [INFO ] [Nat]Absence check using state equation in 4303 ms returned sat
[2020-05-18 15:38:44] [INFO ] [Nat]Added 130 Read/Feed constraints in 611 ms returned sat
[2020-05-18 15:38:44] [INFO ] Deduced a trap composed of 66 places in 83 ms
[2020-05-18 15:38:44] [INFO ] Deduced a trap composed of 66 places in 48 ms
[2020-05-18 15:38:44] [INFO ] Deduced a trap composed of 65 places in 70 ms
[2020-05-18 15:38:45] [INFO ] Deduced a trap composed of 66 places in 66 ms
[2020-05-18 15:38:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1854 ms
[2020-05-18 15:38:46] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 130 ms.
[2020-05-18 15:38:59] [INFO ] Added : 275 causal constraints over 55 iterations in 13111 ms. Result :unknown
[2020-05-18 15:38:59] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-05-18 15:38:59] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 57 ms returned sat
[2020-05-18 15:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:39:01] [INFO ] [Real]Absence check using state equation in 2678 ms returned sat
[2020-05-18 15:39:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:39:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-05-18 15:39:02] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 55 ms returned sat
[2020-05-18 15:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:39:06] [INFO ] [Nat]Absence check using state equation in 4645 ms returned sat
[2020-05-18 15:39:07] [INFO ] [Nat]Added 130 Read/Feed constraints in 689 ms returned sat
[2020-05-18 15:39:07] [INFO ] Deduced a trap composed of 233 places in 472 ms
[2020-05-18 15:39:08] [INFO ] Deduced a trap composed of 65 places in 483 ms
[2020-05-18 15:39:09] [INFO ] Deduced a trap composed of 405 places in 582 ms
[2020-05-18 15:39:09] [INFO ] Deduced a trap composed of 428 places in 436 ms
[2020-05-18 15:39:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2778 ms
[2020-05-18 15:39:10] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 139 ms.
[2020-05-18 15:39:21] [INFO ] Added : 160 causal constraints over 32 iterations in 11721 ms. Result :unknown
[2020-05-18 15:39:22] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2020-05-18 15:39:22] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 37 ms returned unsat
[2020-05-18 15:39:22] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-05-18 15:39:22] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned unsat
[2020-05-18 15:39:22] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2020-05-18 15:39:22] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 55 ms returned sat
[2020-05-18 15:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:39:24] [INFO ] [Real]Absence check using state equation in 2543 ms returned sat
[2020-05-18 15:39:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:39:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-05-18 15:39:25] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 39 ms returned sat
[2020-05-18 15:39:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:39:33] [INFO ] [Nat]Absence check using state equation in 7919 ms returned sat
[2020-05-18 15:39:34] [INFO ] [Nat]Added 130 Read/Feed constraints in 1725 ms returned sat
[2020-05-18 15:39:35] [INFO ] Deduced a trap composed of 65 places in 162 ms
[2020-05-18 15:39:35] [INFO ] Deduced a trap composed of 65 places in 216 ms
[2020-05-18 15:39:36] [INFO ] Deduced a trap composed of 67 places in 160 ms
[2020-05-18 15:39:36] [INFO ] Deduced a trap composed of 65 places in 121 ms
[2020-05-18 15:39:36] [INFO ] Deduced a trap composed of 65 places in 103 ms
[2020-05-18 15:39:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1915 ms
[2020-05-18 15:39:36] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 133 ms.
[2020-05-18 15:39:45] [INFO ] Added : 40 causal constraints over 8 iterations in 8316 ms. Result :unknown
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-05-18 15:39:45] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-18 15:39:45] [INFO ] Flatten gal took : 148 ms
FORMULA PolyORBLF-PT-S02J04T10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 15:39:45] [INFO ] Flatten gal took : 120 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 15:39:45] [INFO ] Applying decomposition
[2020-05-18 15:39:46] [INFO ] Flatten gal took : 119 ms

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="LTLFireability"
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 PolyORBLF-PT-S02J04T10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tajo-158961390300426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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