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-167912699500540.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-30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699500540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.0K Feb 26 16:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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.6K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 14K Feb 26 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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-30-LTLFireability-00
FORMULA_NAME TCPcondis-PT-30-LTLFireability-01
FORMULA_NAME TCPcondis-PT-30-LTLFireability-02
FORMULA_NAME TCPcondis-PT-30-LTLFireability-03
FORMULA_NAME TCPcondis-PT-30-LTLFireability-04
FORMULA_NAME TCPcondis-PT-30-LTLFireability-05
FORMULA_NAME TCPcondis-PT-30-LTLFireability-06
FORMULA_NAME TCPcondis-PT-30-LTLFireability-07
FORMULA_NAME TCPcondis-PT-30-LTLFireability-08
FORMULA_NAME TCPcondis-PT-30-LTLFireability-09
FORMULA_NAME TCPcondis-PT-30-LTLFireability-10
FORMULA_NAME TCPcondis-PT-30-LTLFireability-11
FORMULA_NAME TCPcondis-PT-30-LTLFireability-12
FORMULA_NAME TCPcondis-PT-30-LTLFireability-13
FORMULA_NAME TCPcondis-PT-30-LTLFireability-14
FORMULA_NAME TCPcondis-PT-30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679248960828

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-30
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 18:02:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 18:02:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:02:42] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 18:02:42] [WARNING] Unknown XML tag in source file: size
[2023-03-19 18:02:42] [WARNING] Unknown XML tag in source file: color
[2023-03-19 18:02:42] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-19 18:02:42] [INFO ] Transformed 30 places.
[2023-03-19 18:02:42] [INFO ] Transformed 32 transitions.
[2023-03-19 18:02:42] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA TCPcondis-PT-30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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
[2023-03-19 18:02:42] [INFO ] Computed 9 place invariants in 13 ms
[2023-03-19 18:02:42] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-19 18:02:42] [INFO ] Invariant cache hit.
[2023-03-19 18:02:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-19 18:02:42] [INFO ] Invariant cache hit.
[2023-03-19 18:02:42] [INFO ] Dead Transitions using invariants and state equation in 48 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 27 out of 30 places after structural reductions.
[2023-03-19 18:02:43] [INFO ] Flatten gal took : 19 ms
[2023-03-19 18:02:43] [INFO ] Flatten gal took : 6 ms
[2023-03-19 18:02:43] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 4783 steps, including 1 resets, run visited all 21 properties in 40 ms. (steps per millisecond=119 )
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' '!(G((X((F(p1)&&p0)) U (p2||X(X((p2 U p1)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 18:02:43] [INFO ] Invariant cache hit.
[2023-03-19 18:02:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 18:02:43] [INFO ] Invariant cache hit.
[2023-03-19 18:02:43] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-19 18:02:43] [INFO ] Invariant cache hit.
[2023-03-19 18:02:43] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s20 1)), p0:(AND (GEQ s13 1) (GEQ s25 1)), p1:(GEQ s29 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 3 steps with 0 reset in 3 ms.
FORMULA TCPcondis-PT-30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-00 finished in 563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 1 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 19 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 18:02:44] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-19 18:02:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 18:02:44] [INFO ] Invariant cache hit.
[2023-03-19 18:02:44] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-19 18:02:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:02:44] [INFO ] Invariant cache hit.
[2023-03-19 18:02:44] [INFO ] Dead Transitions using invariants and state equation in 30 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 148 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1880 reset in 273 ms.
Stack based approach found an accepted trace after 3174 steps with 60 reset with depth 21 and stack size 21 in 7 ms.
FORMULA TCPcondis-PT-30-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-01 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((G(!p0)||G(p1))) U p2))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 18:02:44] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-19 18:02:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 18:02:44] [INFO ] Invariant cache hit.
[2023-03-19 18:02:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 18:02:44] [INFO ] Invariant cache hit.
[2023-03-19 18:02:44] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s0 1), p0:(AND (GEQ s2 1) (GEQ s20 1)), p1:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1))], nbAcceptance=2, 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 0 reset in 273 ms.
Product exploration explored 100000 steps with 0 reset in 424 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 p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 342 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Finished random walk after 1997 steps, including 0 resets, run visited all 5 properties in 24 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 392 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 18:02:46] [INFO ] Invariant cache hit.
[2023-03-19 18:02:46] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 18:02:46] [INFO ] Invariant cache hit.
[2023-03-19 18:02:46] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 18:02:46] [INFO ] Invariant cache hit.
[2023-03-19 18:02:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 306 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1001 ) properties (out of 5) seen :4
Finished Best-First random walk after 465 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=232 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 433 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 287 ms.
Product exploration explored 100000 steps with 0 reset in 336 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 12 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2023-03-19 18:02:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2023-03-19 18:02:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 18:02:49] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 29/30 places, 31/32 transitions.
Built C files in :
/tmp/ltsmin9253587060387877060
[2023-03-19 18:02:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9253587060387877060
Running compilation step : cd /tmp/ltsmin9253587060387877060;'/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 268 ms.
Running link step : cd /tmp/ltsmin9253587060387877060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9253587060387877060;'/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/stateBased388395386262328207.hoa' '--buchi-type=spotba'
LTSmin run took 346 ms.
FORMULA TCPcondis-PT-30-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-30-LTLFireability-02 finished in 5530 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(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 0 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 18:02:50] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 18:02:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 18:02:50] [INFO ] Invariant cache hit.
[2023-03-19 18:02:50] [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 18:02:50] [INFO ] Invariant cache hit.
[2023-03-19 18:02:50] [INFO ] Dead Transitions using invariants and state equation in 33 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 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 73 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), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 98 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-30-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-30-LTLFireability-03 finished in 446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(((!p1&&X(!p2))||G(!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.
[2023-03-19 18:02:50] [INFO ] Invariant cache hit.
[2023-03-19 18:02:50] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 18:02:50] [INFO ] Invariant cache hit.
[2023-03-19 18:02:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-19 18:02:50] [INFO ] Invariant cache hit.
[2023-03-19 18:02:50] [INFO ] Dead Transitions using invariants and state equation in 30 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 171 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s12 1) (LT s26 1)), p2:(GEQ s15 1), p1:(GEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 90 reset in 220 ms.
Product exploration explored 100000 steps with 109 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 p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 479 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 993 steps, including 0 resets, run visited all 5 properties in 9 ms. (steps per millisecond=110 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 11 factoid took 624 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-19 18:02:52] [INFO ] Invariant cache hit.
[2023-03-19 18:02:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 18:02:52] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned unsat
Proved EG p2
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2)), (G p2)]
Property proved to be false thanks to negative knowledge :(G p2)
Knowledge based reduction with 11 factoid took 288 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-30-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-30-LTLFireability-04 finished in 2712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(!p1 U (p2||G(!p1)))))'
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 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-19 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NOT (AND (GEQ s5 1) (GEQ s23 1))) (NOT (OR (GEQ s9 1) (AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)) (GEQ s1 1)))), p1:(OR (GEQ s9 1) (AND (GEQ s10 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-06 finished in 232 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((p0&&X((F(G(p0))&&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 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s15 1), p1:(AND (GEQ s6 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-07 finished in 272 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((!p0 U (G(!p0)||(!p0&&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.
[2023-03-19 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-19 18:02:53] [INFO ] Invariant cache hit.
[2023-03-19 18:02:53] [INFO ] Dead Transitions using invariants and state equation in 26 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 137 ms :[true, p0, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p1:(LT s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-08 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 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 8 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 18:02:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 18:02:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 18:02:54] [INFO ] Invariant cache hit.
[2023-03-19 18:02:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 18:02:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:02:54] [INFO ] Invariant cache hit.
[2023-03-19 18:02:54] [INFO ] Dead Transitions using invariants and state equation in 40 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 112 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13677 reset in 89 ms.
Stack based approach found an accepted trace after 14711 steps with 2072 reset with depth 9 and stack size 9 in 16 ms.
FORMULA TCPcondis-PT-30-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-09 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 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 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 8 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-19 18:02:54] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 18:02:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 18:02:54] [INFO ] Invariant cache hit.
[2023-03-19 18:02:54] [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 18:02:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:02:54] [INFO ] Invariant cache hit.
[2023-03-19 18:02:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 26 ms :[p0]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18080 reset in 98 ms.
Stack based approach found an accepted trace after 10157 steps with 1916 reset with depth 11 and stack size 11 in 14 ms.
FORMULA TCPcondis-PT-30-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-10 finished in 265 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(F(p0))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 6 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 18:02:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 18:02:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 18:02:54] [INFO ] Invariant cache hit.
[2023-03-19 18:02:54] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-19 18:02:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:02:54] [INFO ] Invariant cache hit.
[2023-03-19 18:02:54] [INFO ] Dead Transitions using invariants and state equation in 27 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 118 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 265 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s19 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 362 reset in 165 ms.
Stack based approach found an accepted trace after 1170 steps with 0 reset with depth 1171 and stack size 1171 in 2 ms.
FORMULA TCPcondis-PT-30-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-11 finished in 569 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 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 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 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 6 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-19 18:02:55] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 18:02:55] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 18:02:55] [INFO ] Invariant cache hit.
[2023-03-19 18:02:55] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 18:02:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:02:55] [INFO ] Invariant cache hit.
[2023-03-19 18:02:55] [INFO ] Dead Transitions using invariants and state equation in 25 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 112 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s19 1) (GEQ s20 1) (GEQ s5 1) (GEQ s15 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 177 ms.
Stack based approach found an accepted trace after 3389 steps with 0 reset with depth 3390 and stack size 3390 in 6 ms.
FORMULA TCPcondis-PT-30-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-12 finished in 358 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)&&X(F(p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 18:02:55] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 18:02:55] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 18:02:55] [INFO ] Invariant cache hit.
[2023-03-19 18:02:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-19 18:02:55] [INFO ] Invariant cache hit.
[2023-03-19 18:02:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s14 1), p1:(OR (GEQ s0 1) (LT s13 1) (LT s25 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 659 reset in 188 ms.
Product exploration explored 100000 steps with 666 reset in 199 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) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 559 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=186 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 18:02:56] [INFO ] Invariant cache hit.
[2023-03-19 18:02:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 18:02:56] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 18:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:02:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-19 18:02:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:02:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 18:02:57] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 15 ms returned sat
[2023-03-19 18:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:02:57] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-19 18:02:57] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-19 18:02:57] [INFO ] Added : 24 causal constraints over 5 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 18:02:57] [INFO ] Invariant cache hit.
[2023-03-19 18:02:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 18:02:57] [INFO ] Invariant cache hit.
[2023-03-19 18:02:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-19 18:02:57] [INFO ] Invariant cache hit.
[2023-03-19 18:02:57] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 318 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=159 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 18:02:58] [INFO ] Invariant cache hit.
[2023-03-19 18:02:58] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 18:02:58] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 18:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:02:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 18:02:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:02:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 18:02:58] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 18:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:02:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 18:02:58] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 18:02:58] [INFO ] Added : 24 causal constraints over 5 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 568 reset in 186 ms.
Product exploration explored 100000 steps with 640 reset in 194 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 10 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2023-03-19 18:02:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2023-03-19 18:02:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 18:02:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 29/30 places, 31/32 transitions.
Built C files in :
/tmp/ltsmin16573790331211996005
[2023-03-19 18:02:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16573790331211996005
Running compilation step : cd /tmp/ltsmin16573790331211996005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin16573790331211996005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin16573790331211996005;'/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/stateBased531096289536993245.hoa' '--buchi-type=spotba'
LTSmin run took 181 ms.
FORMULA TCPcondis-PT-30-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-30-LTLFireability-13 finished in 3832 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) U (p1 U 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 0 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 18:02:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 18:02:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 18:02:59] [INFO ] Invariant cache hit.
[2023-03-19 18:02:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-19 18:02:59] [INFO ] Invariant cache hit.
[2023-03-19 18:02:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s0 1), p0:(AND (GEQ s4 1) (GEQ s18 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 75 ms.
Product exploration explored 100000 steps with 20000 reset in 76 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Finished random walk after 6330 steps, including 1 resets, run visited all 7 properties in 12 ms. (steps per millisecond=527 )
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT 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.
[2023-03-19 18:03:01] [INFO ] Invariant cache hit.
[2023-03-19 18:03:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 18:03:01] [INFO ] Invariant cache hit.
[2023-03-19 18:03:01] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 18:03:01] [INFO ] Invariant cache hit.
[2023-03-19 18:03:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1001 ) properties (out of 7) seen :6
Finished Best-First random walk after 228 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=228 )
Knowledge obtained : [(AND (NOT p0) p2 p1), true]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 2 factoid took 210 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Product exploration explored 100000 steps with 20000 reset in 72 ms.
Product exploration explored 100000 steps with 20000 reset in 72 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT 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 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 32
Deduced a syphon composed of 1 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 3 place count 30 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 30/32 (removed 2) transitions.
[2023-03-19 18:03:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 30 cols
[2023-03-19 18:03:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 18:03:03] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 30/30 places, 30/32 transitions.
Built C files in :
/tmp/ltsmin324433446476185236
[2023-03-19 18:03:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin324433446476185236
Running compilation step : cd /tmp/ltsmin324433446476185236;'/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 93 ms.
Running link step : cd /tmp/ltsmin324433446476185236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin324433446476185236;'/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/stateBased562645753137159026.hoa' '--buchi-type=spotba'
LTSmin run took 148 ms.
FORMULA TCPcondis-PT-30-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-30-LTLFireability-14 finished in 4015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 18:03:03] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 18:03:03] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 18:03:03] [INFO ] Invariant cache hit.
[2023-03-19 18:03:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 18:03:03] [INFO ] Invariant cache hit.
[2023-03-19 18:03:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s4 1) (LT s21 1) (AND (GEQ s5 1) (GEQ s17 1))), p0:(OR (LT s3 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-15 finished in 208 ms.
All properties solved by simple procedures.
Total runtime 21283 ms.

BK_STOP 1679248984491

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is TCPcondis-PT-30, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699500540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-30.tgz
mv TCPcondis-PT-30 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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