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

About the Execution of ITS-Tools for TCPcondis-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
321.876 6302.00 11673.00 205.90 TFFFFFFFFFFTFFFF 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.r254-tall-162106746500796.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 TCPcondis-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746500796
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 24K May 5 16:52 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 TCPcondis-PT-05-00
FORMULA_NAME TCPcondis-PT-05-01
FORMULA_NAME TCPcondis-PT-05-02
FORMULA_NAME TCPcondis-PT-05-03
FORMULA_NAME TCPcondis-PT-05-04
FORMULA_NAME TCPcondis-PT-05-05
FORMULA_NAME TCPcondis-PT-05-06
FORMULA_NAME TCPcondis-PT-05-07
FORMULA_NAME TCPcondis-PT-05-08
FORMULA_NAME TCPcondis-PT-05-09
FORMULA_NAME TCPcondis-PT-05-10
FORMULA_NAME TCPcondis-PT-05-11
FORMULA_NAME TCPcondis-PT-05-12
FORMULA_NAME TCPcondis-PT-05-13
FORMULA_NAME TCPcondis-PT-05-14
FORMULA_NAME TCPcondis-PT-05-15

=== Now, execution of the tool begins

BK_START 1621283071182

Running Version 0
[2021-05-17 20:24:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-17 20:24:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:24:32] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 20:24:32] [WARNING] Unknown XML tag in source file: size
[2021-05-17 20:24:32] [WARNING] Unknown XML tag in source file: color
[2021-05-17 20:24:32] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2021-05-17 20:24:32] [INFO ] Transformed 30 places.
[2021-05-17 20:24:32] [INFO ] Transformed 32 transitions.
[2021-05-17 20:24:32] [INFO ] Parsed PT model containing 30 places and 32 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:24:32] [INFO ] Initial state test concluded for 3 properties.
FORMULA TCPcondis-PT-05-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:32] [INFO ] Computed 9 place invariants in 11 ms
[2021-05-17 20:24:33] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:33] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 20:24:33] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 20:24:33] [INFO ] Flatten gal took : 22 ms
FORMULA TCPcondis-PT-05-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:24:33] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:24:33] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 922 steps, including 0 resets, run visited all 19 properties in 9 ms. (steps per millisecond=102 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 17 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:24:33] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:33] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:24:33] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:33] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-17 20:24:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:24:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Stack based approach found an accepted trace after 627 steps with 0 reset with depth 628 and stack size 628 in 4 ms.
FORMULA TCPcondis-PT-05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-01 finished in 546 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 26
Applied a total of 11 rules in 6 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:24:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:33] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:24:33] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 20:24:33] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2021-05-17 20:24:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:24:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:34] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s16 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-02 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 2 s0)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-03 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 26
Applied a total of 11 rules in 5 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-17 20:24:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:34] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-05-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s9 s21) (LEQ s4 s11)), p1:(LEQ s4 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-04 finished in 169 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 8 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2021-05-17 20:24:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s12 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-05 finished in 128 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 15 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-17 20:24:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : TCPcondis-PT-05-06 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s29 s3), p1:(AND (LEQ s24 s20) (LEQ s5 s0))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-06 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((p1&&X((p1 U (!p0||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:34] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : TCPcondis-PT-05-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 s27), p0:(LEQ s4 s10)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 107 steps with 2 reset in 1 ms.
FORMULA TCPcondis-PT-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-07 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 6 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:34] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-17 20:24:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:34] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s12)], 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 72 reset in 193 ms.
Stack based approach found an accepted trace after 890 steps with 1 reset with depth 784 and stack size 784 in 3 ms.
FORMULA TCPcondis-PT-05-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-10 finished in 299 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 5 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:35] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 20:24:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-17 20:24:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s18)], 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 15865 reset in 128 ms.
Stack based approach found an accepted trace after 7490 steps with 1211 reset with depth 61 and stack size 61 in 16 ms.
FORMULA TCPcondis-PT-05-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-12 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 5 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:35] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-17 20:24:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-05-13 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 s10), p1:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 201 ms.
Stack based approach found an accepted trace after 192 steps with 0 reset with depth 193 and stack size 193 in 1 ms.
FORMULA TCPcondis-PT-05-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-13 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 5 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:35] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-17 20:24:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:24:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-05-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s16), p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Stack based approach found an accepted trace after 682 steps with 0 reset with depth 683 and stack size 676 in 2 ms.
FORMULA TCPcondis-PT-05-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-14 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 24 transition count 25
Applied a total of 13 rules in 4 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2021-05-17 20:24:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:36] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 25 rows 24 cols
[2021-05-17 20:24:36] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-17 20:24:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 24 cols
[2021-05-17 20:24:36] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:36] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-05-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s20), p2:(GT 2 s2), p1:(GT 1 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1352 reset in 192 ms.
Stack based approach found an accepted trace after 33111 steps with 438 reset with depth 79 and stack size 79 in 65 ms.
FORMULA TCPcondis-PT-05-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-15 finished in 415 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621283077484

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="TCPcondis-PT-05"
export BK_EXAMINATION="LTLCardinality"
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 TCPcondis-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106746500796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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