Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r485-tall-167912699500556.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is TCPcondis-PT-40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699500556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.1K Feb 26 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 16:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 16:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 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-LTLFireability-00
FORMULA_NAME TCPcondis-PT-40-LTLFireability-01
FORMULA_NAME TCPcondis-PT-40-LTLFireability-02
FORMULA_NAME TCPcondis-PT-40-LTLFireability-03
FORMULA_NAME TCPcondis-PT-40-LTLFireability-04
FORMULA_NAME TCPcondis-PT-40-LTLFireability-05
FORMULA_NAME TCPcondis-PT-40-LTLFireability-06
FORMULA_NAME TCPcondis-PT-40-LTLFireability-07
FORMULA_NAME TCPcondis-PT-40-LTLFireability-08
FORMULA_NAME TCPcondis-PT-40-LTLFireability-09
FORMULA_NAME TCPcondis-PT-40-LTLFireability-10
FORMULA_NAME TCPcondis-PT-40-LTLFireability-11
FORMULA_NAME TCPcondis-PT-40-LTLFireability-12
FORMULA_NAME TCPcondis-PT-40-LTLFireability-13
FORMULA_NAME TCPcondis-PT-40-LTLFireability-14
FORMULA_NAME TCPcondis-PT-40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679252648952

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-40
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 19:04:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 19:04:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:04:10] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 19:04:10] [WARNING] Unknown XML tag in source file: size
[2023-03-19 19:04:10] [WARNING] Unknown XML tag in source file: color
[2023-03-19 19:04:10] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-19 19:04:10] [INFO ] Transformed 30 places.
[2023-03-19 19:04:10] [INFO ] Transformed 32 transitions.
[2023-03-19 19:04:10] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TCPcondis-PT-40-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 19:04:10] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-19 19:04:10] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 19:04:10] [INFO ] Invariant cache hit.
[2023-03-19 19:04:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-19 19:04:10] [INFO ] Invariant cache hit.
[2023-03-19 19:04:10] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 22 out of 30 places after structural reductions.
[2023-03-19 19:04:11] [INFO ] Flatten gal took : 23 ms
[2023-03-19 19:04:11] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:04:11] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 23) seen :22
Finished Best-First random walk after 502 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=167 )
FORMULA TCPcondis-PT-40-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1||G(p2)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-19 19:04:11] [INFO ] Invariant cache hit.
[2023-03-19 19:04:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 19:04:11] [INFO ] Invariant cache hit.
[2023-03-19 19:04:11] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-19 19:04:11] [INFO ] Invariant cache hit.
[2023-03-19 19:04:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s5 1) (GEQ s17 1) (GEQ s11 1) (GEQ s27 1)), p2:(AND (GEQ s11 1) (GEQ s27 1)), p1:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 143 reset in 309 ms.
Product exploration explored 100000 steps with 147 reset in 275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 277 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 2) seen :1
Finished Best-First random walk after 462 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=231 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, 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 1 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 18 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 19:04:13] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:04:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 19:04:13] [INFO ] Invariant cache hit.
[2023-03-19 19:04:13] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-19 19:04:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:04:13] [INFO ] Invariant cache hit.
[2023-03-19 19:04:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 24/30 places, 24/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10030 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=771 ) properties (out of 2) seen :1
Finished Best-First random walk after 150 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 55 reset in 171 ms.
Product exploration explored 100000 steps with 73 reset in 286 ms.
Built C files in :
/tmp/ltsmin302232520044398173
[2023-03-19 19:04:15] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2023-03-19 19:04:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 19:04:15] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2023-03-19 19:04:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 19:04:15] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2023-03-19 19:04:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 19:04:15] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin302232520044398173
Running compilation step : cd /tmp/ltsmin302232520044398173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin302232520044398173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin302232520044398173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14111392816666899807.hoa' '--buchi-type=spotba'
LTSmin run took 79 ms.
FORMULA TCPcondis-PT-40-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-40-LTLFireability-00 finished in 3872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1||X(F((F(p3)&&p2)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-19 19:04:15] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-19 19:04:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 19:04:15] [INFO ] Invariant cache hit.
[2023-03-19 19:04:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-19 19:04:15] [INFO ] Invariant cache hit.
[2023-03-19 19:04:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s13 1) (GEQ s25 1)), p2:(AND (GEQ s13 1) (GEQ s25 1)), p3:(AND (GEQ s5 1) (GEQ s17 1)), p0:(LT s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15425 reset in 212 ms.
Product exploration explored 100000 steps with 15641 reset in 176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 8 factoid took 619 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 19:04:17] [INFO ] Invariant cache hit.
[2023-03-19 19:04:17] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p1) p0 (NOT p3)))), (F (AND (NOT p1) (NOT p0) (NOT p3)))]
Knowledge based reduction with 11 factoid took 908 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, 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.
[2023-03-19 19:04:18] [INFO ] Invariant cache hit.
[2023-03-19 19:04:18] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 19:04:18] [INFO ] Invariant cache hit.
[2023-03-19 19:04:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 19:04:18] [INFO ] Invariant cache hit.
[2023-03-19 19:04:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 3322 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=553 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 273 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 15466 reset in 94 ms.
Product exploration explored 100000 steps with 15464 reset in 96 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 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 9 place count 28 transition count 29
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 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 5 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 19:04:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 19:04:19] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-19 19:04:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 28/30 places, 30/32 transitions.
Built C files in :
/tmp/ltsmin1065416318160663629
[2023-03-19 19:04:19] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1065416318160663629
Running compilation step : cd /tmp/ltsmin1065416318160663629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 105 ms.
Running link step : cd /tmp/ltsmin1065416318160663629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1065416318160663629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2289958114951992835.hoa' '--buchi-type=spotba'
LTSmin run took 3529 ms.
FORMULA TCPcondis-PT-40-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-40-LTLFireability-02 finished in 8103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&F(p1)) U p2)||X((G(p1) U (p0&&G(p1))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-19 19:04:23] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:04:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 19:04:23] [INFO ] Invariant cache hit.
[2023-03-19 19:04:23] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-19 19:04:23] [INFO ] Invariant cache hit.
[2023-03-19 19:04:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s19 1)), p0:(GEQ s29 1), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, 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-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-03 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-19 19:04:24] [INFO ] Invariant cache hit.
[2023-03-19 19:04:24] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 19:04:24] [INFO ] Invariant cache hit.
[2023-03-19 19:04:24] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 19:04:24] [INFO ] Invariant cache hit.
[2023-03-19 19:04:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s5 1) (GEQ s21 1))) (NOT (AND (GEQ s9 1) (GEQ s25 1)))), p1:(AND (GEQ s9 1) (GEQ s25 1)), p0:(AND (GEQ s4 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2610 reset in 152 ms.
Product exploration explored 100000 steps with 2591 reset in 158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Finished random walk after 903 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=301 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
[2023-03-19 19:04:25] [INFO ] Invariant cache hit.
[2023-03-19 19:04:25] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 19:04:25] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 19:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:04:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-19 19:04:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:04:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 19:04:25] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 19:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:04:25] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 19:04:25] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 19:04:25] [INFO ] Added : 20 causal constraints over 6 iterations in 36 ms. Result :sat
Could not prove EG (AND p2 (NOT p0))
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-19 19:04:25] [INFO ] Invariant cache hit.
[2023-03-19 19:04:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 19:04:25] [INFO ] Invariant cache hit.
[2023-03-19 19:04:25] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-19 19:04:25] [INFO ] Invariant cache hit.
[2023-03-19 19:04:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 704 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=352 )
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 19:04:26] [INFO ] Invariant cache hit.
[2023-03-19 19:04:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 19:04:26] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-40-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-40-LTLFireability-04 finished in 2433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 28
Iterating global reduction 0 with 2 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 8 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 19:04:26] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:04:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 19:04:26] [INFO ] Invariant cache hit.
[2023-03-19 19:04:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 19:04:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:04:26] [INFO ] Invariant cache hit.
[2023-03-19 19:04:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s13 1) (AND (GEQ s4 1) (GEQ s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4749 reset in 146 ms.
Stack based approach found an accepted trace after 17698 steps with 837 reset with depth 23 and stack size 23 in 28 ms.
FORMULA TCPcondis-PT-40-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-07 finished in 325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 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 12 place count 25 transition count 25
Applied a total of 12 rules in 8 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-19 19:04:26] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 19:04:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 19:04:26] [INFO ] Invariant cache hit.
[2023-03-19 19:04:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-19 19:04:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:04:26] [INFO ] Invariant cache hit.
[2023-03-19 19:04:26] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s15 1) (LT s11 1)), p0:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Stack based approach found an accepted trace after 13399 steps with 0 reset with depth 13400 and stack size 4422 in 39 ms.
FORMULA TCPcondis-PT-40-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-08 finished in 447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0)) U p1)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 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 8 place count 27 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 10 place count 26 transition count 26
Applied a total of 10 rules in 8 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2023-03-19 19:04:27] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 19:04:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 19:04:27] [INFO ] Invariant cache hit.
[2023-03-19 19:04:27] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-19 19:04:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 19:04:27] [INFO ] Invariant cache hit.
[2023-03-19 19:04:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3494 reset in 133 ms.
Stack based approach found an accepted trace after 1581 steps with 52 reset with depth 13 and stack size 13 in 3 ms.
FORMULA TCPcondis-PT-40-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-09 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!(F(p0) U !p1)))||X(!p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-19 19:04:27] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 19:04:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 19:04:27] [INFO ] Invariant cache hit.
[2023-03-19 19:04:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 19:04:27] [INFO ] Invariant cache hit.
[2023-03-19 19:04:27] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, false, (NOT p1), p0, (AND (NOT p1) p0), false, false]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 1}]], initial=5, aps=[p1:(AND (GEQ s4 1) (GEQ s22 1)), p0:(AND (GEQ s2 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 67 ms.
Product exploration explored 100000 steps with 33333 reset in 59 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-40-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-40-LTLFireability-10 finished in 509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 6 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-19 19:04:28] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:04:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 19:04:28] [INFO ] Invariant cache hit.
[2023-03-19 19:04:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 19:04:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:04:28] [INFO ] Invariant cache hit.
[2023-03-19 19:04:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1865 reset in 150 ms.
Stack based approach found an accepted trace after 10080 steps with 188 reset with depth 11 and stack size 11 in 17 ms.
FORMULA TCPcondis-PT-40-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-11 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 16 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 19:04:28] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:04:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 19:04:28] [INFO ] Invariant cache hit.
[2023-03-19 19:04:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 19:04:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:04:28] [INFO ] Invariant cache hit.
[2023-03-19 19:04:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-12 automaton TGBA Formula[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:(AND (GEQ s8 1) (GEQ s17 1))], 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 1864 reset in 156 ms.
Stack based approach found an accepted trace after 13855 steps with 269 reset with depth 17 and stack size 17 in 22 ms.
FORMULA TCPcondis-PT-40-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-12 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-19 19:04:28] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 19:04:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 19:04:28] [INFO ] Invariant cache hit.
[2023-03-19 19:04:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 19:04:28] [INFO ] Invariant cache hit.
[2023-03-19 19:04:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-13 automaton TGBA Formula[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 (GEQ s2 1) (GEQ s20 1) (OR (LT s9 1) (LT s25 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-13 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||(G(p2)&&p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-19 19:04:29] [INFO ] Invariant cache hit.
[2023-03-19 19:04:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 19:04:29] [INFO ] Invariant cache hit.
[2023-03-19 19:04:29] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 19:04:29] [INFO ] Invariant cache hit.
[2023-03-19 19:04:29] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p2:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 268 ms.
Product exploration explored 100000 steps with 0 reset in 291 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 493 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Incomplete random walk after 10019 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-19 19:04:30] [INFO ] Invariant cache hit.
[2023-03-19 19:04:30] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (G (NOT (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p0 p2)), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (F (OR (AND (NOT p1) p0) (AND p0 (NOT p2)))), (F (AND p0 p2))]
Knowledge based reduction with 14 factoid took 673 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-19 19:04:31] [INFO ] Invariant cache hit.
[2023-03-19 19:04:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 19:04:31] [INFO ] Invariant cache hit.
[2023-03-19 19:04:31] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-19 19:04:31] [INFO ] Invariant cache hit.
[2023-03-19 19:04:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 491 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :5
Finished Best-First random walk after 247 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=247 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F p0), (F (AND p1 p2)), (F (OR (AND (NOT p1) p0) (AND p0 (NOT p2))))]
Knowledge based reduction with 11 factoid took 515 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 104 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 246 ms.
Product exploration explored 100000 steps with 0 reset in 273 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 30
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 9 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 9 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 19:04:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 19:04:33] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:04:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 28/30 places, 30/32 transitions.
Built C files in :
/tmp/ltsmin6292251582236370217
[2023-03-19 19:04:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6292251582236370217
Running compilation step : cd /tmp/ltsmin6292251582236370217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin6292251582236370217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6292251582236370217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15027023316101532449.hoa' '--buchi-type=spotba'
LTSmin run took 205 ms.
FORMULA TCPcondis-PT-40-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-40-LTLFireability-14 finished in 5206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(!p1)||G((p2 U p3)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 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
Applied a total of 10 rules in 8 ms. Remains 25 /30 variables (removed 5) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 25 cols
[2023-03-19 19:04:34] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 19:04:34] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 19:04:34] [INFO ] Invariant cache hit.
[2023-03-19 19:04:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 19:04:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:04:34] [INFO ] Invariant cache hit.
[2023-03-19 19:04:34] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 25/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (AND p1 (NOT p3))), true, (NOT p0), p1, (NOT p3), (NOT p3), (AND p1 (NOT p3))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(OR p3 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s13 1)), p3:(AND (GEQ s7 1) (GEQ s21 1)), p2:(LT s20 1), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-15 finished in 358 ms.
All properties solved by simple procedures.
Total runtime 24304 ms.

BK_STOP 1679252675478

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is TCPcondis-PT-40, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699500556"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;