Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331400293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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-C1000N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331400293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 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-C1000N0000001000-00
FORMULA_NAME GPPP-PT-C1000N0000001000-01
FORMULA_NAME GPPP-PT-C1000N0000001000-02
FORMULA_NAME GPPP-PT-C1000N0000001000-03
FORMULA_NAME GPPP-PT-C1000N0000001000-04
FORMULA_NAME GPPP-PT-C1000N0000001000-05
FORMULA_NAME GPPP-PT-C1000N0000001000-06
FORMULA_NAME GPPP-PT-C1000N0000001000-07
FORMULA_NAME GPPP-PT-C1000N0000001000-08
FORMULA_NAME GPPP-PT-C1000N0000001000-09
FORMULA_NAME GPPP-PT-C1000N0000001000-10
FORMULA_NAME GPPP-PT-C1000N0000001000-11
FORMULA_NAME GPPP-PT-C1000N0000001000-12
FORMULA_NAME GPPP-PT-C1000N0000001000-13
FORMULA_NAME GPPP-PT-C1000N0000001000-14
FORMULA_NAME GPPP-PT-C1000N0000001000-15

=== Now, execution of the tool begins

BK_START 1621241401664

Running Version 0
[2021-05-17 08:50: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]
[2021-05-17 08:50:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 08:50:05] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-17 08:50:05] [INFO ] Transformed 33 places.
[2021-05-17 08:50:05] [INFO ] Transformed 22 transitions.
[2021-05-17 08:50:05] [INFO ] Parsed PT model containing 33 places and 22 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 08:50:05] [INFO ] Initial state test concluded for 4 properties.
FORMULA GPPP-PT-C1000N0000001000-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 19 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:05] [INFO ] Invariants computation overflowed in 12 ms
[2021-05-17 08:50:05] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:05] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:50:05] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:05] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 08:50:05] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:05] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:50:05] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
[2021-05-17 08:50:06] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 08:50:06] [INFO ] Flatten gal took : 31 ms
FORMULA GPPP-PT-C1000N0000001000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 08:50:06] [INFO ] Flatten gal took : 12 ms
[2021-05-17 08:50:06] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100910 steps, including 3 resets, run finished after 135 ms. (steps per millisecond=747 ) properties (out of 19) seen :17
Running SMT prover for 2 properties.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:06] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 08:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:50:06] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 08:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 08:50:06] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-17 08:50:06] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 08:50:06] [INFO ] Added : 7 causal constraints over 2 iterations in 40 ms. Result :sat
[2021-05-17 08:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:50:06] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-05-17 08:50:06] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPPP-PT-C1000N0000001000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((G(F(p0)) U (p0 U p1))&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 08:50:06] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:50:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:06] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 08:50:06] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:06] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:06] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 139 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 08:50:06] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 08:50:06] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 08:50:06] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:06] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 632 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s15 1), p0:(AND (GEQ s16 1) (GEQ s17 1)), p2:(OR (LT s6 1) (LT s27 2000))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2056 reset in 605 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-00 finished in 1620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 08:50:08] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:08] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:08] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:08] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:08] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:08] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 154 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:08] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:08] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:08] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:08] [INFO ] Dead Transitions using invariants and state equation in 384 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s23 1)), p0:(AND (GEQ s7 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 28101 steps with 0 reset in 119 ms.
FORMULA GPPP-PT-C1000N0000001000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-01 finished in 913 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p0)&&(G(p1) U X((p0 U p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 08:50:09] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:09] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:09] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:10] [INFO ] Implicit Places using invariants in 1172 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:10] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:10] [INFO ] Implicit Places using invariants and state equation in 458 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1640 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:10] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 08:50:10] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:10] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:10] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p1:(AND (GEQ s7 1) (GEQ s8 1)), p2:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15310 reset in 181 ms.
Stack based approach found an accepted trace after 149 steps with 23 reset with depth 7 and stack size 7 in 2 ms.
FORMULA GPPP-PT-C1000N0000001000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-02 finished in 2303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 08:50:11] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:11] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:11] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:11] [INFO ] Invariants computation overflowed in 5 ms
[2021-05-17 08:50:11] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 164 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:11] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:50:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:11] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:11] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s10 1), p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1217 reset in 289 ms.
Stack based approach found an accepted trace after 2140 steps with 25 reset with depth 113 and stack size 112 in 4 ms.
FORMULA GPPP-PT-C1000N0000001000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-04 finished in 793 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:12] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:12] [INFO ] Dead Transitions using invariants and state equation in 516 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:12] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:12] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:12] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:12] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 105 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:12] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 08:50:12] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:12] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:12] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C1000N0000001000-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s12 1)), p1:(OR (LT s1 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 3 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-05 finished in 958 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 08:50:13] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:13] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:13] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:13] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:13] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 109 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:13] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:50:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:50:13] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s6 1) (GEQ s27 1) (GEQ s1 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-06 finished in 440 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&(X(F((p2&&F(!p2))))||p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 08:50:13] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:13] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:13] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:13] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:50:13] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:15] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1960 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 08:50:15] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:16] [INFO ] Dead Transitions using invariants and state equation in 1207 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 08:50:16] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:16] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) p2), (OR (NOT p0) (NOT p1)), true, true]
Running random walk in product with property : GPPP-PT-C1000N0000001000-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1)), p1:(OR (LT s2 1) (LT s21 1)), p2:(OR (LT s2 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-12 finished in 3616 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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 17 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 40 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:17] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 08:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 08:50:17] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [0, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 101 ms to find 4 implicit places.
[2021-05-17 08:50:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 20/33 places, 15/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 17 transition count 12
Applied a total of 6 rules in 2 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:17] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 08:50:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s14 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 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-13 finished in 646 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U (p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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 6 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:17] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 08:50:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 08:50:18] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [0, 2, 3, 17]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 149 ms to find 4 implicit places.
[2021-05-17 08:50:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-17 08:50:18] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:18] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 24/33 places, 17/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 14
Applied a total of 6 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 21 cols
[2021-05-17 08:50:18] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:18] [INFO ] Implicit Places using invariants in 673 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2021-05-17 08:50:18] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 08:50:19] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s1 2) (GEQ s11 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s7 1))), p0:(GEQ s4 2), p2:(AND (GEQ s5 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-14 finished in 2059 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(!p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 33 transition count 21
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 32 transition count 21
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 5 place count 30 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 0 with 3 rules applied. Total rules applied 8 place count 28 transition count 19
Applied a total of 8 rules in 5 ms. Remains 28 /33 variables (removed 5) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 08:50:19] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 08:50:19] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:19] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 08:50:20] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:21] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1160 ms to find 1 implicit places.
[2021-05-17 08:50:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 08:50:21] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:50:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 27/33 places, 19/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2021-05-17 08:50:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 08:50:21] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:50:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 27/33 places, 19/22 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p2) p1), (NOT p0), p1, (NOT p2)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s2 1) (LT s7 1) (LT s26 1)), p1:(OR (LT s1 1) (LT s9 1)), p2:(OR (LT s14 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 14272 reset in 212 ms.
Stack based approach found an accepted trace after 65 steps with 12 reset with depth 11 and stack size 11 in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-15 finished in 1667 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621241422696

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-C1000N0000001000"
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-C1000N0000001000, 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 r102-smll-162075331400293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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