Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 7.7K Apr 29 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 18:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 18:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:33 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:33 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 GPPP-PT-C0010N0000000100-LTLFireability-00
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-01
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-02
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-03
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-04
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-05
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-06
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-07
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-08
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-09
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-10
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-11
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-12
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-13
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-14
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652690323737

Running Version 202205111006
[2022-05-16 08:38:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 08:38:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 08:38:46] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-05-16 08:38:46] [INFO ] Transformed 33 places.
[2022-05-16 08:38:46] [INFO ] Transformed 22 transitions.
[2022-05-16 08:38:46] [INFO ] Parsed PT model containing 33 places and 22 transitions in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 30 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:47] [INFO ] Computed 12 place invariants in 14 ms
[2022-05-16 08:38:47] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:47] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 08:38:47] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:47] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-16 08:38:47] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:47] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-16 08:38:47] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Support contains 26 out of 33 places after structural reductions.
[2022-05-16 08:38:48] [INFO ] Flatten gal took : 43 ms
[2022-05-16 08:38:48] [INFO ] Flatten gal took : 20 ms
[2022-05-16 08:38:48] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 25 out of 33 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10056 steps, including 24 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:48] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 08:38:48] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 08:38:48] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 22 ms returned sat
[2022-05-16 08:38:48] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||F(p1))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:48] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 08:38:48] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:49] [INFO ] Computed 12 place invariants in 8 ms
[2022-05-16 08:38:49] [INFO ] Implicit Places using invariants in 86 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s12 1)), p0:(AND (GEQ s13 1) (GEQ s24 30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14338 reset in 514 ms.
Stack based approach found an accepted trace after 52 steps with 7 reset with depth 25 and stack size 25 in 2 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-00 finished in 1207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U !(X(p0) U p0))))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:50] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 08:38:50] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:38:50] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:38:50] [INFO ] Implicit Places using invariants in 104 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 106 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 320 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 sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(NOT p0)
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-01 finished in 1053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 16
Applied a total of 12 rules in 42 ms. Remains 26 /33 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-16 08:38:51] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 08:38:51] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-16 08:38:51] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 08:38:51] [INFO ] Implicit Places using invariants in 82 ms returned [1, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 16/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
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 2 with 4 rules applied. Total rules applied 8 place count 18 transition count 12
Applied a total of 8 rules in 11 ms. Remains 18 /22 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 08:38:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 08:38:51] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 08:38:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 08:38:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 08:38:51] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 12/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 17/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 2) (GEQ s7 1) (GEQ s12 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-02 finished in 447 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(X(F(p0)))&&G(p1))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 27 transition count 18
Applied a total of 9 rules in 19 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 08:38:51] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 08:38:51] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 08:38:51] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 08:38:51] [INFO ] Implicit Places using invariants in 83 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 18/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 17
Applied a total of 2 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 23 cols
[2022-05-16 08:38:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 08:38:51] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2022-05-16 08:38:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 08:38:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 08:38:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 17/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/33 places, 17/22 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s12 1), p0:(AND (GEQ s10 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-03 finished in 551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 17
Applied a total of 9 rules in 10 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2022-05-16 08:38:52] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 08:38:52] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
// Phase 1: matrix 17 rows 28 cols
[2022-05-16 08:38:52] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:38:52] [INFO ] Implicit Places using invariants in 67 ms returned [1, 2, 3, 17]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 69 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 17/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 22 transition count 15
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 2 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Applied a total of 8 rules in 4 ms. Remains 20 /24 variables (removed 4) and now considering 13/17 (removed 4) transitions.
// Phase 1: matrix 13 rows 20 cols
[2022-05-16 08:38:52] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 08:38:52] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2022-05-16 08:38:52] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 08:38:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 08:38:52] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 135 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 13/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 18/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s7 1)) (OR (LT s0 2) (LT s8 1) (LT s13 1)) (OR (LT s2 2) (GEQ s2 2)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-07 finished in 422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&(G(X(F(p2)))||F(p2))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 32 transition count 20
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 3 place count 31 transition count 20
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 11 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 08:38:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 08:38:52] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 08:38:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 08:38:52] [INFO ] Implicit Places using invariants in 58 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2 place count 23 transition count 16
Applied a total of 2 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 08:38:52] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 08:38:52] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 08:38:52] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 08:38:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 08:38:52] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 16/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 181 ms :[p1, true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(AND (GEQ s2 1) (GEQ s20 1)), p1:(AND (GEQ s11 1) (GEQ s13 1)), p2:(AND (GEQ s1 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 20033 reset in 187 ms.
Product exploration explored 100000 steps with 19962 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 797 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 14 factoid took 720 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p2)]
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 08:38:55] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 08:38:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 08:38:55] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-16 08:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:38:55] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-16 08:38:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:38:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 08:38:55] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 6 ms returned sat
[2022-05-16 08:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:38:57] [INFO ] [Nat]Absence check using state equation in 1772 ms returned sat
[2022-05-16 08:38:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 08:38:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 08:38:57] [INFO ] Computed and/alt/rep : 15/36/15 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 08:38:57] [INFO ] Added : 12 causal constraints over 3 iterations in 45 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 08:38:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 08:38:57] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 08:38:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 08:38:57] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 08:38:57] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 08:38:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 08:38:57] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-05-16 08:38:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 08:38:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 08:38:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 16/16 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 : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 08:38:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 08:38:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 08:38:57] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-16 08:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:38:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 08:38:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:38:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 08:38:57] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-16 08:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:38:59] [INFO ] [Nat]Absence check using state equation in 1751 ms returned sat
[2022-05-16 08:38:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 08:38:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 08:38:59] [INFO ] Computed and/alt/rep : 15/36/15 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 08:38:59] [INFO ] Added : 12 causal constraints over 3 iterations in 42 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 61 ms :[(NOT p2)]
Product exploration explored 100000 steps with 20089 reset in 137 ms.
Product exploration explored 100000 steps with 20028 reset in 165 ms.
Built C files in :
/tmp/ltsmin1636555077424638517
[2022-05-16 08:39:00] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2022-05-16 08:39:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:39:00] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2022-05-16 08:39:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:39:00] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2022-05-16 08:39:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:39:00] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1636555077424638517
Running compilation step : cd /tmp/ltsmin1636555077424638517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin1636555077424638517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin1636555077424638517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16454413199025657119.hoa' '--buchi-type=spotba'
LTSmin run took 131 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-08 finished in 8250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 9 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 08:39:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 08:39:00] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 08:39:00] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 08:39:00] [INFO ] Implicit Places using invariants in 68 ms returned [1, 3, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 18/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 23 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 20 transition count 14
Applied a total of 8 rules in 4 ms. Remains 20 /24 variables (removed 4) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 08:39:00] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 08:39:00] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 08:39:00] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 08:39:01] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/33 places, 14/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s6 1) (LT s19 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 717 reset in 297 ms.
Stack based approach found an accepted trace after 111 steps with 0 reset with depth 112 and stack size 112 in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-09 finished in 655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F((F(p0)&&p1))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:39:01] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 08:39:01] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:39:01] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:39:01] [INFO ] Implicit Places using invariants in 63 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s21 1)), p1:(OR (AND (GEQ s17 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s21 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1216 reset in 245 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-13 finished in 624 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 6 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2022-05-16 08:39:02] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 08:39:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
// Phase 1: matrix 15 rows 24 cols
[2022-05-16 08:39:02] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 08:39:02] [INFO ] Implicit Places using invariants in 54 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 15/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 17 transition count 12
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 2 with 4 rules applied. Total rules applied 10 place count 15 transition count 10
Applied a total of 10 rules in 3 ms. Remains 15 /20 variables (removed 5) and now considering 10/15 (removed 5) transitions.
// Phase 1: matrix 10 rows 15 cols
[2022-05-16 08:39:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:39:02] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 10 rows 15 cols
[2022-05-16 08:39:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:39:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 08:39:02] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/33 places, 10/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 14/33 places, 10/22 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-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:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-14 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(X(p0)) U (X(X(p2))&&p1))&&X(G(p2))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:39:02] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 08:39:02] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 08:39:02] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 08:39:02] [INFO ] Implicit Places using invariants in 69 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p2 p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s26 1) (GEQ s2 1) (GEQ s3 1)), p2:(AND (GEQ s5 1) (GEQ s26 1)), p0:(AND (GEQ s2 1) (GEQ s3 1))], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLFireability-15 finished in 373 ms.
All properties solved by simple procedures.
Total runtime 16376 ms.

BK_STOP 1652690342805

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0010N0000000100, 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 r096-smll-165260575900220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 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 ;