About the Execution of ITS-Tools for TCPcondis-PT-50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.199 | 3600000.00 | 4440745.00 | 172143.10 | F?FFFFTTFFFFFFFF | 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-165303545800508.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-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545800508
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 12:55 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.7K May 9 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:15 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-50-LTLFireability-00
FORMULA_NAME TCPcondis-PT-50-LTLFireability-01
FORMULA_NAME TCPcondis-PT-50-LTLFireability-02
FORMULA_NAME TCPcondis-PT-50-LTLFireability-03
FORMULA_NAME TCPcondis-PT-50-LTLFireability-04
FORMULA_NAME TCPcondis-PT-50-LTLFireability-05
FORMULA_NAME TCPcondis-PT-50-LTLFireability-06
FORMULA_NAME TCPcondis-PT-50-LTLFireability-07
FORMULA_NAME TCPcondis-PT-50-LTLFireability-08
FORMULA_NAME TCPcondis-PT-50-LTLFireability-09
FORMULA_NAME TCPcondis-PT-50-LTLFireability-10
FORMULA_NAME TCPcondis-PT-50-LTLFireability-11
FORMULA_NAME TCPcondis-PT-50-LTLFireability-12
FORMULA_NAME TCPcondis-PT-50-LTLFireability-13
FORMULA_NAME TCPcondis-PT-50-LTLFireability-14
FORMULA_NAME TCPcondis-PT-50-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653149977709
Running Version 202205111006
[2022-05-21 16:19:38] [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 16:19:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 16:19:38] [WARNING] Skipping unknown tool specific annotation : Tina
[2022-05-21 16:19:38] [WARNING] Unknown XML tag in source file: size
[2022-05-21 16:19:38] [WARNING] Unknown XML tag in source file: color
[2022-05-21 16:19:39] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2022-05-21 16:19:39] [INFO ] Transformed 30 places.
[2022-05-21 16:19:39] [INFO ] Transformed 32 transitions.
[2022-05-21 16:19:39] [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 2 formulas.
FORMULA TCPcondis-PT-50-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 9 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 16:19:39] [INFO ] Computed 9 place invariants in 6 ms
[2022-05-21 16:19:39] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:19:39] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-21 16:19:39] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:19:39] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:19:39] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Support contains 23 out of 30 places after structural reductions.
[2022-05-21 16:19:39] [INFO ] Flatten gal took : 19 ms
[2022-05-21 16:19:39] [INFO ] Flatten gal took : 6 ms
[2022-05-21 16:19:39] [INFO ] Input system was already deterministic with 32 transitions.
Support contains 22 out of 30 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10049 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=209 ) properties (out of 22) seen :21
Finished Best-First random walk after 100 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=100 )
FORMULA TCPcondis-PT-50-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA TCPcondis-PT-50-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(G((p0 U (G(F(p1)) U p2))))||F(p3))))'
Support contains 6 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 26 transition count 27
Applied a total of 9 rules in 14 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:19:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:19:40] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:19:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:19:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-21 16:19:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:19:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:19:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 27/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(GEQ s0 1), p2:(GEQ s3 1), p1:(AND (GEQ s4 1) (GEQ s17 1)), p0:(AND (GEQ s13 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 45 reset in 312 ms.
Product exploration explored 100000 steps with 33 reset in 259 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 p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X p3)), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) (NOT p1) p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 775 ms. Reduced automaton from 6 states, 21 edges and 4 AP to 6 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Finished random walk after 153 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X p3)), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) (NOT p1) p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3)))), (F (NOT p3)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p2) p0 (NOT p3))), (F (AND (NOT p2) (NOT p0) (NOT p3)))]
Knowledge based reduction with 14 factoid took 774 ms. Reduced automaton from 6 states, 21 edges and 4 AP to 6 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 27/27 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:19:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:19:43] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:19:43] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:19:43] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-21 16:19:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:19:43] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 16:19:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 27/27 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 662 ms. Reduced automaton from 6 states, 21 edges and 4 AP to 6 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Finished random walk after 204 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2) (NOT p3))), (F (OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p2 (NOT p3)))), (F (NOT p3)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 14 factoid took 845 ms. Reduced automaton from 6 states, 21 edges and 4 AP to 6 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 44 reset in 223 ms.
Product exploration explored 100000 steps with 34 reset in 344 ms.
Built C files in :
/tmp/ltsmin2595923059733888758
[2022-05-21 16:19:46] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2022-05-21 16:19:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:19:46] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2022-05-21 16:19:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:19:46] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2022-05-21 16:19:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:19:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2595923059733888758
Running compilation step : cd /tmp/ltsmin2595923059733888758;'/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/ltsmin2595923059733888758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2595923059733888758;'/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/stateBased17868273036295249673.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 27/27 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:20:01] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:20:01] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:20:01] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:20:02] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-21 16:20:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 16:20:02] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:20:02] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 27/27 transitions.
Built C files in :
/tmp/ltsmin4634321061400018986
[2022-05-21 16:20:02] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2022-05-21 16:20:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:20:02] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2022-05-21 16:20:02] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:20:02] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2022-05-21 16:20:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:20:02] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4634321061400018986
Running compilation step : cd /tmp/ltsmin4634321061400018986;'/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 106 ms.
Running link step : cd /tmp/ltsmin4634321061400018986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin4634321061400018986;'/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/stateBased18411538435732303906.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 16:20:17] [INFO ] Flatten gal took : 16 ms
[2022-05-21 16:20:17] [INFO ] Flatten gal took : 4 ms
[2022-05-21 16:20:17] [INFO ] Time to serialize gal into /tmp/LTL6947091596427601542.gal : 2 ms
[2022-05-21 16:20:17] [INFO ] Time to serialize properties into /tmp/LTL6309919113844711598.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6947091596427601542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6309919113844711598.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6947091...266
Read 1 LTL properties
Checking formula 0 : !((G((F(G(("((SYNSENT>=1)&&(xSYN>=1))")U((G(F("((FIN>=1)&&(xESTAB>=1))")))U("(ESTAB>=1)")))))||(F("(CLOSED>=1)")))))
Formula 0 simplified : !G(FG("((SYNSENT>=1)&&(xSYN>=1))" U (GF"((FIN>=1)&&(xESTAB>=1))" U "(ESTAB>=1)")) | F"(CLOSED>=1)")
Detected timeout of ITS tools.
[2022-05-21 16:20:32] [INFO ] Flatten gal took : 5 ms
[2022-05-21 16:20:32] [INFO ] Applying decomposition
[2022-05-21 16:20:32] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3522421538799058082.txt' '-o' '/tmp/graph3522421538799058082.bin' '-w' '/tmp/graph3522421538799058082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3522421538799058082.bin' '-l' '-1' '-v' '-w' '/tmp/graph3522421538799058082.weights' '-q' '0' '-e' '0.001'
[2022-05-21 16:20:32] [INFO ] Decomposing Gal with order
[2022-05-21 16:20:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 16:20:32] [INFO ] Removed a total of 22 redundant transitions.
[2022-05-21 16:20:32] [INFO ] Flatten gal took : 43 ms
[2022-05-21 16:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-21 16:20:32] [INFO ] Time to serialize gal into /tmp/LTL7279161996293765849.gal : 2 ms
[2022-05-21 16:20:32] [INFO ] Time to serialize properties into /tmp/LTL4893287365027561978.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7279161996293765849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4893287365027561978.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7279161...245
Read 1 LTL properties
Checking formula 0 : !((G((F(G(("((u0.SYNSENT>=1)&&(i2.i0.u6.xSYN>=1))")U((G(F("((u2.FIN>=1)&&(i2.i0.u3.xESTAB>=1))")))U("(i3.u7.ESTAB>=1)")))))||(F("(u0.C...170
Formula 0 simplified : !G(FG("((u0.SYNSENT>=1)&&(i2.i0.u6.xSYN>=1))" U (GF"((u2.FIN>=1)&&(i2.i0.u3.xESTAB>=1))" U "(i3.u7.ESTAB>=1)")) | F"(u0.CLOSED>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16722563533790917959
[2022-05-21 16:20:47] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16722563533790917959
Running compilation step : cd /tmp/ltsmin16722563533790917959;'/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 99 ms.
Running link step : cd /tmp/ltsmin16722563533790917959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16722563533790917959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([](((LTLAPp0==true) U ([](<>((LTLAPp1==true))) U (LTLAPp2==true)))))||<>((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-50-LTLFireability-01 finished in 82484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&X((F(X(p1))&&G(p2)))))'
Support contains 7 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 16:21:02] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 16:21:02] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:02] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:02] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:02] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:02] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s5 1) (LT s21 1)), p0:(OR (LT s10 1) (LT s24 1)), p1:(OR (LT s13 1) (LT s25 1) (LT 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]]
Entered a terminal (fully accepting) state of product in 56 steps with 6 reset in 1 ms.
FORMULA TCPcondis-PT-50-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-02 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p0 U F(X(p0)))&&(F(p2)||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: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 24 transition count 25
Applied a total of 13 rules in 19 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 16:21:02] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:03] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:03] [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.
[2022-05-21 16:21:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (AND p0 (NOT p2))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s7 1) (LT s19 1)), p2:(AND (GEQ s5 1) (GEQ s15 1)), p0:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1972 reset in 176 ms.
Stack based approach found an accepted trace after 11532 steps with 232 reset with depth 52 and stack size 52 in 24 ms.
FORMULA TCPcondis-PT-50-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-03 finished in 476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
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 16:21:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:03] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:03] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:03] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s0 1) (GEQ s5 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-50-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-04 finished in 207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((G(((p2 U p3)||p4))&&p1))||p0)))'
Support contains 6 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 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Applied a total of 6 rules in 6 ms. Remains 27 /30 variables (removed 3) and now considering 29/32 (removed 3) transitions.
// Phase 1: matrix 29 rows 27 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:03] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 29 rows 27 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-21 16:21:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 29 rows 27 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/30 places, 29/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 29/32 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (OR (NOT p1) (AND (NOT p3) (NOT p4)))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p4) (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p1 p4) (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 p4) (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s19 1) (GEQ s9 1)), p1:(AND (GEQ s10 1) (GEQ s22 1)), p4:(GEQ s14 1), p3:(AND (GEQ s10 1) (GEQ s22 1)), p2:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 186 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-05 finished in 260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)||(!p0 U F(p2))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions 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 16:21:03] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:03] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 7 ms
[2022-05-21 16:21:03] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p1:(GEQ s15 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 107 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 p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1))))
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-50-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLFireability-06 finished in 443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(F(p1)||p2)))))'
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 16:21:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:04] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:04] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:04] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s9 1), p2:(GEQ s24 1), p1:(AND (GEQ s6 1) (GEQ s19 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][false, false, false, false]]
Product exploration explored 100000 steps with 4071 reset in 143 ms.
Product exploration explored 100000 steps with 4080 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Finished random walk after 460 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=153 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 338 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 1378 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:07] [INFO ] Computed 9 place invariants in 1 ms
Proved EG (NOT p0)
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:07] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 16:21:07] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned unsat
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (G (NOT p0)), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 294 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA TCPcondis-PT-50-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLFireability-09 finished in 3188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p2)&&p1)))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 31
Applied a total of 2 rules in 5 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
// Phase 1: matrix 31 rows 29 cols
[2022-05-21 16:21:07] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:07] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2022-05-21 16:21:07] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:07] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-21 16:21:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2022-05-21 16:21:07] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s12 1) (GEQ s24 1) (GEQ s25 1) (GEQ s4 1) (GEQ s22 1))) (GEQ s14 1)), p0:(GEQ s0 1), p2:(AND (GEQ s12 1) (GEQ s24 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8573 reset in 115 ms.
Stack based approach found an accepted trace after 96327 steps with 8311 reset with depth 20 and stack size 20 in 113 ms.
FORMULA TCPcondis-PT-50-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-10 finished in 459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F(G(p0))) U p1))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Applied a total of 10 rules in 5 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 16:21:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:08] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 16:21:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-21 16:21:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 16:21:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:08] [INFO ] Dead Transitions using invariants and state equation in 27 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 92 ms :[(NOT p1), p0, p0]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s20 1)), p0:(GEQ s0 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 0 reset in 204 ms.
Stack based approach found an accepted trace after 7808 steps with 0 reset with depth 7809 and stack size 7809 in 15 ms.
FORMULA TCPcondis-PT-50-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-12 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(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 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 11 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 16:21:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:08] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 16:21:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:08] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-05-21 16:21:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 16:21:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:08] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s11 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 175 ms.
Product exploration explored 100000 steps with 0 reset in 260 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 16:21:09] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 16:21:09] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 16:21:09] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-21 16:21:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 16:21:09] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 296 ms.
Built C files in :
/tmp/ltsmin10778266790330185302
[2022-05-21 16:21:10] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2022-05-21 16:21:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:21:10] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2022-05-21 16:21:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:21:10] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2022-05-21 16:21:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:21:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10778266790330185302
Running compilation step : cd /tmp/ltsmin10778266790330185302;'/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 100 ms.
Running link step : cd /tmp/ltsmin10778266790330185302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin10778266790330185302;'/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/stateBased14376715477986407231.hoa' '--buchi-type=spotba'
LTSmin run took 454 ms.
FORMULA TCPcondis-PT-50-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLFireability-13 finished in 2700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(F(p0))||p1))||F(p2)))'
Support contains 7 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 16:21:11] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:11] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:11] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:11] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:11] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p0:(LT s15 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 8564 reset in 114 ms.
Product exploration explored 100000 steps with 8621 reset in 146 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 p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 3 AP to 2 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 16:21:11] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 16:21:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 16:21:12] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned unsat
Proved EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (G (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA TCPcondis-PT-50-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLFireability-14 finished in 947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U p1)||F(p2)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 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 11 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 16:21:12] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 16:21:12] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 16:21:12] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 16:21:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-21 16:21:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 16:21:12] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 16:21:12] [INFO ] Dead Transitions using invariants and state equation in 32 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 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s22 1) (GEQ s2 1) (GEQ s15 1)), p1:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s22 1)), p0:(AND (GEQ s7 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 16760 reset in 130 ms.
Stack based approach found an accepted trace after 1776 steps with 326 reset with depth 10 and stack size 10 in 2 ms.
FORMULA TCPcondis-PT-50-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-15 finished in 356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((p0 U (G(F(p1)) U p2))))||F(p3))))'
[2022-05-21 16:21:12] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1275161999394442961
[2022-05-21 16:21:12] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-21 16:21:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:21:12] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-21 16:21:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:21:12] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-21 16:21:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 16:21:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1275161999394442961
Running compilation step : cd /tmp/ltsmin1275161999394442961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-21 16:21:12] [INFO ] Applying decomposition
[2022-05-21 16:21:12] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9910038712289795492.txt' '-o' '/tmp/graph9910038712289795492.bin' '-w' '/tmp/graph9910038712289795492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9910038712289795492.bin' '-l' '-1' '-v' '-w' '/tmp/graph9910038712289795492.weights' '-q' '0' '-e' '0.001'
[2022-05-21 16:21:12] [INFO ] Decomposing Gal with order
[2022-05-21 16:21:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 16:21:12] [INFO ] Removed a total of 24 redundant transitions.
[2022-05-21 16:21:12] [INFO ] Flatten gal took : 8 ms
[2022-05-21 16:21:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-21 16:21:12] [INFO ] Time to serialize gal into /tmp/LTLFireability15092269946981497286.gal : 1 ms
[2022-05-21 16:21:12] [INFO ] Time to serialize properties into /tmp/LTLFireability14523554478348860678.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15092269946981497286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14523554478348860678.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((G((F(G(("((u2.SYNSENT>=1)&&(u4.xSYN>=1))")U((G(F("((i0.i1.u5.FIN>=1)&&(i2.u3.xESTAB>=1))")))U("(i0.i0.u7.ESTAB>=1)")))))||(F("(u2.C...170
Formula 0 simplified : !G(FG("((u2.SYNSENT>=1)&&(u4.xSYN>=1))" U (GF"((i0.i1.u5.FIN>=1)&&(i2.u3.xESTAB>=1))" U "(i0.i0.u7.ESTAB>=1)")) | F"(u2.CLOSED>=1)")
Compilation finished in 109 ms.
Running link step : cd /tmp/ltsmin1275161999394442961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin1275161999394442961;'/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' '--ltl' '[]((<>([](((LTLAPp0==true) U ([](<>((LTLAPp1==true))) U (LTLAPp2==true)))))||<>((LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.176: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.176: LTL layer: formula: []((<>([](((LTLAPp0==true) U ([](<>((LTLAPp1==true))) U (LTLAPp2==true)))))||<>((LTLAPp3==true))))
pins2lts-mc-linux64( 2/ 8), 0.176: "[]((<>([](((LTLAPp0==true) U ([](<>((LTLAPp1==true))) U (LTLAPp2==true)))))||<>((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.176: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.183: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.192: Initializing POR dependencies: labels 36, guards 32
pins2lts-mc-linux64( 6/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.212: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.222: There are 37 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.222: State length is 31, there are 57 groups
pins2lts-mc-linux64( 0/ 8), 0.222: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.222: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.222: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.222: Visible groups: 0 / 57, labels: 4 / 37
pins2lts-mc-linux64( 0/ 8), 0.222: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.222: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.255: [Blue] ~120 levels ~960 states ~4336 transitions
pins2lts-mc-linux64( 4/ 8), 0.295: [Blue] ~240 levels ~1920 states ~8432 transitions
pins2lts-mc-linux64( 0/ 8), 0.346: [Blue] ~327 levels ~3840 states ~14272 transitions
pins2lts-mc-linux64( 0/ 8), 0.451: [Blue] ~537 levels ~7680 states ~26360 transitions
pins2lts-mc-linux64( 0/ 8), 0.541: [Blue] ~799 levels ~15360 states ~45304 transitions
pins2lts-mc-linux64( 0/ 8), 0.651: [Blue] ~799 levels ~30720 states ~82096 transitions
pins2lts-mc-linux64( 0/ 8), 0.870: [Blue] ~799 levels ~61440 states ~157904 transitions
pins2lts-mc-linux64( 3/ 8), 1.185: [Blue] ~653 levels ~122880 states ~385128 transitions
pins2lts-mc-linux64( 3/ 8), 1.749: [Blue] ~653 levels ~245760 states ~777504 transitions
pins2lts-mc-linux64( 0/ 8), 2.625: [Blue] ~799 levels ~491520 states ~1250208 transitions
pins2lts-mc-linux64( 3/ 8), 3.867: [Blue] ~653 levels ~983040 states ~3184384 transitions
pins2lts-mc-linux64( 3/ 8), 5.808: [Blue] ~653 levels ~1966080 states ~6442128 transitions
pins2lts-mc-linux64( 3/ 8), 9.584: [Blue] ~653 levels ~3932160 states ~13031512 transitions
pins2lts-mc-linux64( 3/ 8), 16.943: [Blue] ~653 levels ~7864320 states ~26306976 transitions
pins2lts-mc-linux64( 3/ 8), 32.479: [Blue] ~654 levels ~15728640 states ~55967040 transitions
pins2lts-mc-linux64( 3/ 8), 69.815: [Blue] ~663 levels ~31457280 states ~123734688 transitions
pins2lts-mc-linux64( 3/ 8), 148.514: [Blue] ~663 levels ~62914560 states ~278351256 transitions
pins2lts-mc-linux64( 3/ 8), 331.425: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 331.464:
pins2lts-mc-linux64( 0/ 8), 331.464: Explored 104748885 states 427767185 transitions, fanout: 4.084
pins2lts-mc-linux64( 0/ 8), 331.464: Total exploration time 331.230 sec (331.190 sec minimum, 331.212 sec on average)
pins2lts-mc-linux64( 0/ 8), 331.464: States per second: 316242, Transitions per second: 1291451
pins2lts-mc-linux64( 0/ 8), 331.464:
pins2lts-mc-linux64( 0/ 8), 331.464: State space has 104768178 states, 48298514 are accepting
pins2lts-mc-linux64( 0/ 8), 331.464: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 331.464: blue states: 104748885 (99.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 331.464: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 331.464: all-red states: 104743899 (99.98%), bogus 11 (0.00%)
pins2lts-mc-linux64( 0/ 8), 331.464:
pins2lts-mc-linux64( 0/ 8), 331.464: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 331.464:
pins2lts-mc-linux64( 0/ 8), 331.464: Queue width: 8B, total height: 5539, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 331.464: Tree memory: 1055.3MB, 10.6 B/state, compr.: 8.4%
pins2lts-mc-linux64( 0/ 8), 331.464: Tree fill ratio (roots/leafs): 78.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 331.464: Stored 33 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 331.464: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 331.464: Est. total memory use: 1055.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1275161999394442961;'/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' '--ltl' '[]((<>([](((LTLAPp0==true) U ([](<>((LTLAPp1==true))) U (LTLAPp2==true)))))||<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1275161999394442961;'/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' '--ltl' '[]((<>([](((LTLAPp0==true) U ([](<>((LTLAPp1==true))) U (LTLAPp2==true)))))||<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 16:41:43] [INFO ] Flatten gal took : 3 ms
[2022-05-21 16:41:43] [INFO ] Time to serialize gal into /tmp/LTLFireability8497080108773473291.gal : 1 ms
[2022-05-21 16:41:43] [INFO ] Time to serialize properties into /tmp/LTLFireability9119212485934961472.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8497080108773473291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9119212485934961472.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((G((F(G(("((SYNSENT>=1)&&(xSYN>=1))")U((G(F("((FIN>=1)&&(xESTAB>=1))")))U("(ESTAB>=1)")))))||(F("(CLOSED>=1)")))))
Formula 0 simplified : !G(FG("((SYNSENT>=1)&&(xSYN>=1))" U (GF"((FIN>=1)&&(xESTAB>=1))" U "(ESTAB>=1)")) | F"(CLOSED>=1)")
Detected timeout of ITS tools.
[2022-05-21 17:02:25] [INFO ] Flatten gal took : 99 ms
[2022-05-21 17:02:25] [INFO ] Input system was already deterministic with 32 transitions.
[2022-05-21 17:02:25] [INFO ] Transformed 30 places.
[2022-05-21 17:02:25] [INFO ] Transformed 32 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 17:02:25] [INFO ] Time to serialize gal into /tmp/LTLFireability7811706670578116513.gal : 2 ms
[2022-05-21 17:02:25] [INFO ] Time to serialize properties into /tmp/LTLFireability1479945796793931160.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7811706670578116513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1479945796793931160.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F(G(("((SYNSENT>=1)&&(xSYN>=1))")U((G(F("((FIN>=1)&&(xESTAB>=1))")))U("(ESTAB>=1)")))))||(F("(CLOSED>=1)")))))
Formula 0 simplified : !G(FG("((SYNSENT>=1)&&(xSYN>=1))" U (GF"((FIN>=1)&&(xESTAB>=1))" U "(ESTAB>=1)")) | F"(CLOSED>=1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
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-50"
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-50, 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-165303545800508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-50.tgz
mv TCPcondis-PT-50 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 ;