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-158961390400450.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-S02J06T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390400450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 11K Apr 12 05:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 12 05:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 04:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 04:58 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 9.3K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 10 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 10 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 9 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 9 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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.7M 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-S02J06T10-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-15

=== Now, execution of the tool begins

BK_START 1589819198987

[2020-05-18 16:26:40] [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 16:26:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 16:26:40] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2020-05-18 16:26:40] [INFO ] Transformed 844 places.
[2020-05-18 16:26:40] [INFO ] Transformed 1812 transitions.
[2020-05-18 16:26:40] [INFO ] Parsed PT model containing 844 places and 1812 transitions in 224 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 13 resets, run finished after 602 ms. (steps per millisecond=166 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0]
[2020-05-18 16:26:41] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2020-05-18 16:26:41] [INFO ] Computed 58 place invariants in 114 ms
[2020-05-18 16:26:41] [INFO ] [Real]Absence check using 13 positive place invariants in 35 ms returned sat
[2020-05-18 16:26:42] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 64 ms returned sat
[2020-05-18 16:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:26:46] [INFO ] [Real]Absence check using state equation in 4055 ms returned sat
[2020-05-18 16:26:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:26:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2020-05-18 16:26:46] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 59 ms returned sat
[2020-05-18 16:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:26:52] [INFO ] [Nat]Absence check using state equation in 6506 ms returned sat
[2020-05-18 16:26:52] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-05-18 16:26:55] [INFO ] [Nat]Added 130 Read/Feed constraints in 2227 ms returned sat
[2020-05-18 16:26:55] [INFO ] Deduced a trap composed of 73 places in 246 ms
[2020-05-18 16:26:57] [INFO ] Deduced a trap composed of 73 places in 188 ms
[2020-05-18 16:26:59] [INFO ] Deduced a trap composed of 73 places in 127 ms
[2020-05-18 16:27:01] [INFO ] Deduced a trap composed of 73 places in 224 ms
[2020-05-18 16:27:01] [INFO ] Deduced a trap composed of 73 places in 169 ms
[2020-05-18 16:27:02] [INFO ] Deduced a trap composed of 74 places in 83 ms
[2020-05-18 16:27:04] [INFO ] Deduced a trap composed of 73 places in 787 ms
[2020-05-18 16:27:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 9355 ms
[2020-05-18 16:27:04] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 208 ms.
[2020-05-18 16:27:06] [INFO ] Added : 10 causal constraints over 2 iterations in 1720 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-18 16:27:06] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2020-05-18 16:27:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 57 ms returned unsat
[2020-05-18 16:27:06] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2020-05-18 16:27:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 83 ms returned sat
[2020-05-18 16:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:27:10] [INFO ] [Real]Absence check using state equation in 4266 ms returned sat
[2020-05-18 16:27:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:27:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2020-05-18 16:27:11] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 60 ms returned sat
[2020-05-18 16:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:27:15] [INFO ] [Nat]Absence check using state equation in 4076 ms returned sat
[2020-05-18 16:27:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 16:27:18] [INFO ] [Nat]Added 130 Read/Feed constraints in 3369 ms returned sat
[2020-05-18 16:27:19] [INFO ] Deduced a trap composed of 73 places in 753 ms
[2020-05-18 16:27:20] [INFO ] Deduced a trap composed of 99 places in 732 ms
[2020-05-18 16:27:22] [INFO ] Deduced a trap composed of 74 places in 851 ms
[2020-05-18 16:27:23] [INFO ] Deduced a trap composed of 74 places in 1042 ms
[2020-05-18 16:27:25] [INFO ] Deduced a trap composed of 398 places in 678 ms
[2020-05-18 16:27:25] [INFO ] Deduced a trap composed of 445 places in 688 ms
[2020-05-18 16:27:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 7757 ms
[2020-05-18 16:27:26] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 216 ms.
[2020-05-18 16:27:30] [INFO ] Added : 20 causal constraints over 4 iterations in 4638 ms. Result :unknown
[2020-05-18 16:27:31] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2020-05-18 16:27:31] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 78 ms returned sat
[2020-05-18 16:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:27:34] [INFO ] [Real]Absence check using state equation in 3594 ms returned sat
[2020-05-18 16:27:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:27:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-05-18 16:27:35] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 82 ms returned sat
[2020-05-18 16:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:27:45] [INFO ] [Nat]Absence check using state equation in 10363 ms returned sat
[2020-05-18 16:27:46] [INFO ] [Nat]Added 130 Read/Feed constraints in 861 ms returned sat
[2020-05-18 16:27:47] [INFO ] Deduced a trap composed of 440 places in 706 ms
[2020-05-18 16:27:48] [INFO ] Deduced a trap composed of 424 places in 650 ms
[2020-05-18 16:27:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1901 ms
[2020-05-18 16:27:48] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 220 ms.
[2020-05-18 16:27:54] [INFO ] Added : 85 causal constraints over 17 iterations in 6650 ms. Result :unknown
[2020-05-18 16:27:55] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2020-05-18 16:27:55] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 83 ms returned sat
[2020-05-18 16:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:27:58] [INFO ] [Real]Absence check using state equation in 3756 ms returned sat
[2020-05-18 16:27:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:27:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 71 ms returned sat
[2020-05-18 16:27:59] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 103 ms returned sat
[2020-05-18 16:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:28:09] [INFO ] [Nat]Absence check using state equation in 10127 ms returned sat
[2020-05-18 16:28:10] [INFO ] [Nat]Added 130 Read/Feed constraints in 868 ms returned sat
[2020-05-18 16:28:10] [INFO ] Deduced a trap composed of 440 places in 679 ms
[2020-05-18 16:28:11] [INFO ] Deduced a trap composed of 424 places in 708 ms
[2020-05-18 16:28:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1872 ms
[2020-05-18 16:28:12] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 111 ms.
[2020-05-18 16:28:18] [INFO ] Added : 65 causal constraints over 13 iterations in 6854 ms. Result :unknown
[2020-05-18 16:28:19] [INFO ] [Real]Absence check using 13 positive place invariants in 31 ms returned unsat
[2020-05-18 16:28:19] [INFO ] [Real]Absence check using 13 positive place invariants in 31 ms returned unsat
[2020-05-18 16:28:19] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2020-05-18 16:28:19] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 72 ms returned sat
[2020-05-18 16:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:28:24] [INFO ] [Real]Absence check using state equation in 4788 ms returned sat
[2020-05-18 16:28:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:28:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-05-18 16:28:24] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 60 ms returned sat
[2020-05-18 16:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:28:30] [INFO ] [Nat]Absence check using state equation in 5706 ms returned sat
[2020-05-18 16:28:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 16:28:33] [INFO ] [Nat]Added 130 Read/Feed constraints in 3305 ms returned sat
[2020-05-18 16:28:33] [INFO ] Deduced a trap composed of 73 places in 261 ms
[2020-05-18 16:28:34] [INFO ] Deduced a trap composed of 73 places in 245 ms
[2020-05-18 16:28:34] [INFO ] Deduced a trap composed of 73 places in 251 ms
[2020-05-18 16:28:34] [INFO ] Deduced a trap composed of 73 places in 195 ms
[2020-05-18 16:28:35] [INFO ] Deduced a trap composed of 73 places in 202 ms
[2020-05-18 16:28:35] [INFO ] Deduced a trap composed of 74 places in 121 ms
[2020-05-18 16:28:35] [INFO ] Deduced a trap composed of 74 places in 68 ms
[2020-05-18 16:28:35] [INFO ] Deduced a trap composed of 73 places in 37 ms
[2020-05-18 16:28:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2178 ms
[2020-05-18 16:28:35] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 109 ms.
[2020-05-18 16:28:44] [INFO ] Added : 120 causal constraints over 24 iterations in 8648 ms. Result :unknown
[2020-05-18 16:28:44] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2020-05-18 16:28:44] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 64 ms returned unsat
[2020-05-18 16:28:44] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2020-05-18 16:28:44] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 49 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-18 16:28:45] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-18 16:28:45] [INFO ] Flatten gal took : 238 ms
FORMULA PolyORBLF-PT-S02J06T10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 16:28:45] [INFO ] Flatten gal took : 131 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 16:28:45] [INFO ] Applying decomposition
[2020-05-18 16:28:45] [INFO ] Input system was already deterministic with 1652 transitions.
[2020-05-18 16:28:45] [INFO ] Too many transitions (1652) to apply POR reductions. Disabling POR matrices.
[2020-05-18 16:28:45] [INFO ] Flatten gal took : 198 ms
[2020-05-18 16:28:45] [INFO ] Built C files in 440ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
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/graph9191737266477245793.txt, -o, /tmp/graph9191737266477245793.bin, -w, /tmp/graph9191737266477245793.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/graph9191737266477245793.bin, -l, -1, -v, -w, /tmp/graph9191737266477245793.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 16:28:46] [INFO ] Decomposing Gal with order
[2020-05-18 16:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 16:28:46] [INFO ] Removed a total of 1243 redundant transitions.
[2020-05-18 16:28:46] [INFO ] Flatten gal took : 343 ms
[2020-05-18 16:28:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 452 labels/synchronizations in 63 ms.
[2020-05-18 16:28:46] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 28 ms
[2020-05-18 16:28:46] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !((G(F(!(G(X((X((F("((((((((((i1.u14.P_1160_9>=4)||(i1.u14.P_1160_8>=4))||(i1.u14.P_1160_6>=4))||(i1.u14.P_1160_3>=4))||(i1.u14.P_1160_1>=4))||(i1.u14.P_1160_5>=4))||(i1.u14.P_1160_2>=4))||(i1.u14.P_1160_10>=4))||(i1.u14.P_1160_4>=4))||(i1.u14.P_1160_7>=4))"))||((G("(((((((((((i8.i0.i2.u136.cPollingAbort>=1)&&(i8.i1.i0.u96.EnablePollingB_1>=1))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i13.u64.EnablePollingB_2>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i8.i0.i0.u10.EnablePollingB_5>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i15.u146.EnablePollingB_6>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i7.u49.EnablePollingB_3>=1)))||((i17.u94.EnablePollingB_4>=1)&&(i8.i0.i2.u136.cPollingAbort>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i0.u89.EnablePollingB_9>=1)))||((i3.u82.EnablePollingB_10>=1)&&(i8.i0.i2.u136.cPollingAbort>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i4.u50.EnablePollingB_7>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i16.u126.EnablePollingB_8>=1)))"))&&("(((((((((((i8.i0.i2.u136.PollingAbort>=1)&&(i8.i0.i1.u53.ScheduleTaskB_5>=1))||((i15.u44.ScheduleTaskB_6>=1)&&(i8.i0.i2.u136.PollingAbort>=1)))||((i4.u13.ScheduleTaskB_7>=1)&&(i8.i0.i2.u136.PollingAbort>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i17.u66.ScheduleTaskB_4>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i0.u149.ScheduleTaskB_9>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i3.u102.ScheduleTaskB_10>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i14.u100.ScheduleTaskB_3>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i8.i1.i1.u59.ScheduleTaskB_1>=1)))||((i16.u111.ScheduleTaskB_8>=1)&&(i8.i0.i2.u136.PollingAbort>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i13.u95.ScheduleTaskB_2>=1)))"))))&&("(((((((((((i8.i0.i2.u136.ORB_Lock>=1)&&(i3.u124.RunE_10>=1))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i0.u145.RunE_9>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i4.u24.RunE_7>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i15.u47.RunE_6>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i16.u11.RunE_8>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i8.i0.i0.u18.RunE_5>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i8.i1.i0.u84.RunE_1>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i14.u127.RunE_3>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i17.u153.RunE_4>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i13.u144.RunE_2>=1)))"))))))))
Formula 0 simplified : !GF!GX("(((((((((((i8.i0.i2.u136.ORB_Lock>=1)&&(i3.u124.RunE_10>=1))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i0.u145.RunE_9>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i4.u24.RunE_7>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i15.u47.RunE_6>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i16.u11.RunE_8>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i8.i0.i0.u18.RunE_5>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i8.i1.i0.u84.RunE_1>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i14.u127.RunE_3>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i17.u153.RunE_4>=1)))||((i8.i0.i2.u136.ORB_Lock>=1)&&(i13.u144.RunE_2>=1)))" & X(F"((((((((((i1.u14.P_1160_9>=4)||(i1.u14.P_1160_8>=4))||(i1.u14.P_1160_6>=4))||(i1.u14.P_1160_3>=4))||(i1.u14.P_1160_1>=4))||(i1.u14.P_1160_5>=4))||(i1.u14.P_1160_2>=4))||(i1.u14.P_1160_10>=4))||(i1.u14.P_1160_4>=4))||(i1.u14.P_1160_7>=4))" | ("(((((((((((i8.i0.i2.u136.PollingAbort>=1)&&(i8.i0.i1.u53.ScheduleTaskB_5>=1))||((i15.u44.ScheduleTaskB_6>=1)&&(i8.i0.i2.u136.PollingAbort>=1)))||((i4.u13.ScheduleTaskB_7>=1)&&(i8.i0.i2.u136.PollingAbort>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i17.u66.ScheduleTaskB_4>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i0.u149.ScheduleTaskB_9>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i3.u102.ScheduleTaskB_10>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i14.u100.ScheduleTaskB_3>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i8.i1.i1.u59.ScheduleTaskB_1>=1)))||((i16.u111.ScheduleTaskB_8>=1)&&(i8.i0.i2.u136.PollingAbort>=1)))||((i8.i0.i2.u136.PollingAbort>=1)&&(i13.u95.ScheduleTaskB_2>=1)))" & G"(((((((((((i8.i0.i2.u136.cPollingAbort>=1)&&(i8.i1.i0.u96.EnablePollingB_1>=1))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i13.u64.EnablePollingB_2>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i8.i0.i0.u10.EnablePollingB_5>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i15.u146.EnablePollingB_6>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i7.u49.EnablePollingB_3>=1)))||((i17.u94.EnablePollingB_4>=1)&&(i8.i0.i2.u136.cPollingAbort>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i0.u89.EnablePollingB_9>=1)))||((i3.u82.EnablePollingB_10>=1)&&(i8.i0.i2.u136.cPollingAbort>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i4.u50.EnablePollingB_7>=1)))||((i8.i0.i2.u136.cPollingAbort>=1)&&(i16.u126.EnablePollingB_8>=1)))")))
built 105 ordering constraints for composite.
built 33 ordering constraints for composite.
built 33 ordering constraints for composite.
built 197 ordering constraints for composite.
built 68 ordering constraints for composite.
built 34 ordering constraints for composite.
built 33 ordering constraints for composite.
built 113 ordering constraints for composite.
built 18 ordering constraints for composite.
built 104 ordering constraints for composite.
built 82 ordering constraints for composite.
built 81 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 79 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 18 ordering constraints for composite.
built 17 ordering constraints for composite.
built 47 ordering constraints for composite.
built 12 ordering constraints for composite.
built 17 ordering constraints for composite.
built 18 ordering constraints for composite.
built 17 ordering constraints for composite.
Compilation finished in 15902 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 74 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](<>(!( [](X(( X(( <>((LTLAP0==true))) || ( ( []((LTLAP1==true)) ) && ( (LTLAP2==true) )) ) ) && ( (LTLAP3==true) )))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](<>(!( [](X(( X(( <>((LTLAP0==true))) || ( ( []((LTLAP1==true)) ) && ( (LTLAP2==true) )) ) ) && ( (LTLAP3==true) )))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](<>(!( [](X(( X(( <>((LTLAP0==true))) || ( ( []((LTLAP1==true)) ) && ( (LTLAP2==true) )) ) ) && ( (LTLAP3==true) )))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-18 16:49:30] [INFO ] Flatten gal took : 683 ms
[2020-05-18 16:49:30] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 124 ms
[2020-05-18 16:49:30] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 17 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((G(F(!(G(X((X((F("((((((((((P_1160_9>=4)||(P_1160_8>=4))||(P_1160_6>=4))||(P_1160_3>=4))||(P_1160_1>=4))||(P_1160_5>=4))||(P_1160_2>=4))||(P_1160_10>=4))||(P_1160_4>=4))||(P_1160_7>=4))"))||((G("(((((((((((cPollingAbort>=1)&&(EnablePollingB_1>=1))||((cPollingAbort>=1)&&(EnablePollingB_2>=1)))||((cPollingAbort>=1)&&(EnablePollingB_5>=1)))||((cPollingAbort>=1)&&(EnablePollingB_6>=1)))||((cPollingAbort>=1)&&(EnablePollingB_3>=1)))||((EnablePollingB_4>=1)&&(cPollingAbort>=1)))||((cPollingAbort>=1)&&(EnablePollingB_9>=1)))||((EnablePollingB_10>=1)&&(cPollingAbort>=1)))||((cPollingAbort>=1)&&(EnablePollingB_7>=1)))||((cPollingAbort>=1)&&(EnablePollingB_8>=1)))"))&&("(((((((((((PollingAbort>=1)&&(ScheduleTaskB_5>=1))||((ScheduleTaskB_6>=1)&&(PollingAbort>=1)))||((ScheduleTaskB_7>=1)&&(PollingAbort>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_4>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_9>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_10>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_3>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_1>=1)))||((ScheduleTaskB_8>=1)&&(PollingAbort>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_2>=1)))"))))&&("(((((((((((ORB_Lock>=1)&&(RunE_10>=1))||((ORB_Lock>=1)&&(RunE_9>=1)))||((ORB_Lock>=1)&&(RunE_7>=1)))||((ORB_Lock>=1)&&(RunE_6>=1)))||((ORB_Lock>=1)&&(RunE_8>=1)))||((ORB_Lock>=1)&&(RunE_5>=1)))||((ORB_Lock>=1)&&(RunE_1>=1)))||((ORB_Lock>=1)&&(RunE_3>=1)))||((ORB_Lock>=1)&&(RunE_4>=1)))||((ORB_Lock>=1)&&(RunE_2>=1)))"))))))))
Formula 0 simplified : !GF!GX("(((((((((((ORB_Lock>=1)&&(RunE_10>=1))||((ORB_Lock>=1)&&(RunE_9>=1)))||((ORB_Lock>=1)&&(RunE_7>=1)))||((ORB_Lock>=1)&&(RunE_6>=1)))||((ORB_Lock>=1)&&(RunE_8>=1)))||((ORB_Lock>=1)&&(RunE_5>=1)))||((ORB_Lock>=1)&&(RunE_1>=1)))||((ORB_Lock>=1)&&(RunE_3>=1)))||((ORB_Lock>=1)&&(RunE_4>=1)))||((ORB_Lock>=1)&&(RunE_2>=1)))" & X(F"((((((((((P_1160_9>=4)||(P_1160_8>=4))||(P_1160_6>=4))||(P_1160_3>=4))||(P_1160_1>=4))||(P_1160_5>=4))||(P_1160_2>=4))||(P_1160_10>=4))||(P_1160_4>=4))||(P_1160_7>=4))" | ("(((((((((((PollingAbort>=1)&&(ScheduleTaskB_5>=1))||((ScheduleTaskB_6>=1)&&(PollingAbort>=1)))||((ScheduleTaskB_7>=1)&&(PollingAbort>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_4>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_9>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_10>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_3>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_1>=1)))||((ScheduleTaskB_8>=1)&&(PollingAbort>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_2>=1)))" & G"(((((((((((cPollingAbort>=1)&&(EnablePollingB_1>=1))||((cPollingAbort>=1)&&(EnablePollingB_2>=1)))||((cPollingAbort>=1)&&(EnablePollingB_5>=1)))||((cPollingAbort>=1)&&(EnablePollingB_6>=1)))||((cPollingAbort>=1)&&(EnablePollingB_3>=1)))||((EnablePollingB_4>=1)&&(cPollingAbort>=1)))||((cPollingAbort>=1)&&(EnablePollingB_9>=1)))||((EnablePollingB_10>=1)&&(cPollingAbort>=1)))||((cPollingAbort>=1)&&(EnablePollingB_7>=1)))||((cPollingAbort>=1)&&(EnablePollingB_8>=1)))")))
Detected timeout of ITS tools.
[2020-05-18 17:10:15] [INFO ] Flatten gal took : 1636 ms
[2020-05-18 17:10:17] [INFO ] Input system was already deterministic with 1652 transitions.
[2020-05-18 17:10:17] [INFO ] Transformed 844 places.
[2020-05-18 17:10:17] [INFO ] Transformed 1652 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-18 17:10:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 14 ms
[2020-05-18 17:10:47] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 11 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(!(G(X((X((F("((((((((((P_1160_9>=4)||(P_1160_8>=4))||(P_1160_6>=4))||(P_1160_3>=4))||(P_1160_1>=4))||(P_1160_5>=4))||(P_1160_2>=4))||(P_1160_10>=4))||(P_1160_4>=4))||(P_1160_7>=4))"))||((G("(((((((((((cPollingAbort>=1)&&(EnablePollingB_1>=1))||((cPollingAbort>=1)&&(EnablePollingB_2>=1)))||((cPollingAbort>=1)&&(EnablePollingB_5>=1)))||((cPollingAbort>=1)&&(EnablePollingB_6>=1)))||((cPollingAbort>=1)&&(EnablePollingB_3>=1)))||((EnablePollingB_4>=1)&&(cPollingAbort>=1)))||((cPollingAbort>=1)&&(EnablePollingB_9>=1)))||((EnablePollingB_10>=1)&&(cPollingAbort>=1)))||((cPollingAbort>=1)&&(EnablePollingB_7>=1)))||((cPollingAbort>=1)&&(EnablePollingB_8>=1)))"))&&("(((((((((((PollingAbort>=1)&&(ScheduleTaskB_5>=1))||((ScheduleTaskB_6>=1)&&(PollingAbort>=1)))||((ScheduleTaskB_7>=1)&&(PollingAbort>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_4>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_9>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_10>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_3>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_1>=1)))||((ScheduleTaskB_8>=1)&&(PollingAbort>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_2>=1)))"))))&&("(((((((((((ORB_Lock>=1)&&(RunE_10>=1))||((ORB_Lock>=1)&&(RunE_9>=1)))||((ORB_Lock>=1)&&(RunE_7>=1)))||((ORB_Lock>=1)&&(RunE_6>=1)))||((ORB_Lock>=1)&&(RunE_8>=1)))||((ORB_Lock>=1)&&(RunE_5>=1)))||((ORB_Lock>=1)&&(RunE_1>=1)))||((ORB_Lock>=1)&&(RunE_3>=1)))||((ORB_Lock>=1)&&(RunE_4>=1)))||((ORB_Lock>=1)&&(RunE_2>=1)))"))))))))
Formula 0 simplified : !GF!GX("(((((((((((ORB_Lock>=1)&&(RunE_10>=1))||((ORB_Lock>=1)&&(RunE_9>=1)))||((ORB_Lock>=1)&&(RunE_7>=1)))||((ORB_Lock>=1)&&(RunE_6>=1)))||((ORB_Lock>=1)&&(RunE_8>=1)))||((ORB_Lock>=1)&&(RunE_5>=1)))||((ORB_Lock>=1)&&(RunE_1>=1)))||((ORB_Lock>=1)&&(RunE_3>=1)))||((ORB_Lock>=1)&&(RunE_4>=1)))||((ORB_Lock>=1)&&(RunE_2>=1)))" & X(F"((((((((((P_1160_9>=4)||(P_1160_8>=4))||(P_1160_6>=4))||(P_1160_3>=4))||(P_1160_1>=4))||(P_1160_5>=4))||(P_1160_2>=4))||(P_1160_10>=4))||(P_1160_4>=4))||(P_1160_7>=4))" | ("(((((((((((PollingAbort>=1)&&(ScheduleTaskB_5>=1))||((ScheduleTaskB_6>=1)&&(PollingAbort>=1)))||((ScheduleTaskB_7>=1)&&(PollingAbort>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_4>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_9>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_10>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_3>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_1>=1)))||((ScheduleTaskB_8>=1)&&(PollingAbort>=1)))||((PollingAbort>=1)&&(ScheduleTaskB_2>=1)))" & G"(((((((((((cPollingAbort>=1)&&(EnablePollingB_1>=1))||((cPollingAbort>=1)&&(EnablePollingB_2>=1)))||((cPollingAbort>=1)&&(EnablePollingB_5>=1)))||((cPollingAbort>=1)&&(EnablePollingB_6>=1)))||((cPollingAbort>=1)&&(EnablePollingB_3>=1)))||((EnablePollingB_4>=1)&&(cPollingAbort>=1)))||((cPollingAbort>=1)&&(EnablePollingB_9>=1)))||((EnablePollingB_10>=1)&&(cPollingAbort>=1)))||((cPollingAbort>=1)&&(EnablePollingB_7>=1)))||((cPollingAbort>=1)&&(EnablePollingB_8>=1)))")))

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-S02J06T10"
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-S02J06T10, 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-158961390400450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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