About the Execution of ITS-Tools for TCPcondis-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1777.928 | 41514.00 | 125992.00 | 250.20 | FFFFFFTFFFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545800468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TCPcondis-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545800468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 8.2K Apr 29 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 29 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 24K May 10 09:34 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-20-LTLFireability-00
FORMULA_NAME TCPcondis-PT-20-LTLFireability-01
FORMULA_NAME TCPcondis-PT-20-LTLFireability-02
FORMULA_NAME TCPcondis-PT-20-LTLFireability-03
FORMULA_NAME TCPcondis-PT-20-LTLFireability-04
FORMULA_NAME TCPcondis-PT-20-LTLFireability-05
FORMULA_NAME TCPcondis-PT-20-LTLFireability-06
FORMULA_NAME TCPcondis-PT-20-LTLFireability-07
FORMULA_NAME TCPcondis-PT-20-LTLFireability-08
FORMULA_NAME TCPcondis-PT-20-LTLFireability-09
FORMULA_NAME TCPcondis-PT-20-LTLFireability-10
FORMULA_NAME TCPcondis-PT-20-LTLFireability-11
FORMULA_NAME TCPcondis-PT-20-LTLFireability-12
FORMULA_NAME TCPcondis-PT-20-LTLFireability-13
FORMULA_NAME TCPcondis-PT-20-LTLFireability-14
FORMULA_NAME TCPcondis-PT-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653140637663
Running Version 202205111006
[2022-05-21 13:43:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 13:43:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 13:43:58] [WARNING] Skipping unknown tool specific annotation : Tina
[2022-05-21 13:43:58] [WARNING] Unknown XML tag in source file: size
[2022-05-21 13:43:58] [WARNING] Unknown XML tag in source file: color
[2022-05-21 13:43:58] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2022-05-21 13:43:58] [INFO ] Transformed 30 places.
[2022-05-21 13:43:58] [INFO ] Transformed 32 transitions.
[2022-05-21 13:43:58] [INFO ] Parsed PT model containing 30 places and 32 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TCPcondis-PT-20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-20-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-20-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-20-LTLFireability-12 FALSE 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
[2022-05-21 13:43:59] [INFO ] Computed 9 place invariants in 12 ms
[2022-05-21 13:43:59] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:43:59] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-21 13:43:59] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:43:59] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 13:43:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Support contains 22 out of 30 places after structural reductions.
[2022-05-21 13:43:59] [INFO ] Flatten gal took : 20 ms
[2022-05-21 13:43:59] [INFO ] Flatten gal took : 6 ms
[2022-05-21 13:43:59] [INFO ] Input system was already deterministic with 32 transitions.
Support contains 21 out of 30 places (down from 22) after GAL structural reductions.
Incomplete random walk after 10018 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 19) seen :18
Finished Best-First random walk after 513 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=256 )
FORMULA TCPcondis-PT-20-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(((F(p0) U G(X(p1)))&&X(X(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 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 23 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-21 13:44:00] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 13:44:00] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-21 13:44:00] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 13:44:00] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2022-05-21 13:44:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-21 13:44:00] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-21 13:44:00] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 484 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=(NOT p0), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s16 1)), p1:(AND (GEQ s6 1) (GEQ s17 1)), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2993 reset in 325 ms.
Stack based approach found an accepted trace after 26613 steps with 761 reset with depth 26 and stack size 26 in 66 ms.
FORMULA TCPcondis-PT-20-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-00 finished in 1148 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!(G(X(p0)) U p0)||F(p1)) U X(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
[2022-05-21 13:44:01] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 13:44:01] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:01] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:01] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:01] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(GEQ s24 1), p2:(AND (GEQ s12 1) (GEQ s26 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8825 reset in 187 ms.
Product exploration explored 100000 steps with 9129 reset in 240 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) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 486 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1)]
Finished random walk after 442 steps, including 0 resets, run visited all 7 properties in 4 ms. (steps per millisecond=110 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 580 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 13:44:03] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 13:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:44:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-21 13:44:03] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 13:44:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:44:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 13:44:03] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-21 13:44:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:44:03] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-21 13:44:03] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 13:44:04] [INFO ] Added : 26 causal constraints over 6 iterations in 64 ms. Result :sat
Could not prove EG (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.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:04] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:04] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:04] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:04] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p2)))]
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 473 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1)]
Finished random walk after 421 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=140 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p2)))]
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 653 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-21 13:44:06] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 13:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:44:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-21 13:44:06] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 13:44:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:44:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 13:44:06] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-21 13:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:44:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 13:44:06] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 13:44:06] [INFO ] Added : 26 causal constraints over 6 iterations in 29 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 9042 reset in 162 ms.
Product exploration explored 100000 steps with 8962 reset in 148 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1)]
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 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 9 rules in 13 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2022-05-21 13:44:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2022-05-21 13:44:07] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 13:44:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 10020 reset in 223 ms.
Product exploration explored 100000 steps with 9734 reset in 216 ms.
Built C files in :
/tmp/ltsmin15752560418444738749
[2022-05-21 13:44:07] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15752560418444738749
Running compilation step : cd /tmp/ltsmin15752560418444738749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin15752560418444738749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15752560418444738749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15813938364460675987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 3 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:22] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:22] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:22] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:22] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:22] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin12882707342563468266
[2022-05-21 13:44:22] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12882707342563468266
Running compilation step : cd /tmp/ltsmin12882707342563468266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 97 ms.
Running link step : cd /tmp/ltsmin12882707342563468266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12882707342563468266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2586788515950795709.hoa' '--buchi-type=spotba'
LTSmin run took 10041 ms.
FORMULA TCPcondis-PT-20-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-20-LTLFireability-01 finished in 32082 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(F(G(!(p0 U (F(p1)||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 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 4 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:44:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:33] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:44:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-21 13:44:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:44:33] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 36 ms :[(OR p1 p0)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s20 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 187 ms.
Stack based approach found an accepted trace after 4165 steps with 0 reset with depth 4166 and stack size 4166 in 12 ms.
FORMULA TCPcondis-PT-20-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-02 finished in 379 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0))) U !p0))'
Support contains 1 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 5 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:44:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:33] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:44:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-21 13:44:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:44:33] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1621 reset in 159 ms.
Stack based approach found an accepted trace after 7562 steps with 116 reset with depth 50 and stack size 50 in 17 ms.
FORMULA TCPcondis-PT-20-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-05 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(G(F((!(p0 U p1)||F(G(p2)))))))))'
Support contains 4 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 1 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 10 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:44:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:33] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:44:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-21 13:44:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:44:34] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:34] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s12 1), p2:(AND (LT s12 1) (OR (LT s4 1) (LT s15 1))), p0:(AND (GEQ s4 1) (GEQ s21 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1105 reset in 200 ms.
Product exploration explored 100000 steps with 1089 reset in 224 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) p2 (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 384 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:44:35] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:35] [INFO ] After 14ms 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 p1) p2 (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F p1), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 10 factoid took 446 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 64 ms :[p1, p1]
Support contains 3 out of 26 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 : 26/26 places, 26/26 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:44:35] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 13:44:35] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:44:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:35] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-21 13:44:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:44:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 26/26 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 p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[p1, p1]
Finished random walk after 652 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=217 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[p1, p1]
Stuttering acceptance computed with spot in 77 ms :[p1, p1]
Stuttering acceptance computed with spot in 61 ms :[p1, p1]
Product exploration explored 100000 steps with 1058 reset in 182 ms.
Product exploration explored 100000 steps with 1119 reset in 181 ms.
Built C files in :
/tmp/ltsmin13996180213535364528
[2022-05-21 13:44:36] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2022-05-21 13:44:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:44:36] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2022-05-21 13:44:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:44:36] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2022-05-21 13:44:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:44:36] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13996180213535364528
Running compilation step : cd /tmp/ltsmin13996180213535364528;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin13996180213535364528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13996180213535364528;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11465780525391213191.hoa' '--buchi-type=spotba'
LTSmin run took 157 ms.
FORMULA TCPcondis-PT-20-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-20-LTLFireability-07 finished in 3272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 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
[2022-05-21 13:44:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:37] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 13:44:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:37] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-21 13:44:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 13:44:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:37] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Stack based approach found an accepted trace after 7930 steps with 0 reset with depth 7931 and stack size 7930 in 17 ms.
FORMULA TCPcondis-PT-20-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-08 finished in 358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||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 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:37] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s7 1) (LT s19 1)), p1:(AND (GEQ s4 1) (GEQ s18 1) (GEQ s22 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 76 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 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-20-LTLFireability-10 finished in 429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p1)||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
[2022-05-21 13:44:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:38] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:38] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(AND (GEQ s8 1) (GEQ s20 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 63 ms.
Product exploration explored 100000 steps with 33333 reset in 67 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 p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-20-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-20-LTLFireability-13 finished in 544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X((!p1 U !X(X(F(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 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:38] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:38] [INFO ] Implicit Places using invariants and state equation in 32 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
[2022-05-21 13:44:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 175 ms :[false, false, p0, p0, true, p0]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s20 1)), p1:(AND (GEQ s12 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-14 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 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
[2022-05-21 13:44:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:38] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:44:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:44:38] [INFO ] Implicit Places using invariants and state equation in 34 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
[2022-05-21 13:44:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:44:38] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s5 1) (GEQ s21 1)), p0:(AND (GEQ s4 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-15 finished in 252 ms.
All properties solved by simple procedures.
Total runtime 40287 ms.
BK_STOP 1653140679177
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TCPcondis-PT-20, 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 r258-tall-165303545800468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-20.tgz
mv TCPcondis-PT-20 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 '
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 ;