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-162075406800333.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 IBM5964-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 36K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 139K 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 5.8K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 171K 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 IBM5964-PT-none-00
FORMULA_NAME IBM5964-PT-none-01
FORMULA_NAME IBM5964-PT-none-02
FORMULA_NAME IBM5964-PT-none-03
FORMULA_NAME IBM5964-PT-none-04
FORMULA_NAME IBM5964-PT-none-05
FORMULA_NAME IBM5964-PT-none-06
FORMULA_NAME IBM5964-PT-none-07
FORMULA_NAME IBM5964-PT-none-08
FORMULA_NAME IBM5964-PT-none-09
FORMULA_NAME IBM5964-PT-none-10
FORMULA_NAME IBM5964-PT-none-11
FORMULA_NAME IBM5964-PT-none-12
FORMULA_NAME IBM5964-PT-none-13
FORMULA_NAME IBM5964-PT-none-14
FORMULA_NAME IBM5964-PT-none-15

=== Now, execution of the tool begins

BK_START 1620837572177

Running Version 0
[2021-05-12 16:39:41] [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 16:39:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:39:41] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-12 16:39:41] [INFO ] Transformed 263 places.
[2021-05-12 16:39:41] [INFO ] Transformed 139 transitions.
[2021-05-12 16:39:41] [INFO ] Parsed PT model containing 263 places and 139 transitions in 98 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 16:39:41] [INFO ] Initial state test concluded for 2 properties.
Support contains 62 out of 263 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 89 places
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 165 transition count 139
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 157 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 157 transition count 131
Applied a total of 114 rules in 28 ms. Remains 157 /263 variables (removed 106) and now considering 131/139 (removed 8) transitions.
// Phase 1: matrix 131 rows 157 cols
[2021-05-12 16:39:41] [INFO ] Computed 33 place invariants in 16 ms
[2021-05-12 16:39:41] [INFO ] Implicit Places using invariants in 139 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
// Phase 1: matrix 131 rows 156 cols
[2021-05-12 16:39:41] [INFO ] Computed 32 place invariants in 14 ms
[2021-05-12 16:39:41] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Starting structural reductions, iteration 1 : 156/263 places, 131/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 130
Applied a total of 2 rules in 16 ms. Remains 155 /156 variables (removed 1) and now considering 130/131 (removed 1) transitions.
// Phase 1: matrix 130 rows 155 cols
[2021-05-12 16:39:41] [INFO ] Computed 32 place invariants in 5 ms
[2021-05-12 16:39:41] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 130 rows 155 cols
[2021-05-12 16:39:41] [INFO ] Computed 32 place invariants in 6 ms
[2021-05-12 16:39:42] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 155/263 places, 130/139 transitions.
[2021-05-12 16:39:42] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 16:39:42] [INFO ] Flatten gal took : 35 ms
FORMULA IBM5964-PT-none-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:39:42] [INFO ] Flatten gal took : 13 ms
[2021-05-12 16:39:42] [INFO ] Input system was already deterministic with 130 transitions.
Incomplete random walk after 100001 steps, including 2044 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 28) seen :3
Running SMT prover for 25 properties.
// Phase 1: matrix 130 rows 155 cols
[2021-05-12 16:39:42] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-12 16:39:42] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 4 ms returned sat
[2021-05-12 16:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:39:42] [INFO ] SMT Verify possible in real domain returnedunsat :1 sat :0 real:24
[2021-05-12 16:39:42] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 4 ms returned sat
[2021-05-12 16:39:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:39:43] [INFO ] SMT Verify possible in nat domain returned unsat :24 sat :1
Successfully simplified 25 atomic propositions for a total of 14 simplifications.
[2021-05-12 16:39:43] [INFO ] Initial state test concluded for 5 properties.
FORMULA IBM5964-PT-none-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 130/130 transitions.
Ensure Unique test removed 24 places
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 131 transition count 51
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 52 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 51 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 50 transition count 48
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 163 place count 50 transition count 33
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 195 place count 33 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 195 place count 33 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 32 transition count 32
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 23 rules applied. Total rules applied 220 place count 20 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 222 place count 20 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 226 place count 18 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 18 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 17 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 17 transition count 13
Applied a total of 230 rules in 40 ms. Remains 17 /155 variables (removed 138) and now considering 13/130 (removed 117) transitions.
// Phase 1: matrix 13 rows 17 cols
[2021-05-12 16:39:43] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:39:43] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2021-05-12 16:39:43] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-12 16:39:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-12 16:39:43] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2021-05-12 16:39:43] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:39:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/155 places, 13/130 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : IBM5964-PT-none-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA IBM5964-PT-none-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-03 finished in 309 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 130/130 transitions.
Ensure Unique test removed 25 places
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 130 transition count 51
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 51 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 50 transition count 49
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 161 place count 50 transition count 34
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 193 place count 33 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 193 place count 33 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 32 transition count 33
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 215 place count 22 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 217 place count 22 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 21 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 20 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 223 place count 20 transition count 17
Applied a total of 223 rules in 20 ms. Remains 20 /155 variables (removed 135) and now considering 17/130 (removed 113) transitions.
// Phase 1: matrix 17 rows 20 cols
[2021-05-12 16:39:43] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:39:43] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2021-05-12 16:39:43] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-12 16:39:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 44 ms to find 1 implicit places.
[2021-05-12 16:39:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-12 16:39:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:39:43] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 19/155 places, 17/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2021-05-12 16:39:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-12 16:39:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:39:43] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 19/155 places, 17/130 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : IBM5964-PT-none-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s13 1) (GEQ s14 1)) (AND (GEQ s3 1) (GEQ s4 1) (GEQ s16 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22471 reset in 214 ms.
Product exploration explored 100000 steps with 22533 reset in 154 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 17
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22501 reset in 110 ms.
Product exploration explored 100000 steps with 22496 reset in 123 ms.
[2021-05-12 16:39:44] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:39:44] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:39:44] [INFO ] Time to serialize gal into /tmp/LTL5443256362035100081.gal : 1 ms
[2021-05-12 16:39:44] [INFO ] Time to serialize properties into /tmp/LTL4247823361095621204.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5443256362035100081.gal, -t, CGAL, -LTL, /tmp/LTL4247823361095621204.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5443256362035100081.gal -t CGAL -LTL /tmp/LTL4247823361095621204.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((((callToTask_s00005971_output_s00000956>=1)&&(callToTask_s00005971_output_s00000938>=1))&&(callToTask_s00005971_output_s00000959>=1))||(((merge_s00001290_input_s00001009>=1)&&(merge_s00001290_input_s00000950>=1))&&(process_s00000383__s00005964_input_s00001431>=1)))")))
Formula 0 simplified : !F"((((callToTask_s00005971_output_s00000956>=1)&&(callToTask_s00005971_output_s00000938>=1))&&(callToTask_s00005971_output_s00000959>=1))||(((merge_s00001290_input_s00001009>=1)&&(merge_s00001290_input_s00000950>=1))&&(process_s00000383__s00005964_input_s00001431>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t11.t121.t128.t61.t23, t56.t14.t92.t115.t120.t127.t68.t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/6/2/17
Computing Next relation with stutter on 10 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.021373,16328,1,0,45,674,51,26,501,667,82
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IBM5964-PT-none-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IBM5964-PT-none-06 finished in 1008 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620837599089

--------------------
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="IBM5964-PT-none"
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 IBM5964-PT-none, 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-162075406800333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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