fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075406900397
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for JoinFreeModules-PT-0004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
241.260 5238.00 9494.00 208.50 FFFFFFFFFTTFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406900397.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 JoinFreeModules-PT-0004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406900397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 26 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 26 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 24 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 24 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 23K May 5 16:51 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 JoinFreeModules-PT-0004-00
FORMULA_NAME JoinFreeModules-PT-0004-01
FORMULA_NAME JoinFreeModules-PT-0004-02
FORMULA_NAME JoinFreeModules-PT-0004-03
FORMULA_NAME JoinFreeModules-PT-0004-04
FORMULA_NAME JoinFreeModules-PT-0004-05
FORMULA_NAME JoinFreeModules-PT-0004-06
FORMULA_NAME JoinFreeModules-PT-0004-07
FORMULA_NAME JoinFreeModules-PT-0004-08
FORMULA_NAME JoinFreeModules-PT-0004-09
FORMULA_NAME JoinFreeModules-PT-0004-10
FORMULA_NAME JoinFreeModules-PT-0004-11
FORMULA_NAME JoinFreeModules-PT-0004-12
FORMULA_NAME JoinFreeModules-PT-0004-13
FORMULA_NAME JoinFreeModules-PT-0004-14
FORMULA_NAME JoinFreeModules-PT-0004-15

=== Now, execution of the tool begins

BK_START 1620841248022

Running Version 0
[2021-05-12 17:40:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 17:40:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 17:40:49] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-12 17:40:49] [INFO ] Transformed 21 places.
[2021-05-12 17:40:49] [INFO ] Transformed 33 transitions.
[2021-05-12 17:40:49] [INFO ] Parsed PT model containing 21 places and 33 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 17:40:49] [INFO ] Initial state test concluded for 4 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0004-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 9 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:49] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-12 17:40:49] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:49] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 17:40:49] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:49] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:49] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
[2021-05-12 17:40:50] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-12 17:40:50] [INFO ] Flatten gal took : 20 ms
FORMULA JoinFreeModules-PT-0004-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 17:40:50] [INFO ] Flatten gal took : 4 ms
[2021-05-12 17:40:50] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 640 steps, including 4 resets, run visited all 19 properties in 12 ms. (steps per millisecond=53 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U X(p1))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-12 17:40:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:50] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:50] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0004-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(LT s15 3), p1:(GEQ s10 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1782 steps with 6 reset in 31 ms.
FORMULA JoinFreeModules-PT-0004-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-00 finished in 369 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)&&(F(!p0)||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:50] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 17:40:50] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (AND p0 (NOT p2))), true]
Running random walk in product with property : JoinFreeModules-PT-0004-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(LT s8 4), p1:(LT s14 5), p2:(LT s13 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0004-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-01 finished in 264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(G(!p0)))||G((!p0||X(G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:50] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:50] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0, true, p0, p0]
Running random walk in product with property : JoinFreeModules-PT-0004-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LT s8 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-02 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 15 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-12 17:40:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0004-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s13 3), p0:(GEQ s11 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-03 finished in 164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1 U (p2||G(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-0004-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s19 5), p3:(LT s9 5), p0:(GEQ s10 5), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-04 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X(X(X(F(p1))))) U !p1))], workingDir=/home/mcc/execution]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 102 ms :[p1, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0004-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s18 3), p0:(LT s8 4)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-05 finished in 190 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0004-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s15 5), p0:(GEQ s3 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-06 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(p1 U (p2||G(p1)))&&F(((p3&&X(F(p0)))||G(F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0004-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 p3 p2) (AND p0 p3 p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s0 3), p2:(AND (LT s2 1) (LT s5 5)), p1:(LT s5 5), p3:(LT s16 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 335 steps with 31 reset in 2 ms.
FORMULA JoinFreeModules-PT-0004-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-07 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-12 17:40:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:51] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:40:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0004-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s14 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-11 finished in 134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((!p0&&F(p1)&&G(p2)))&&X(!p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:52] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:52] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:52] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:40:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:40:52] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) (NOT p1) p0), p0, (OR (NOT p2) (NOT p1) p0), (NOT p2), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0004-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(OR p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s15 3), p2:(GEQ s2 1), p1:(GEQ s10 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-14 finished in 214 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620841253260

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="JoinFreeModules-PT-0004"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0004, 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 r121-tall-162075406900397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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