Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 16:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-00
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-01
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-02
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-03
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-04
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-05
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-06
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-07
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-08
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-09
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-10
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-11
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-12
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-13
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-14
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679253241772

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-50
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 19:14:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 19:14:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:14:03] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 19:14:03] [WARNING] Unknown XML tag in source file: size
[2023-03-19 19:14:03] [WARNING] Unknown XML tag in source file: color
[2023-03-19 19:14:03] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-19 19:14:03] [INFO ] Transformed 30 places.
[2023-03-19 19:14:03] [INFO ] Transformed 32 transitions.
[2023-03-19 19:14:03] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA TCPcondis-PT-50-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 19:14:04] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-19 19:14:04] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-19 19:14:04] [INFO ] Invariant cache hit.
[2023-03-19 19:14:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-19 19:14:04] [INFO ] Invariant cache hit.
[2023-03-19 19:14:04] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 20 out of 30 places after structural reductions.
[2023-03-19 19:14:04] [INFO ] Flatten gal took : 28 ms
[2023-03-19 19:14:04] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:14:04] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 26) seen :25
Finished Best-First random walk after 2435 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=347 )
FORMULA TCPcondis-PT-50-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 22 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 19:14:04] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:14:04] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 19:14:04] [INFO ] Invariant cache hit.
[2023-03-19 19:14:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-19 19:14:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:14:05] [INFO ] Invariant cache hit.
[2023-03-19 19:14:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 s2)], 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 286 ms.
Stack based approach found an accepted trace after 15235 steps with 0 reset with depth 15236 and stack size 15236 in 39 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-00 finished in 657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(G(p1) U p2))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
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 9 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-19 19:14:05] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 19:14:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 19:14:05] [INFO ] Invariant cache hit.
[2023-03-19 19:14:05] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-19 19:14:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:14:05] [INFO ] Invariant cache hit.
[2023-03-19 19:14:05] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s8), p2:(AND (LEQ s15 s12) (GT 2 s6)), p1:(AND (LEQ 1 s8) (LEQ 2 s6))], 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 36 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-01 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 24 transition count 25
Applied a total of 13 rules in 8 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2023-03-19 19:14:05] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 19:14:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 19:14:06] [INFO ] Invariant cache hit.
[2023-03-19 19:14:06] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 19:14:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:14:06] [INFO ] Invariant cache hit.
[2023-03-19 19:14:06] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LEQ s18 s15) (LEQ 2 s6)), p0:(GT 2 s19)], 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 721 reset in 283 ms.
Product exploration explored 100000 steps with 667 reset in 252 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 p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 265 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 19:14:07] [INFO ] Invariant cache hit.
[2023-03-19 19:14:07] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:14:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:14:07] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-19 19:14:07] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:14:07] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 19:14:07] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 354 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-19 19:14:07] [INFO ] Invariant cache hit.
[2023-03-19 19:14:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 19:14:07] [INFO ] Invariant cache hit.
[2023-03-19 19:14:07] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 19:14:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:14:07] [INFO ] Invariant cache hit.
[2023-03-19 19:14:08] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 24/24 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 : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10049 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1256 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 19:14:08] [INFO ] Invariant cache hit.
[2023-03-19 19:14:08] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:14:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:14:08] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-19 19:14:08] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:14:08] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 19:14:08] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 725 reset in 196 ms.
Product exploration explored 100000 steps with 723 reset in 208 ms.
Built C files in :
/tmp/ltsmin1741008724722893534
[2023-03-19 19:14:09] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2023-03-19 19:14:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 19:14:09] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2023-03-19 19:14:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 19:14:09] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2023-03-19 19:14:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 19:14:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1741008724722893534
Running compilation step : cd /tmp/ltsmin1741008724722893534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin1741008724722893534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1741008724722893534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased112673588808783207.hoa' '--buchi-type=spotba'
LTSmin run took 434 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLCardinality-02 finished in 4323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 19:14:10] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 19:14:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 19:14:10] [INFO ] Invariant cache hit.
[2023-03-19 19:14:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-19 19:14:10] [INFO ] Invariant cache hit.
[2023-03-19 19:14:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 332 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 1 s29)], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-03 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 19:14:10] [INFO ] Invariant cache hit.
[2023-03-19 19:14:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 19:14:10] [INFO ] Invariant cache hit.
[2023-03-19 19:14:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-19 19:14:10] [INFO ] Invariant cache hit.
[2023-03-19 19:14:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s28 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 828 reset in 200 ms.
Product exploration explored 100000 steps with 835 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 19:14:12] [INFO ] Invariant cache hit.
[2023-03-19 19:14:12] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 19:14:12] [INFO ] Invariant cache hit.
[2023-03-19 19:14:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-19 19:14:12] [INFO ] Invariant cache hit.
[2023-03-19 19:14:12] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 817 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=408 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 908 reset in 198 ms.
Product exploration explored 100000 steps with 738 reset in 209 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 13 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 19:14:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 19:14:13] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:14:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 28/30 places, 30/32 transitions.
Built C files in :
/tmp/ltsmin16242407231592388046
[2023-03-19 19:14:13] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16242407231592388046
Running compilation step : cd /tmp/ltsmin16242407231592388046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin16242407231592388046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16242407231592388046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2430547586685457841.hoa' '--buchi-type=spotba'
LTSmin run took 3425 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLCardinality-04 finished in 6657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 19:14:17] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:14:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 19:14:17] [INFO ] Invariant cache hit.
[2023-03-19 19:14:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 19:14:17] [INFO ] Invariant cache hit.
[2023-03-19 19:14:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s23 s19), p1:(LEQ 3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Product exploration explored 100000 steps with 33333 reset in 68 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-05 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 19:14:17] [INFO ] Invariant cache hit.
[2023-03-19 19:14:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 19:14:17] [INFO ] Invariant cache hit.
[2023-03-19 19:14:17] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 19:14:17] [INFO ] Invariant cache hit.
[2023-03-19 19:14:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s24)], 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 691 reset in 185 ms.
Product exploration explored 100000 steps with 695 reset in 194 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-19 19:14:18] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-06 finished in 1087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 19:14:18] [INFO ] Invariant cache hit.
[2023-03-19 19:14:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 19:14:19] [INFO ] Invariant cache hit.
[2023-03-19 19:14:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 19:14:19] [INFO ] Invariant cache hit.
[2023-03-19 19:14:19] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s15 s19)], 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 33333 reset in 65 ms.
Product exploration explored 100000 steps with 33333 reset in 64 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-07 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G((F((X((X(p0)||p0))&&X(p1)))&&p2)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 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 10 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2023-03-19 19:14:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:14:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 19:14:19] [INFO ] Invariant cache hit.
[2023-03-19 19:14:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 19:14:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:14:19] [INFO ] Invariant cache hit.
[2023-03-19 19:14:19] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 3 s8), p1:(GT s21 s1), p0:(GT s20 s12)], 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 105 reset in 197 ms.
Stack based approach found an accepted trace after 14120 steps with 14 reset with depth 1202 and stack size 1202 in 36 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-08 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((X(!p1)&&F(p2)) U G(p2))))'
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 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 19:14:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:14:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 19:14:20] [INFO ] Invariant cache hit.
[2023-03-19 19:14:20] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-19 19:14:20] [INFO ] Invariant cache hit.
[2023-03-19 19:14:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), p1, (NOT p2), (AND (NOT p2) p1), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 1 s15), p0:(LEQ 2 s29), p1:(LEQ 3 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32710 reset in 96 ms.
Product exploration explored 100000 steps with 32709 reset in 99 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X p2), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 1384 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND p1 p2), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 5) seen :4
Finished Best-First random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X p2), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 22 factoid took 1022 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND p1 p2), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (AND p1 p2), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 19:14:23] [INFO ] Invariant cache hit.
[2023-03-19 19:14:23] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 19:14:23] [INFO ] Invariant cache hit.
[2023-03-19 19:14:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 19:14:23] [INFO ] Invariant cache hit.
[2023-03-19 19:14:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 469 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (AND p1 p2), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10049 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1435 ) properties (out of 5) seen :4
Finished Best-First random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 596 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (AND p1 p2), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (AND p1 p2), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (AND p1 p2), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Entered a terminal (fully accepting) state of product in 26831 steps with 149 reset in 65 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-10 finished in 5551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 19:14:25] [INFO ] Invariant cache hit.
[2023-03-19 19:14:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 19:14:25] [INFO ] Invariant cache hit.
[2023-03-19 19:14:25] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-19 19:14:25] [INFO ] Invariant cache hit.
[2023-03-19 19:14:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ s14 s10), p0:(LEQ 1 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 891 steps with 0 reset in 6 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-11 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||F((p1&&X(!p2)&&(p3||F(p4)))))))'
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 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 19:14:26] [INFO ] Invariant cache hit.
[2023-03-19 19:14:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 19:14:26] [INFO ] Invariant cache hit.
[2023-03-19 19:14:26] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 19:14:26] [INFO ] Invariant cache hit.
[2023-03-19 19:14:26] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 486 ms :[(NOT p1), (OR (NOT p1) p2 (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND p2 (NOT p4)), (AND (NOT p0) p2 (NOT p4))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-13 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=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p4) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p4) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p4) p2), acceptance={0} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p3 (NOT p4)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p4) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p4) p0 p2), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p4) p0)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p3 (NOT p4) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND p1 p3 (NOT p4) p0), acceptance={} source=6 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p4) p2) (AND (NOT p3) (NOT p4) p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p1 p3 (NOT p4) p2), acceptance={0} source=7 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p0) p2) (AND (NOT p3) (NOT p4) (NOT p0) p2)), acceptance={} source=8 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p4) p0 p2) (AND (NOT p3) (NOT p4) p0 p2)), acceptance={} source=8 dest: 6}, { cond=(AND p1 p3 (NOT p4) (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND p1 p3 (NOT p4) p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 3 s24), p0:(LEQ s16 s27), p3:(LEQ s17 s22), p4:(LEQ 3 s15), p2:(GT 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 411 reset in 223 ms.
Product exploration explored 100000 steps with 434 reset in 224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p3 p4 p2), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p3) (NOT p4)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p4) p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) p0 p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 1949 ms. Reduced automaton from 9 states, 33 edges and 5 AP (stutter sensitive) to 9 states, 33 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 517 ms :[(NOT p1), (OR (NOT p1) p2 (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND p2 (NOT p4)), (AND (NOT p0) p2 (NOT p4))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 29) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :2
Finished Best-First random walk after 7155 steps, including 2 resets, run visited all 2 properties in 23 ms. (steps per millisecond=311 )
Knowledge obtained : [(AND (NOT p1) p0 p3 p4 p2), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p3) (NOT p4)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p4) p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) p0 p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) p2 p0 (NOT p4)) (AND p2 p0 (NOT p3) (NOT p4)))), (F (AND p1 (NOT p0))), (F (OR (AND (NOT p1) p2 (NOT p0) (NOT p4)) (AND p2 (NOT p0) (NOT p3) (NOT p4)))), (F (AND p1 (NOT p3) (NOT p4))), (F (AND p1 p2 p3 (NOT p4))), (F (AND p1 p0)), (F (OR (AND (NOT p1) p2 (NOT p4)) (AND p2 (NOT p3) (NOT p4)))), (F (AND p1 (NOT p0) (NOT p3) (NOT p4))), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p2 p0 p3 (NOT p4))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p2 (NOT p0) p3 (NOT p4))), (F (AND p1 p0 p3 (NOT p4))), (F (AND p1 (NOT p0) p3 (NOT p4))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND p0 (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p0 (NOT p3) (NOT p4))), (F (AND p1 p2)), (F (AND p1 p2 (NOT p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 p3 (NOT p4))), (F (OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))), (F (AND p1 p2 p0 (NOT p3) (NOT p4))), (F (AND p1 p2 p0)), (F (AND p1 p2 (NOT p0) (NOT p3) (NOT p4))), (F (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))), (F (AND p1 p2 (NOT p3) (NOT p4)))]
Knowledge based reduction with 32 factoid took 2948 ms. Reduced automaton from 9 states, 33 edges and 5 AP (stutter sensitive) to 9 states, 33 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 605 ms :[(NOT p1), (OR (NOT p1) p2 (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND p2 (NOT p4)), (AND (NOT p0) p2 (NOT p4))]
Stuttering acceptance computed with spot in 413 ms :[(NOT p1), (OR (NOT p1) p2 (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND p2 (NOT p4)), (AND (NOT p0) p2 (NOT p4))]
[2023-03-19 19:14:33] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0 p3 p4 p2), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p3) (NOT p4)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p4) p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) p0 p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) p2 p0 (NOT p4)) (AND p2 p0 (NOT p3) (NOT p4)))), (F (AND p1 (NOT p0))), (F (OR (AND (NOT p1) p2 (NOT p0) (NOT p4)) (AND p2 (NOT p0) (NOT p3) (NOT p4)))), (F (AND p1 (NOT p3) (NOT p4))), (F (AND p1 p2 p3 (NOT p4))), (F (AND p1 p0)), (F (OR (AND (NOT p1) p2 (NOT p4)) (AND p2 (NOT p3) (NOT p4)))), (F (AND p1 (NOT p0) (NOT p3) (NOT p4))), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p2 p0 p3 (NOT p4))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p2 (NOT p0) p3 (NOT p4))), (F (AND p1 p0 p3 (NOT p4))), (F (AND p1 (NOT p0) p3 (NOT p4))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND p0 (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p0 (NOT p3) (NOT p4))), (F (AND p1 p2)), (F (AND p1 p2 (NOT p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 p3 (NOT p4))), (F (OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))), (F (AND p1 p2 p0 (NOT p3) (NOT p4))), (F (AND p1 p2 p0)), (F (AND p1 p2 (NOT p0) (NOT p3) (NOT p4))), (F (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))), (F (AND p1 p2 (NOT p3) (NOT p4))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 32 factoid took 1483 ms. Reduced automaton from 9 states, 33 edges and 5 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-13 finished in 9195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 9 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 19:14:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:14:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 19:14:35] [INFO ] Invariant cache hit.
[2023-03-19 19:14:35] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-19 19:14:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 19:14:35] [INFO ] Invariant cache hit.
[2023-03-19 19:14:35] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s9)], 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.
Stack based approach found an accepted trace after 5907 steps with 0 reset with depth 5908 and stack size 5907 in 11 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-14 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X((X(G(p1)) U (p2&&X(G(p1)))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 19:14:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 19:14:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 19:14:35] [INFO ] Invariant cache hit.
[2023-03-19 19:14:35] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 19:14:35] [INFO ] Invariant cache hit.
[2023-03-19 19:14:35] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 s12), p2:(LEQ 1 s14), p1:(LEQ s1 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4111 steps with 0 reset in 12 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-15 finished in 575 ms.
All properties solved by simple procedures.
Total runtime 32417 ms.

BK_STOP 1679253279174

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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