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

About the Execution of ITS-Tools for SafeBus-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15781.480 1800000.00 2231516.00 93312.60 [undef] Time out reached

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.r162-oct2-158972927100266.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 SafeBus-PT-20, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-oct2-158972927100266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 35K Apr 12 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 411K Apr 11 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 11 13:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 41K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 485K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 10 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 10 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 443K Apr 10 00:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 10 00:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 11M Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1589992314959

[2020-05-20 16:31:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800]
[2020-05-20 16:31:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 16:31:57] [INFO ] Load time of PNML (sax parser for PT used): 448 ms
[2020-05-20 16:31:57] [INFO ] Transformed 1026 places.
[2020-05-20 16:31:58] [INFO ] Transformed 10461 transitions.
[2020-05-20 16:31:58] [INFO ] Parsed PT model containing 1026 places and 10461 transitions in 587 ms.
Reduce places removed 20 places and 0 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 114 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 11 ms.39523KB memory used
Starting structural reductions, iteration 0 : 1006/1006 places, 10461/10461 transitions.
Applied a total of 0 rules in 6284 ms. Remains 1006 /1006 variables (removed 0) and now considering 10461/10461 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 10461/10461 transitions.
Starting structural reductions, iteration 0 : 1006/1006 places, 10461/10461 transitions.
Applied a total of 0 rules in 5470 ms. Remains 1006 /1006 variables (removed 0) and now considering 10461/10461 (removed 0) transitions.
[2020-05-20 16:32:09] [INFO ] Flow matrix only has 2482 transitions (discarded 7979 similar events)
// Phase 1: matrix 2482 rows 1006 cols
[2020-05-20 16:32:10] [INFO ] Computed 85 place invariants in 222 ms
[2020-05-20 16:32:32] [INFO ] Implicit Places using invariants in 22884 ms returned [926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 22969 ms to find 20 implicit places.
[2020-05-20 16:32:32] [INFO ] Flow matrix only has 2482 transitions (discarded 7979 similar events)
// Phase 1: matrix 2482 rows 986 cols
[2020-05-20 16:32:32] [INFO ] Computed 65 place invariants in 77 ms
[2020-05-20 16:33:03] [INFO ] Performed 4695/10461 'is it Dead' test of which 215 returned DEAD in 30 seconds.
[2020-05-20 16:33:33] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= s961 1) (>= s968 1))") after 60137 ms
Found 400 dead transitions using SMT.
Drop transitions removed 400 transitions
Dead transitions reduction (with SMT) removed 400 transitions :[8380, 8359, 8338, 8317, 8296, 8275, 8254, 8233, 8212, 8191, 8170, 8149, 8128, 8107, 8086, 8065, 8044, 8023, 8002, 7981, 7980, 7959, 7938, 7917, 7896, 7875, 7854, 7833, 7812, 7791, 7770, 7749, 7728, 7707, 7686, 7665, 7644, 7623, 7602, 7581, 7580, 7559, 7538, 7517, 7496, 7475, 7454, 7433, 7412, 7391, 7370, 7349, 7328, 7307, 7286, 7265, 7244, 7223, 7202, 7181, 7180, 7159, 7138, 7117, 7096, 7075, 7054, 7033, 7012, 6991, 6970, 6949, 6928, 6907, 6886, 6865, 6844, 6823, 6802, 6781, 6780, 6759, 6738, 6717, 6696, 6675, 6654, 6633, 6612, 6591, 6570, 6549, 6528, 6507, 6486, 6465, 6444, 6423, 6402, 6381, 6380, 6359, 6338, 6317, 6296, 6275, 6254, 6233, 6212, 6191, 6170, 6149, 6128, 6107, 6086, 6065, 6044, 6023, 6002, 5981, 5980, 5959, 5938, 5917, 5896, 5875, 5854, 5833, 5812, 5791, 5770, 5749, 5728, 5707, 5686, 5665, 5644, 5623, 5602, 5581, 5580, 5559, 5538, 5517, 5496, 5475, 5454, 5433, 5412, 5391, 5370, 5349, 5328, 5307, 5286, 5265, 5244, 5223, 5202, 5181, 5180, 5159, 5138, 5117, 5096, 5075, 5054, 5033, 5012, 4991, 4970, 4949, 4928, 4907, 4886, 4865, 4844, 4823, 4802, 4781, 4780, 4759, 4738, 4717, 4696, 4675, 4654, 4633, 4612, 4591, 4570, 4549, 4528, 4507, 4486, 4465, 4444, 4423, 4402, 4381, 4380, 4359, 4338, 4317, 4296, 4275, 4254, 4233, 4212, 4191, 4170, 4149, 4128, 4107, 4086, 4065, 4044, 4023, 4002, 3981, 3980, 3959, 3938, 3917, 3896, 3875, 3854, 3833, 3812, 3791, 3770, 3749, 3728, 3707, 3686, 3665, 3644, 3623, 3602, 3581, 3580, 3559, 3538, 3517, 3496, 3475, 3454, 3433, 3412, 3391, 3370, 3349, 3328, 3307, 3286, 3265, 3244, 3223, 3202, 3181, 3180, 3159, 3138, 3117, 3096, 3075, 3054, 3033, 3012, 2991, 2970, 2949, 2928, 2907, 2886, 2865, 2844, 2823, 2802, 2781, 2780, 2759, 2738, 2717, 2696, 2675, 2654, 2633, 2612, 2591, 2570, 2549, 2528, 2507, 2486, 2465, 2444, 2423, 2402, 2381, 2380, 2359, 2338, 2317, 2296, 2275, 2254, 2233, 2212, 2191, 2170, 2149, 2128, 2107, 2086, 2065, 2044, 2023, 2002, 1981, 1980, 1959, 1938, 1917, 1896, 1875, 1854, 1833, 1812, 1791, 1770, 1749, 1728, 1707, 1686, 1665, 1644, 1623, 1602, 1581, 1580, 1559, 1538, 1517, 1496, 1475, 1454, 1433, 1412, 1391, 1370, 1349, 1328, 1307, 1286, 1265, 1244, 1223, 1202, 1181, 1180, 1159, 1138, 1117, 1096, 1075, 1054, 1033, 1012, 991, 970, 949, 928, 907, 886, 865, 844, 823, 802, 781, 780, 759, 738, 717, 696, 675, 654, 633, 612, 591, 570, 549, 528, 507, 486, 465, 444, 423, 402, 381]
Starting structural reductions, iteration 1 : 986/1006 places, 10061/10461 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 986 transition count 10041
Deduced a syphon composed of 20 places in 8 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 966 transition count 10041
Applied a total of 40 rules in 5035 ms. Remains 966 /986 variables (removed 20) and now considering 10041/10061 (removed 20) transitions.
[2020-05-20 16:33:38] [INFO ] Flow matrix only has 2462 transitions (discarded 7579 similar events)
// Phase 1: matrix 2462 rows 966 cols
[2020-05-20 16:33:38] [INFO ] Computed 65 place invariants in 46 ms
[2020-05-20 16:33:45] [INFO ] Implicit Places using invariants in 7374 ms returned []
Implicit Place search using SMT only with invariants took 7390 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 966/1006 places, 10041/10461 transitions.
Interrupted Parikh directed walk after 1152461 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=38 )
Random directed walk for 1250000 steps, including 0 resets, run took 23273 ms (no deadlock found). (steps per millisecond=53 )
[2020-05-20 16:34:38] [INFO ] Flow matrix only has 2462 transitions (discarded 7579 similar events)
// Phase 1: matrix 2462 rows 966 cols
[2020-05-20 16:34:38] [INFO ] Computed 65 place invariants in 143 ms
[2020-05-20 16:34:44] [INFO ] [Real]Absence check using 24 positive place invariants in 37 ms returned sat
[2020-05-20 16:34:45] [INFO ] [Real]Absence check using 24 positive and 41 generalized place invariants in 257 ms returned sat
[2020-05-20 16:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 16:35:05] [INFO ] [Real]Absence check using state equation in 20737 ms returned sat
[2020-05-20 16:35:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 16:35:16] [INFO ] [Nat]Absence check using 24 positive place invariants in 262 ms returned sat
[2020-05-20 16:35:17] [INFO ] [Nat]Absence check using 24 positive and 41 generalized place invariants in 1123 ms returned sat
[2020-05-20 16:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 16:35:29] [INFO ] [Nat]Absence check using state equation in 11072 ms returned sat
[2020-05-20 16:35:29] [INFO ] State equation strengthened by 421 read => feed constraints.
[2020-05-20 16:35:30] [INFO ] [Nat]Added 421 Read/Feed constraints in 1418 ms returned sat
[2020-05-20 16:35:34] [INFO ] Deduced a trap composed of 99 places in 3136 ms
[2020-05-20 16:35:39] [INFO ] Deduced a trap composed of 81 places in 5727 ms
[2020-05-20 16:35:40] [INFO ] Deduced a trap composed of 99 places in 939 ms
[2020-05-20 16:35:44] [INFO ] Deduced a trap composed of 81 places in 3040 ms
[2020-05-20 16:35:46] [INFO ] Deduced a trap composed of 81 places in 2146 ms
[2020-05-20 16:35:47] [INFO ] Deduced a trap composed of 81 places in 706 ms
[2020-05-20 16:35:47] [INFO ] Deduced a trap composed of 81 places in 609 ms
[2020-05-20 16:35:48] [INFO ] Deduced a trap composed of 99 places in 360 ms
[2020-05-20 16:35:49] [INFO ] Deduced a trap composed of 81 places in 921 ms
[2020-05-20 16:35:50] [INFO ] Deduced a trap composed of 99 places in 520 ms
[2020-05-20 16:35:51] [INFO ] Deduced a trap composed of 81 places in 1126 ms
[2020-05-20 16:35:52] [INFO ] Deduced a trap composed of 99 places in 496 ms
[2020-05-20 16:35:52] [INFO ] Deduced a trap composed of 81 places in 582 ms
[2020-05-20 16:35:53] [INFO ] Deduced a trap composed of 99 places in 586 ms
[2020-05-20 16:35:54] [INFO ] Deduced a trap composed of 81 places in 648 ms
[2020-05-20 16:35:55] [INFO ] Deduced a trap composed of 99 places in 612 ms
[2020-05-20 16:35:56] [INFO ] Deduced a trap composed of 81 places in 804 ms
[2020-05-20 16:36:01] [INFO ] Deduced a trap composed of 99 places in 5510 ms
[2020-05-20 16:36:05] [INFO ] Deduced a trap composed of 81 places in 3366 ms
[2020-05-20 16:36:05] [INFO ] Deduced a trap composed of 99 places in 361 ms
[2020-05-20 16:36:06] [INFO ] Deduced a trap composed of 81 places in 979 ms
[2020-05-20 16:36:07] [INFO ] Deduced a trap composed of 81 places in 383 ms
[2020-05-20 16:36:08] [INFO ] Deduced a trap composed of 99 places in 510 ms
[2020-05-20 16:36:09] [INFO ] Deduced a trap composed of 81 places in 841 ms
[2020-05-20 16:36:21] [INFO ] Deduced a trap composed of 99 places in 11957 ms
[2020-05-20 16:36:26] [INFO ] Deduced a trap composed of 81 places in 4943 ms
[2020-05-20 16:36:29] [INFO ] Deduced a trap composed of 81 places in 3095 ms
[2020-05-20 16:36:31] [INFO ] Deduced a trap composed of 99 places in 1773 ms
[2020-05-20 16:36:32] [INFO ] Deduced a trap composed of 81 places in 869 ms
[2020-05-20 16:36:35] [INFO ] Deduced a trap composed of 99 places in 3072 ms
[2020-05-20 16:36:37] [INFO ] Deduced a trap composed of 81 places in 1368 ms
[2020-05-20 16:36:37] [INFO ] Deduced a trap composed of 81 places in 363 ms
[2020-05-20 16:36:39] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 68375 ms
[2020-05-20 16:36:39] [INFO ] Computed and/alt/rep : 10021/537560/2442 causal constraints in 867 ms.
[2020-05-20 16:37:00] [INFO ] Added : 120 causal constraints over 24 iterations in 21170 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 685 ms.
Parikh directed walk for 340100 steps, including 1000 resets, run took 10190 ms. (steps per millisecond=33 )
Random directed walk for 500002 steps, including 0 resets, run took 8541 ms (no deadlock found). (steps per millisecond=58 )
Random walk for 500000 steps, including 0 resets, run took 12384 ms (no deadlock found). (steps per millisecond=40 )
Random directed walk for 500008 steps, including 0 resets, run took 8176 ms (no deadlock found). (steps per millisecond=61 )
Random walk for 500000 steps, including 0 resets, run took 11991 ms (no deadlock found). (steps per millisecond=41 )
[2020-05-20 16:37:55] [INFO ] Flatten gal took : 2181 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 16:37:56] [INFO ] Applying decomposition
[2020-05-20 16:37:57] [INFO ] Input system was already deterministic with 10461 transitions.
[2020-05-20 16:37:57] [INFO ] Too many transitions (10461) to apply POR reductions. Disabling POR matrices.
[2020-05-20 16:37:57] [INFO ] Flatten gal took : 871 ms
[2020-05-20 16:37:58] [INFO ] Built C files in 2164ms 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/graph3326652091318389289.txt, -o, /tmp/graph3326652091318389289.bin, -w, /tmp/graph3326652091318389289.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/graph3326652091318389289.bin, -l, -1, -v, -w, /tmp/graph3326652091318389289.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 16:37:59] [INFO ] Decomposing Gal with order
[2020-05-20 16:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 16:38:03] [INFO ] Removed a total of 29445 redundant transitions.
[2020-05-20 16:38:04] [INFO ] Flatten gal took : 4250 ms
[2020-05-20 16:38:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2040 labels/synchronizations in 752 ms.
[2020-05-20 16:38:06] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 118 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/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], 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/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
built 189 ordering constraints for composite.
built 171 ordering constraints for composite.
built 188 ordering constraints for composite.
built 149 ordering constraints for composite.
built 366 ordering constraints for composite.
Compilation finished in 295161 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 3001 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -d], 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, -p, --pins-guards, --when, -d], 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, -p, --pins-guards, --when, -d], 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-20 16:50:17] [INFO ] Flatten gal took : 1289 ms
[2020-05-20 16:50:17] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 68 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/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK, --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/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK --gen-order FOLLOW
No direction supplied, using forward translation only.
ITS-tools command line returned an error code 137
[2020-05-20 17:00:35] [INFO ] Flatten gal took : 2409 ms
[2020-05-20 17:00:37] [INFO ] Input system was already deterministic with 10461 transitions.
[2020-05-20 17:00:37] [INFO ] Transformed 1006 places.
[2020-05-20 17:00:37] [INFO ] Transformed 10461 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-20 17:01:07] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 31 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/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK, --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/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK --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.

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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 ReachabilityDeadlock -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 1800 -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="SafeBus-PT-20"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-PT-20, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-oct2-158972927100266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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