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-165260575800172.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-C0001N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575800172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 5.5K Apr 29 18:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 29 18:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 18:39 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.6K May 9 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 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-C0001N0000000010-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652675762495

Running Version 202205111006
[2022-05-16 04:36:04] [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 04:36:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 04:36:04] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-16 04:36:04] [INFO ] Transformed 33 places.
[2022-05-16 04:36:04] [INFO ] Transformed 22 transitions.
[2022-05-16 04:36:04] [INFO ] Parsed PT model containing 33 places and 22 transitions in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 36 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 04:36:05] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-16 04:36:05] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:05] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-16 04:36:05] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:05] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-16 04:36:05] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:05] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 04:36:05] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Support contains 31 out of 33 places after structural reductions.
[2022-05-16 04:36:05] [INFO ] Flatten gal took : 41 ms
[2022-05-16 04:36:06] [INFO ] Flatten gal took : 29 ms
[2022-05-16 04:36:06] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 30 out of 33 places (down from 31) after GAL structural reductions.
Finished random walk after 130 steps, including 0 resets, run visited all 22 properties in 108 ms. (steps per millisecond=1 )
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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 04:36:06] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 04:36:06] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:06] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 04:36:07] [INFO ] Implicit Places using invariants in 109 ms returned [0, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 116 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 329 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-02 finished in 627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 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 0 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
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 11 place count 26 transition count 17
Applied a total of 11 rules in 46 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 04:36:07] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 04:36:07] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 04:36:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 04:36:07] [INFO ] Implicit Places using invariants in 94 ms returned [0, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 97 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 17/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 22 /22 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/33 places, 17/22 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-03 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 (GEQ s11 1) (AND (GEQ s0 7) (GEQ s14 7)))], 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 3 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-03 finished in 306 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((G(!p0) U (F(p0)||p1))) U 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 04:36:07] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:07] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:07] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 04:36:07] [INFO ] Implicit Places using invariants in 78 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 80 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 306 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-04 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={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s20 1), p0:(AND (GEQ s14 1) (GEQ s15 1)), p1:(GEQ s3 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 886 reset in 385 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-04 finished in 896 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(p0)&&X(p1)&&p2))))'
Support contains 6 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 04:36:08] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:08] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:08] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:08] [INFO ] Implicit Places using invariants in 53 ms returned [0, 1, 2, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 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 192 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p2) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s19 1)), p2:(GEQ s14 1), p1:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s24 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 77 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-05 finished in 377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((G(p1)&&p0))||p2))))'
Support contains 7 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 04:36:08] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:09] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:09] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 04:36:09] [INFO ] Implicit Places using invariants in 68 ms returned [0, 2, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 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 1 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 236 ms :[true, (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s6 1) (LT s26 2)), p2:(AND (GEQ s0 1) (GEQ s23 1)), p0:(AND (OR (LT s1 1) (LT s20 1)) (LT s17 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 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-06 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)&&p0) U G(p2))))'
Support contains 8 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 04:36:09] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 04:36:09] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:09] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 04:36:09] [INFO ] Implicit Places using invariants in 52 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 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 197 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1)), p0:(AND (GEQ s8 1) (GEQ s12 1) (NOT (AND (GEQ s1 7) (GEQ s23 7)))), p1:(AND (GEQ s1 7) (GEQ s23 7)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], 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-C0001N0000000010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-08 finished in 337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(X(p0))||(X(p1) U p2))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 04:36:09] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 04:36:09] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:09] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 04:36:09] [INFO ] Implicit Places using invariants in 68 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 70 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p2:(LT s15 1), p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Product exploration explored 100000 steps with 33333 reset in 167 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)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-09 finished in 707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U F(X((F((F(p1)||p0))||!p2)))))'
Support contains 5 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 04:36:10] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:10] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:10] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:10] [INFO ] Implicit Places using invariants in 62 ms returned [0, 2, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 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 1 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 92 ms :[(AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s23 1)), p0:(AND (GEQ s0 1) (GEQ s12 1)), p2:(AND (GEQ s1 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0) p2)))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-10 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 3 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 04:36:11] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:11] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:11] [INFO ] Implicit Places using invariants in 71 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 78 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s7 1) (LT s8 1) (LT s26 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 76 ms.
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-11 finished in 570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(((p0 U p1)||X(p1))))))'
Support contains 2 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 04:36:11] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:11] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:11] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:11] [INFO ] Implicit Places using invariants in 61 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s19 1), p1:(GEQ s3 2)], 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 1 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-13 finished in 432 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((X(X(p2))||p1))||p0))))'
Support contains 8 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 04:36:12] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:12] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:12] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 04:36:12] [INFO ] Implicit Places using invariants in 87 ms returned [0, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 98 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 244 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s9 1) (LT s27 7)), p0:(OR (GEQ s13 1) (AND (GEQ s2 1) (GEQ s3 1))), p2:(OR (LT s0 1) (LT s22 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 344 reset in 140 ms.
Product exploration explored 100000 steps with 335 reset in 225 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 23 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2022-05-16 04:36:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 04:36:13] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 22 rows 29 cols
[2022-05-16 04:36:14] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 04:36:14] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 22 rows 29 cols
[2022-05-16 04:36:14] [INFO ] Computed 9 place invariants in 8 ms
[2022-05-16 04:36:14] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2022-05-16 04:36:14] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 04:36:14] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 22/22 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 p1 (NOT p0) p2), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 65 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 361 reset in 349 ms.
Product exploration explored 100000 steps with 330 reset in 126 ms.
Built C files in :
/tmp/ltsmin3005683439020826496
[2022-05-16 04:36:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3005683439020826496
Running compilation step : cd /tmp/ltsmin3005683439020826496;'/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 311 ms.
Running link step : cd /tmp/ltsmin3005683439020826496;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin3005683439020826496;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2310355558143423154.hoa' '--buchi-type=spotba'
LTSmin run took 1653 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-14 finished in 6090 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(X(X(!(G(p0) U p1)))))))'
Support contains 3 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 04:36:18] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 04:36:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:36:18] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 04:36:18] [INFO ] Implicit Places using invariants in 49 ms returned [0, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 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 190 ms :[p1, p1, p1, p1, (AND p1 p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-15 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=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s17 1), p0:(AND (GEQ s0 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8144 reset in 121 ms.
Stack based approach found an accepted trace after 51370 steps with 4221 reset with depth 35 and stack size 34 in 69 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-15 finished in 496 ms.
All properties solved by simple procedures.
Total runtime 14210 ms.

BK_STOP 1652675778738

--------------------
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-C0001N0000000010"
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-C0001N0000000010, 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-165260575800172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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