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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
997.296 42672.00 53770.00 262.40 FFFFFFFFTFFTTFFF 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-162106746600852.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-40, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746600852
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.5K Mar 28 16:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-40-00
FORMULA_NAME TCPcondis-PT-40-01
FORMULA_NAME TCPcondis-PT-40-02
FORMULA_NAME TCPcondis-PT-40-03
FORMULA_NAME TCPcondis-PT-40-04
FORMULA_NAME TCPcondis-PT-40-05
FORMULA_NAME TCPcondis-PT-40-06
FORMULA_NAME TCPcondis-PT-40-07
FORMULA_NAME TCPcondis-PT-40-08
FORMULA_NAME TCPcondis-PT-40-09
FORMULA_NAME TCPcondis-PT-40-10
FORMULA_NAME TCPcondis-PT-40-11
FORMULA_NAME TCPcondis-PT-40-12
FORMULA_NAME TCPcondis-PT-40-13
FORMULA_NAME TCPcondis-PT-40-14
FORMULA_NAME TCPcondis-PT-40-15

=== Now, execution of the tool begins

BK_START 1621293108116

Running Version 0
[2021-05-17 23:11:50] [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 23:11:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 23:11:50] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 23:11:50] [WARNING] Unknown XML tag in source file: size
[2021-05-17 23:11:50] [WARNING] Unknown XML tag in source file: color
[2021-05-17 23:11:50] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-17 23:11:50] [INFO ] Transformed 30 places.
[2021-05-17 23:11:50] [INFO ] Transformed 32 transitions.
[2021-05-17 23:11:50] [INFO ] Parsed PT model containing 30 places and 32 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 23:11:50] [INFO ] Initial state test concluded for 2 properties.
FORMULA TCPcondis-PT-40-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 12 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 23:11:50] [INFO ] Computed 9 place invariants in 9 ms
[2021-05-17 23:11:50] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:50] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 23:11:50] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:50] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 23:11:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 23:11:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 23:11:50] [INFO ] Flatten gal took : 21 ms
FORMULA TCPcondis-PT-40-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 23:11:50] [INFO ] Flatten gal took : 6 ms
[2021-05-17 23:11:50] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 5617 steps, including 0 resets, run visited all 22 properties in 23 ms. (steps per millisecond=244 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U 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.
Applied a total of 0 rules in 2 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 23:11:50] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 23:11:50] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:50] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:50] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:50] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:50] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s8), p0:(OR (GT s7 s27) (LEQ 3 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2312 reset in 345 ms.
Product exploration explored 100000 steps with 2309 reset in 283 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2287 reset in 197 ms.
Product exploration explored 100000 steps with 2313 reset in 221 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 18 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 23:11:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 23:11:52] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 23:11:52] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 3439 reset in 325 ms.
Stack based approach found an accepted trace after 10314 steps with 364 reset with depth 18 and stack size 17 in 42 ms.
FORMULA TCPcondis-PT-40-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-00 finished in 2331 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0 U (G(p0)||(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.
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 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 28 transition count 26
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 10 place count 26 transition count 26
Applied a total of 10 rules in 11 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2021-05-17 23:11:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:53] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2021-05-17 23:11:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2021-05-17 23:11:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2021-05-17 23:11:53] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:53] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s21), p0:(GT s8 s23)], nbAcceptance=2, 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 262 ms.
Stack based approach found an accepted trace after 28280 steps with 0 reset with depth 28281 and stack size 28281 in 79 ms.
FORMULA TCPcondis-PT-40-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-01 finished in 575 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
Applied a total of 8 rules in 4 ms. Remains 26 /30 variables (removed 4) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 23:11:53] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:53] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 23:11:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-17 23:11:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 23:11:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 28/32 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ s22 s24), p1:(LEQ s16 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-02 finished in 159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], 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.
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 23:11:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:53] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:53] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:53] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-03 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:(AND (LEQ s24 s8) (LEQ s1 s9))], 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 13 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-03 finished in 216 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(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 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 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
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 18 place count 22 transition count 22
Applied a total of 18 rules in 6 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:54] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:54] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-17 23:11:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:54] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s9 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6705 reset in 187 ms.
Stack based approach found an accepted trace after 4594 steps with 278 reset with depth 130 and stack size 130 in 9 ms.
FORMULA TCPcondis-PT-40-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-04 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((!p0&&(p1 U (p2||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 23:11:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:54] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:54] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR p0 (AND (NOT p1) (NOT p2))), true, (OR p0 (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : TCPcondis-PT-40-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s23), p2:(AND (GT 1 s23) (GT s17 s21)), p1:(GT s17 s21)], 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 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-05 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((!p0||(p1&&(X(p2) U ((p0&&X(p2))||X(G(p2)))))))))))], workingDir=/home/mcc/execution]
Support contains 5 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 23:11:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:54] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), true]
Running random walk in product with property : TCPcondis-PT-40-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(GT 1 s23), p1:(GT s5 s0), p2:(GT s24 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 3 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-06 finished in 249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(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.
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
Applied a total of 10 rules in 3 ms. Remains 25 /30 variables (removed 5) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 25 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:54] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 27 rows 25 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 23:11:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2021-05-17 23:11:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 25 cols
[2021-05-17 23:11:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s20), p1:(LEQ s4 s9)], nbAcceptance=2, 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 262 ms.
Product exploration explored 100000 steps with 0 reset in 264 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 249 ms.
Stack based approach found an accepted trace after 32603 steps with 0 reset with depth 32604 and stack size 32604 in 82 ms.
FORMULA TCPcondis-PT-40-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-07 finished in 1086 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 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 17 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 23:11:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:55] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 23:11:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:55] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-17 23:11:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 23:11:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:55] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 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 2557 reset in 168 ms.
Stack based approach found an accepted trace after 8068 steps with 212 reset with depth 54 and stack size 54 in 15 ms.
FORMULA TCPcondis-PT-40-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-10 finished in 310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||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 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 4 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 23:11:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2021-05-17 23:11:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2021-05-17 23:11:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2021-05-17 23:11:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:56] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 44 ms :[false, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT 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 197 ms.
Stack based approach found an accepted trace after 4944 steps with 0 reset with depth 4945 and stack size 4945 in 11 ms.
FORMULA TCPcondis-PT-40-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-13 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)&&F(G(p2))))))], 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.
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 23:11:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:56] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:56] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:56] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-40-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s7 s19), p1:(GT s23 s19), p2:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-14 finished in 202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((X(G(p1))||G((p1 U X(p2)))))))], 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.
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 23:11:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:11:56] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:11:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:56] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-40-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 9}, { cond=(NOT p1), acceptance={} source=1 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 13}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 3}], [{ cond=(NOT p2), acceptance={} source=9 dest: 11}], [{ cond=(NOT p1), acceptance={} source=10 dest: 9}, { cond=true, acceptance={} source=10 dest: 10}, { cond=p1, acceptance={} source=10 dest: 12}], [{ cond=true, acceptance={0, 1} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=12 dest: 12}], [{ cond=(NOT p1), acceptance={} source=13 dest: 11}, { cond=p1, acceptance={} source=13 dest: 13}]], initial=5, aps=[p1:(LEQ 3 s9), p2:(LEQ s2 s7), p0:(GT 1 s19)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33269 reset in 113 ms.
Product exploration explored 100000 steps with 33298 reset in 144 ms.
Knowledge obtained : [(NOT p1), p2, p0]
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 33366 reset in 112 ms.
Product exploration explored 100000 steps with 33352 reset in 124 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, false, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Support contains 4 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 4 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 23:11:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 23:11:58] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:11:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 33352 reset in 109 ms.
Product exploration explored 100000 steps with 33437 reset in 113 ms.
[2021-05-17 23:11:58] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:11:58] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:11:58] [INFO ] Time to serialize gal into /tmp/LTL14954040394414273559.gal : 1 ms
[2021-05-17 23:11:58] [INFO ] Time to serialize properties into /tmp/LTL4155177749847858812.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/LTL14954040394414273559.gal, -t, CGAL, -LTL, /tmp/LTL4155177749847858812.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/LTL14954040394414273559.gal -t CGAL -LTL /tmp/LTL4155177749847858812.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(xFIN<1)")U(X((X(G("(LISTEN>=3)")))||(G(("(LISTEN>=3)")U(X("(CLOSING<=FINWAIT2)"))))))))
Formula 0 simplified : !("(xFIN<1)" U X(XG"(LISTEN>=3)" | G("(LISTEN>=3)" U X"(CLOSING<=FINWAIT2)")))
Detected timeout of ITS tools.
[2021-05-17 23:12:13] [INFO ] Flatten gal took : 12 ms
[2021-05-17 23:12:13] [INFO ] Applying decomposition
[2021-05-17 23:12:13] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8570329476513918631.txt, -o, /tmp/graph8570329476513918631.bin, -w, /tmp/graph8570329476513918631.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8570329476513918631.bin, -l, -1, -v, -w, /tmp/graph8570329476513918631.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:12:13] [INFO ] Decomposing Gal with order
[2021-05-17 23:12:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:12:13] [INFO ] Removed a total of 19 redundant transitions.
[2021-05-17 23:12:14] [INFO ] Flatten gal took : 32 ms
[2021-05-17 23:12:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-17 23:12:14] [INFO ] Time to serialize gal into /tmp/LTL16096418324856654615.gal : 2 ms
[2021-05-17 23:12:14] [INFO ] Time to serialize properties into /tmp/LTL3780745189199291757.ltl : 1 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/LTL16096418324856654615.gal, -t, CGAL, -LTL, /tmp/LTL3780745189199291757.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/LTL16096418324856654615.gal -t CGAL -LTL /tmp/LTL3780745189199291757.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(gi1.gu5.xFIN<1)")U(X((X(G("(gi1.gu3.LISTEN>=3)")))||(G(("(gi1.gu3.LISTEN>=3)")U(X("(gu1.CLOSING<=gu1.FINWAIT2)"))))))))
Formula 0 simplified : !("(gi1.gu5.xFIN<1)" U X(XG"(gi1.gu3.LISTEN>=3)" | G("(gi1.gu3.LISTEN>=3)" U X"(gu1.CLOSING<=gu1.FINWAIT2)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9929787809169189310
[2021-05-17 23:12:29] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9929787809169189310
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9929787809169189310]
Compilation finished in 238 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9929787809169189310]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp0==true) U X((X([]((LTLAPp1==true)))||[](((LTLAPp1==true) U X((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9929787809169189310]
LTSmin run took 318 ms.
FORMULA TCPcondis-PT-40-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-40-15 finished in 32966 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621293150788

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

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