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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 24K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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-C0100N0000100000-00
FORMULA_NAME GPPP-PT-C0100N0000100000-01
FORMULA_NAME GPPP-PT-C0100N0000100000-02
FORMULA_NAME GPPP-PT-C0100N0000100000-03
FORMULA_NAME GPPP-PT-C0100N0000100000-04
FORMULA_NAME GPPP-PT-C0100N0000100000-05
FORMULA_NAME GPPP-PT-C0100N0000100000-06
FORMULA_NAME GPPP-PT-C0100N0000100000-07
FORMULA_NAME GPPP-PT-C0100N0000100000-08
FORMULA_NAME GPPP-PT-C0100N0000100000-09
FORMULA_NAME GPPP-PT-C0100N0000100000-10
FORMULA_NAME GPPP-PT-C0100N0000100000-11
FORMULA_NAME GPPP-PT-C0100N0000100000-12
FORMULA_NAME GPPP-PT-C0100N0000100000-13
FORMULA_NAME GPPP-PT-C0100N0000100000-14
FORMULA_NAME GPPP-PT-C0100N0000100000-15

=== Now, execution of the tool begins

BK_START 1621227176115

Running Version 0
[2021-05-17 04:52:59] [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 04:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:52:59] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-17 04:52:59] [INFO ] Transformed 33 places.
[2021-05-17 04:52:59] [INFO ] Transformed 22 transitions.
[2021-05-17 04:52:59] [INFO ] Parsed PT model containing 33 places and 22 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 04:52:59] [INFO ] Initial state test concluded for 2 properties.
Support contains 28 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 04:53:00] [INFO ] Computed 12 place invariants in 13 ms
[2021-05-17 04:53:00] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:53:00] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-17 04:53:00] [INFO ] Implicit Places using invariants in 67 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:00] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-17 04:53:00] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:00] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 04:53:00] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 04:53:00] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 04:53:00] [INFO ] Flatten gal took : 48 ms
FORMULA GPPP-PT-C0100N0000100000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:53:00] [INFO ] Flatten gal took : 13 ms
[2021-05-17 04:53:01] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100130 steps, including 34 resets, run finished after 175 ms. (steps per millisecond=572 ) properties (out of 22) seen :21
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:01] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 04:53:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 04:53:01] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 04:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:53:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 04:53:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:53:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 04:53:01] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 575 ms returned sat
[2021-05-17 04:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:53:02] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-17 04:53:02] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 04:53:02] [INFO ] Added : 7 causal constraints over 2 iterations in 61 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(F((X(F((p2||X(p3))))&&p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:02] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 04:53:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:02] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 04:53:02] [INFO ] Implicit Places using invariants in 61 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:53:02] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 04:53:02] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 4 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 04:53:02] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 04:53:02] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 561 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : GPPP-PT-C0100N0000100000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s25 1)), p1:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s25 1)), p2:(GEQ s14 1), p3:(AND (GEQ s15 1) (GEQ s16 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 4227 reset in 462 ms.
Stack based approach found an accepted trace after 115 steps with 9 reset with depth 7 and stack size 7 in 1 ms.
FORMULA GPPP-PT-C0100N0000100000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-00 finished in 1406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(F(p0))&&F((p1||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:03] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:03] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:03] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:03] [INFO ] Implicit Places using invariants in 69 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:53:03] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 04:53:03] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:53:03] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:53:03] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000100000-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s17 1), p0:(AND (GEQ s7 1) (GEQ s11 1)), p2:(AND (GEQ s1 1) (GEQ s23 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2054 reset in 376 ms.
Stack based approach found an accepted trace after 128 steps with 2 reset with depth 19 and stack size 19 in 16 ms.
FORMULA GPPP-PT-C0100N0000100000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-01 finished in 954 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(X(G(p1)))&&p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:04] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:04] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:04] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 04:53:04] [INFO ] Implicit Places using invariants in 113 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:53:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:53:04] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Starting structural reductions, iteration 1 : 30/32 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 04:53:04] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-17 04:53:05] [INFO ] Dead Transitions using invariants and state equation in 308 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : GPPP-PT-C0100N0000100000-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s12 1) (GEQ s24 300)), p1:(LT s18 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000100000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-03 finished in 920 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0&&(G(p0) U p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 2 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 5 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 28 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 26 transition count 18
Applied a total of 9 rules in 30 ms. Remains 26 /32 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-17 04:53:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:53:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2021-05-17 04:53:05] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 04:53:05] [INFO ] Implicit Places using invariants in 54 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
[2021-05-17 04:53:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-17 04:53:05] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:53:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 24/32 places, 18/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 17
Applied a total of 2 rules in 8 ms. Remains 23 /24 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 23 cols
[2021-05-17 04:53:05] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:53:05] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-17 04:53:05] [INFO ] Computed 7 place invariants in 14 ms
[2021-05-17 04:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 04:53:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 23/32 places, 17/22 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s12 1), p1:(OR (LT s10 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000100000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-04 finished in 483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:05] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:06] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 04:53:06] [INFO ] Implicit Places using invariants in 42 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:53:06] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:53:06] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0100N0000100000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s5 2), p1:(OR (LT s1 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 1 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000100000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-05 finished in 336 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 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 31 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 30 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 30 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 29 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 26 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 24 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 23 transition count 15
Applied a total of 15 rules in 15 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 04:53:06] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 04:53:06] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] Implicit Places using invariants in 41 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
[2021-05-17 04:53:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-17 04:53:06] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 21/32 places, 15/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 14
Applied a total of 2 rules in 4 ms. Remains 20 /21 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 04:53:06] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 04:53:06] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 04:53:06] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 04:53:06] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 122 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 04:53:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 04:53:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s6 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 34 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000100000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-07 finished in 350 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p1)||p0) U X(X(X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:06] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:06] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] Implicit Places using invariants in 55 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:06] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 29/32 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.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:06] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:53:06] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 539 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 9}], [{ cond=(NOT p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s9 1) (LT s27 700)), p1:(GEQ s9 1), p2:(AND (GEQ s12 1) (GEQ s23 300))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 108 reset in 599 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA GPPP-PT-C0100N0000100000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-08 finished in 1371 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:08] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:08] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:08] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 04:53:08] [INFO ] Implicit Places using invariants in 106 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:08] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-17 04:53:08] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Starting structural reductions, iteration 1 : 29/32 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.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:08] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:53:08] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 16448 reset in 149 ms.
Stack based approach found an accepted trace after 43 steps with 6 reset with depth 7 and stack size 7 in 0 ms.
FORMULA GPPP-PT-C0100N0000100000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-09 finished in 597 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 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 31 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 30 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 30 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 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 27 transition count 17
Applied a total of 9 rules in 10 ms. Remains 27 /32 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2021-05-17 04:53:08] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 04:53:08] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 17 rows 27 cols
[2021-05-17 04:53:08] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:08] [INFO ] Implicit Places using invariants in 50 ms returned [1, 2, 16]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
[2021-05-17 04:53:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-17 04:53:08] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:53:08] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 24/32 places, 17/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 22 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 22 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 19 transition count 12
Applied a total of 10 rules in 9 ms. Remains 19 /24 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 19 cols
[2021-05-17 04:53:08] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:53:08] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 12 rows 19 cols
[2021-05-17 04:53:08] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:53:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:53:08] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 74 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 17/32 places, 12/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-17 04:53:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:53:08] [INFO ] Invariants computation overflowed in 9 ms
[2021-05-17 04:53:08] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 3 iterations. Remains : 17/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000100000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-10 finished in 324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&X(p0)&&(G(p1) U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:08] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:09] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:09] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:09] [INFO ] Implicit Places using invariants in 47 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:09] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:53:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 29/32 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.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:09] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:53:09] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), true, true]
Running random walk in product with property : GPPP-PT-C0100N0000100000-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s24 1)), p2:(AND (GEQ s6 1) (GEQ s10 1)), p0:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000100000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-11 finished in 535 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))||(F(!p1)&&X((F(p2)&&G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:09] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:09] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:09] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:09] [INFO ] Implicit Places using invariants in 52 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:53:09] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:53:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 30/32 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 04:53:09] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:53:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 474 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0)), (NOT p0), false, (AND (NOT p2) (NOT p0)), true, p1, p0, (NOT p2)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 7}, { cond=(NOT p0), acceptance={} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s21 1), p2:(OR (LT s1 1) (LT s20 1))], 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 233 ms.
Product exploration explored 100000 steps with 34 reset in 343 ms.
Knowledge obtained : [(NOT p1), p0, p2]
Stuttering acceptance computed with spot in 465 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0)), (NOT p0), false, (AND (NOT p2) (NOT p0)), true, p1, p0, (NOT p2)]
Product exploration explored 100000 steps with 34 reset in 177 ms.
Product exploration explored 100000 steps with 34 reset in 399 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0)), (NOT p0), false, (AND (NOT p2) (NOT p0)), true, p1, p0, (NOT p2)]
Support contains 5 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 7 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 1 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: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 29 transition count 22
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 22
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 27 transition count 20
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 27 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 27 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 26 transition count 19
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 26 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 13 rules in 14 ms. Remains 26 /30 variables (removed 4) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 26 cols
[2021-05-17 04:53:12] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:53:12] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
[2021-05-17 04:53:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 26 cols
[2021-05-17 04:53:12] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:53:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 19/22 transitions.
Product exploration explored 100000 steps with 40 reset in 298 ms.
Product exploration explored 100000 steps with 40 reset in 265 ms.
[2021-05-17 04:53:13] [INFO ] Flatten gal took : 8 ms
[2021-05-17 04:53:13] [INFO ] Flatten gal took : 7 ms
[2021-05-17 04:53:13] [INFO ] Time to serialize gal into /tmp/LTL15127443224734966338.gal : 3 ms
[2021-05-17 04:53:13] [INFO ] Time to serialize properties into /tmp/LTL7087158477352107787.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15127443224734966338.gal, -t, CGAL, -LTL, /tmp/LTL7087158477352107787.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15127443224734966338.gal -t CGAL -LTL /tmp/LTL7087158477352107787.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X("(start>=1)")))||((F("((NADPH<1)||(GSSG<1))"))&&(X((F("((NADH<1)||(Pyr<1))"))&&(G("(start<1)")))))))
Formula 0 simplified : !(XX"(start>=1)" | (F"((NADPH<1)||(GSSG<1))" & X(F"((NADH<1)||(Pyr<1))" & G"(start<1)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-17 04:53:13] [INFO ] Flatten gal took : 5 ms
[2021-05-17 04:53:13] [INFO ] Applying decomposition
[2021-05-17 04:53:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14687357046784013463.txt, -o, /tmp/graph14687357046784013463.bin, -w, /tmp/graph14687357046784013463.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14687357046784013463.bin, -l, -1, -v, -w, /tmp/graph14687357046784013463.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 04:53:13] [INFO ] Decomposing Gal with order
[2021-05-17 04:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 04:53:13] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-17 04:53:13] [INFO ] Flatten gal took : 52 ms
[2021-05-17 04:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 04:53:13] [INFO ] Time to serialize gal into /tmp/LTL11442744057100678151.gal : 2 ms
[2021-05-17 04:53:13] [INFO ] Time to serialize properties into /tmp/LTL6696190133798799410.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11442744057100678151.gal, -t, CGAL, -LTL, /tmp/LTL6696190133798799410.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11442744057100678151.gal -t CGAL -LTL /tmp/LTL6696190133798799410.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(X("(u7.start>=1)")))||((F("((i0.u0.NADPH<1)||(i0.u1.GSSG<1))"))&&(X((F("((u7.NADH<1)||(i3.u6.Pyr<1))"))&&(G("(u7.start<1)")))))))
Formula 0 simplified : !(XX"(u7.start>=1)" | (F"((i0.u0.NADPH<1)||(i0.u1.GSSG<1))" & X(F"((u7.NADH<1)||(i3.u6.Pyr<1))" & G"(u7.start<1)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin17178706604705083370
[2021-05-17 04:53:13] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17178706604705083370
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17178706604705083370]
Compilation finished in 379 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17178706604705083370]
Link finished in 47 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(X((LTLAPp0==true)))||(<>((LTLAPp1==true))&&X((<>((LTLAPp2==true))&&[](!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17178706604705083370]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000100000-12 finished in 19099 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0 U (p1||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:28] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 04:53:28] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:28] [INFO ] Implicit Places using invariants in 35 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:28] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:53:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 29/32 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.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:28] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:53:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000100000-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s10 1) (OR (LT s5 1) (LT s26 1))), p0:(AND (GEQ s6 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2925 steps with 1 reset in 9 ms.
FORMULA GPPP-PT-C0100N0000100000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-13 finished in 322 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((X(F(!p1))||p0) U (G((X(F(!p1))||p2))||(F(G(p3))&&(X(F(!p1))||p4)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 04:53:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:53:28] [INFO ] Implicit Places using invariants in 33 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:28] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 04:53:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:53:29] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 04:53:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 546 ms :[(OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), p1, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000100000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p4 p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p4) p0), acceptance={} source=2 dest: 6}, { cond=(AND p2 p4 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p4 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND p2 (NOT p4) (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={1} source=5 dest: 5}, { cond=(AND p2 p3 p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p4 p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p4) p0 p1), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p2 (NOT p4) p0 p1), acceptance={1} source=6 dest: 6}, { cond=(AND p2 p4 (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) p4 (NOT p0) p1), acceptance={} source=6 dest: 8}, { cond=(AND p2 (NOT p4) (NOT p0) p1), acceptance={} source=6 dest: 9}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) p1), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p3 p1), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 3}, { cond=(AND p2 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (LT s5 1) (LT s26 1)), p4:(OR (LT s5 1) (LT s26 1)), p0:(OR (LT s5 1) (LT s26 1)), p1:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s24 1)), p3:(OR (LT s6 1) (LT s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 492 reset in 162 ms.
Stack based approach found an accepted trace after 176 steps with 4 reset with depth 56 and stack size 55 in 1 ms.
FORMULA GPPP-PT-C0100N0000100000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-14 finished in 867 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 2 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 28 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 26 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 25 transition count 17
Applied a total of 11 rules in 5 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 04:53:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:53:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 04:53:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:53:29] [INFO ] Implicit Places using invariants in 42 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
[2021-05-17 04:53:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-17 04:53:29] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:53:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 23/32 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 16
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 04:53:29] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 04:53:29] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 04:53:29] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 04:53:30] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 82 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 21/32 places, 16/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-17 04:53:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2021-05-17 04:53:30] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 04:53:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 3 iterations. Remains : 21/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000100000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (LT s0 1) (LT s6 1)) (LT s11 1)), p1:(OR (LT s0 1) (LT s6 1)), p0:(LT s11 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 40 steps with 1 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000100000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-15 finished in 379 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12041682502766347782
[2021-05-17 04:53:30] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2021-05-17 04:53:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 04:53:30] [INFO ] Applying decomposition
[2021-05-17 04:53:30] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2021-05-17 04:53:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 04:53:30] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2021-05-17 04:53:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 04:53:30] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12041682502766347782
[2021-05-17 04:53:30] [INFO ] Flatten gal took : 6 ms
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12041682502766347782]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3586175808776764788.txt, -o, /tmp/graph3586175808776764788.bin, -w, /tmp/graph3586175808776764788.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3586175808776764788.bin, -l, -1, -v, -w, /tmp/graph3586175808776764788.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 04:53:30] [INFO ] Decomposing Gal with order
[2021-05-17 04:53:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 04:53:30] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-17 04:53:30] [INFO ] Flatten gal took : 26 ms
[2021-05-17 04:53:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 04:53:30] [INFO ] Time to serialize gal into /tmp/LTLFireability2878910901721010524.gal : 3 ms
[2021-05-17 04:53:30] [INFO ] Time to serialize properties into /tmp/LTLFireability3642546202958647678.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability2878910901721010524.gal, -t, CGAL, -LTL, /tmp/LTLFireability3642546202958647678.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability2878910901721010524.gal -t CGAL -LTL /tmp/LTLFireability3642546202958647678.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(X("(i4.u0.start>=1)")))||((F(!("((i1.u1.NADPH>=1)&&(i1.u2.GSSG>=1))")))&&(X((F(!("((i4.u5.NADH>=1)&&(i4.u5.Pyr>=1))")))&&(G("(i4.u0.start<1)")))))))
Formula 0 simplified : !(XX"(i4.u0.start>=1)" | (F!"((i1.u1.NADPH>=1)&&(i1.u2.GSSG>=1))" & X(F!"((i4.u5.NADH>=1)&&(i4.u5.Pyr>=1))" & G"(i4.u0.start<1)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-17 04:53:30] [INFO ] Flatten gal took : 7 ms
[2021-05-17 04:53:30] [INFO ] Time to serialize gal into /tmp/LTLFireability10163387590951044271.gal : 19 ms
[2021-05-17 04:53:30] [INFO ] Time to serialize properties into /tmp/LTLFireability4650770312360634827.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability10163387590951044271.gal, -t, CGAL, -LTL, /tmp/LTLFireability4650770312360634827.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability10163387590951044271.gal -t CGAL -LTL /tmp/LTLFireability4650770312360634827.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X("(start>=1)")))||((F(!("((NADPH>=1)&&(GSSG>=1))")))&&(X((F(!("((NADH>=1)&&(Pyr>=1))")))&&(G("(start<1)")))))))
Formula 0 simplified : !(XX"(start>=1)" | (F!"((NADPH>=1)&&(GSSG>=1))" & X(F!"((NADH>=1)&&(Pyr>=1))" & G"(start<1)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-17 04:53:30] [INFO ] Flatten gal took : 12 ms
[2021-05-17 04:53:30] [INFO ] Input system was already deterministic with 22 transitions.
[2021-05-17 04:53:30] [INFO ] Transformed 32 places.
[2021-05-17 04:53:30] [INFO ] Transformed 22 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 04:53:30] [INFO ] Time to serialize gal into /tmp/LTLFireability16557656525269282323.gal : 1 ms
[2021-05-17 04:53:30] [INFO ] Time to serialize properties into /tmp/LTLFireability4163635430363252263.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16557656525269282323.gal, -t, CGAL, -LTL, /tmp/LTLFireability4163635430363252263.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16557656525269282323.gal -t CGAL -LTL /tmp/LTLFireability4163635430363252263.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(X("(start>=1)")))||((F(!("((NADPH>=1)&&(GSSG>=1))")))&&(X((F(!("((NADH>=1)&&(Pyr>=1))")))&&(G("(start<1)")))))))
Formula 0 simplified : !(XX"(start>=1)" | (F!"((NADPH>=1)&&(GSSG>=1))" & X(F!"((NADH>=1)&&(Pyr>=1))" & G"(start<1)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Compilation finished in 457 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12041682502766347782]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(X((LTLAPp0==true)))||(<>(!(LTLAPp1==true))&&X((<>((LTLAPp2==true))&&[](!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12041682502766347782]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(X((LTLAPp0==true)))||(<>(!(LTLAPp1==true))&&X((<>((LTLAPp2==true))&&[](!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12041682502766347782]
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(X((LTLAPp0==true)))||(<>(!(LTLAPp1==true))&&X((<>((LTLAPp2==true))&&[](!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12041682502766347782]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: LTL layer: formula: (X(X((LTLAPp0==true)))||(<>(!(LTLAPp1==true))&&X((<>((LTLAPp2==true))&&[](!(LTLAPp0==true))))))
pins2lts-mc-linux64( 2/ 8), 0.011: "(X(X((LTLAPp0==true)))||(<>(!(LTLAPp1==true))&&X((<>((LTLAPp2==true))&&[](!(LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.082: DFS-FIFO for weak LTL, using special progress label 26
pins2lts-mc-linux64( 0/ 8), 0.082: There are 27 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.082: State length is 33, there are 56 groups
pins2lts-mc-linux64( 0/ 8), 0.082: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.082: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.082: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.082: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.253: ~1 levels ~960 states ~4264 transitions
pins2lts-mc-linux64( 0/ 8), 0.262: ~1 levels ~1920 states ~9448 transitions
pins2lts-mc-linux64( 5/ 8), 0.259: ~1 levels ~3840 states ~21696 transitions
pins2lts-mc-linux64( 3/ 8), 0.265: ~1 levels ~7680 states ~43536 transitions
pins2lts-mc-linux64( 5/ 8), 0.284: ~1 levels ~15360 states ~90584 transitions
pins2lts-mc-linux64( 5/ 8), 0.313: ~1 levels ~30720 states ~185752 transitions
pins2lts-mc-linux64( 5/ 8), 0.383: ~1 levels ~61440 states ~376368 transitions
pins2lts-mc-linux64( 5/ 8), 0.528: ~1 levels ~122880 states ~769328 transitions
pins2lts-mc-linux64( 5/ 8), 0.831: ~1 levels ~245760 states ~1590184 transitions
pins2lts-mc-linux64( 5/ 8), 1.441: ~1 levels ~491520 states ~3276296 transitions
pins2lts-mc-linux64( 5/ 8), 2.714: ~1 levels ~983040 states ~6863104 transitions
pins2lts-mc-linux64( 5/ 8), 5.271: ~1 levels ~1966080 states ~13997904 transitions
pins2lts-mc-linux64( 5/ 8), 10.832: ~1 levels ~3932160 states ~28795928 transitions
pins2lts-mc-linux64( 5/ 8), 22.397: ~1 levels ~7864320 states ~60016488 transitions
pins2lts-mc-linux64( 5/ 8), 46.432: ~1 levels ~15728640 states ~123198384 transitions
pins2lts-mc-linux64( 5/ 8), 95.205: ~1 levels ~31457280 states ~251625176 transitions
pins2lts-mc-linux64( 5/ 8), 196.338: ~1 levels ~62914560 states ~512202056 transitions
pins2lts-mc-linux64( 0/ 8), 428.222: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 428.269:
pins2lts-mc-linux64( 0/ 8), 428.269: mean standard work distribution: 7.4% (states) 7.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 428.269:
pins2lts-mc-linux64( 0/ 8), 428.269: Explored 114913221 states 986417502 transitions, fanout: 8.584
pins2lts-mc-linux64( 0/ 8), 428.269: Total exploration time 428.190 sec (428.130 sec minimum, 428.155 sec on average)
pins2lts-mc-linux64( 0/ 8), 428.269: States per second: 268370, Transitions per second: 2303691
pins2lts-mc-linux64( 0/ 8), 428.269:
pins2lts-mc-linux64( 0/ 8), 428.269: Progress states detected: 134217356
pins2lts-mc-linux64( 0/ 8), 428.269: Redundant explorations: -14.3828
pins2lts-mc-linux64( 0/ 8), 428.269:
pins2lts-mc-linux64( 0/ 8), 428.269: Queue width: 8B, total height: 41885086, memory: 319.56MB
pins2lts-mc-linux64( 0/ 8), 428.269: Tree memory: 1206.5MB, 9.4 B/state, compr.: 7.0%
pins2lts-mc-linux64( 0/ 8), 428.269: Tree fill ratio (roots/leafs): 99.0%/71.0%
pins2lts-mc-linux64( 0/ 8), 428.269: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 428.269: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 428.269: Est. total memory use: 1526.0MB (~1343.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(X((LTLAPp0==true)))||(<>(!(LTLAPp1==true))&&X((<>((LTLAPp2==true))&&[](!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12041682502766347782]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(X((LTLAPp0==true)))||(<>(!(LTLAPp1==true))&&X((<>((LTLAPp2==true))&&[](!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12041682502766347782]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)

BK_STOP 1621227897057

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

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