About the Execution of ITS-Tools for GPPP-PT-C0100N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 623.960 | 45155.00 | 61840.00 | 473.20 | FFFFFFFFFFTTTFFF | normal |
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-162075331300245.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-C0100N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331300245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K 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.9K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 19:56 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-C0100N0000000100-00
FORMULA_NAME GPPP-PT-C0100N0000000100-01
FORMULA_NAME GPPP-PT-C0100N0000000100-02
FORMULA_NAME GPPP-PT-C0100N0000000100-03
FORMULA_NAME GPPP-PT-C0100N0000000100-04
FORMULA_NAME GPPP-PT-C0100N0000000100-05
FORMULA_NAME GPPP-PT-C0100N0000000100-06
FORMULA_NAME GPPP-PT-C0100N0000000100-07
FORMULA_NAME GPPP-PT-C0100N0000000100-08
FORMULA_NAME GPPP-PT-C0100N0000000100-09
FORMULA_NAME GPPP-PT-C0100N0000000100-10
FORMULA_NAME GPPP-PT-C0100N0000000100-11
FORMULA_NAME GPPP-PT-C0100N0000000100-12
FORMULA_NAME GPPP-PT-C0100N0000000100-13
FORMULA_NAME GPPP-PT-C0100N0000000100-14
FORMULA_NAME GPPP-PT-C0100N0000000100-15
=== Now, execution of the tool begins
BK_START 1621220427891
Running Version 0
[2021-05-17 03:00:30] [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 03:00:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 03:00:31] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-17 03:00:31] [INFO ] Transformed 33 places.
[2021-05-17 03:00:31] [INFO ] Transformed 22 transitions.
[2021-05-17 03:00:31] [INFO ] Parsed PT model containing 33 places and 22 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 03:00:31] [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 20 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 03:00:31] [INFO ] Computed 12 place invariants in 13 ms
[2021-05-17 03:00:31] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 03:00:31] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-17 03:00:31] [INFO ] Implicit Places using invariants in 74 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:31] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 03:00:31] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 32/33 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 03:00:31] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 03:00:31] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 03:00:32] [INFO ] Initial state reduction rules for LTL removed 6 formulas.
[2021-05-17 03:00:32] [INFO ] Flatten gal took : 62 ms
FORMULA GPPP-PT-C0100N0000000100-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 03:00:32] [INFO ] Flatten gal took : 14 ms
[2021-05-17 03:00:32] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100358 steps, including 34 resets, run finished after 207 ms. (steps per millisecond=484 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:32] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 03:00:32] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 03:00:32] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-17 03:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:00:32] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||X(F(p1)))))], 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 03:00:32] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 03:00:32] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:32] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 03:00:32] [INFO ] Implicit Places using invariants in 94 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:32] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-17 03:00:33] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:33] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-17 03:00:33] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-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}]], initial=0, aps=[p0:(AND (GEQ s3 2) (GEQ s14 1) (GEQ s26 1)), p1:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 13012 reset in 510 ms.
Stack based approach found an accepted trace after 31631 steps with 3731 reset with depth 141 and stack size 137 in 249 ms.
FORMULA GPPP-PT-C0100N0000000100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-00 finished in 1480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], 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.
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 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
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 7 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 2 with 3 rules applied. Total rules applied 10 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 2 with 2 rules applied. Total rules applied 12 place count 25 transition count 17
Applied a total of 12 rules in 29 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 03:00:34] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 03:00:34] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 03:00:34] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 03:00:34] [INFO ] Implicit Places using invariants in 59 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
[2021-05-17 03:00:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-17 03:00:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 03:00:34] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 24/32 places, 17/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 16
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 16
Applied a total of 2 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 03:00:34] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-17 03:00:34] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 03:00:34] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 03:00:34] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 121 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 21/32 places, 16/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-17 03:00:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2021-05-17 03:00:34] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 03:00:34] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 3 iterations. Remains : 21/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 1), p1:(OR (AND (GEQ s2 1) (GEQ s6 1)) (GEQ s12 1))], nbAcceptance=2, 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 1258 steps with 0 reset in 15 ms.
FORMULA GPPP-PT-C0100N0000000100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-01 finished in 505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 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 03:00:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:34] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:34] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 03:00:34] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:34] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 03:00:34] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:34] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-17 03:00:34] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:34] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-17 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s13 1) (GEQ s25 300)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-03 finished in 477 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 25 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 24 transition count 16
Applied a total of 14 rules in 15 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 03:00:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 03:00:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 03:00:35] [INFO ] Implicit Places using invariants in 43 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
[2021-05-17 03:00:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 03:00:35] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 23/32 places, 16/22 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 5 place count 20 transition count 14
Applied a total of 5 rules in 3 ms. Remains 20 /23 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 03:00:35] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 03:00:35] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 03:00:35] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 03:00:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 03:00:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 03:00:35] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 86 ms :[p0, p0]
Running random walk in product with property : GPPP-PT-C0100N0000000100-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4979 reset in 225 ms.
Stack based approach found an accepted trace after 134 steps with 4 reset with depth 33 and stack size 33 in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-04 finished in 587 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((((F(!p2)&&X(p3)&&p1) U p3)&&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 03:00:35] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:35] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:35] [INFO ] Implicit Places using invariants in 52 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:35] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:35] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, p2, (AND p0 (NOT p3) p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 p3) (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p3) p1), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s13 1)), p3:(AND (GEQ s1 1) (GEQ s13 1)), p1:(AND (GEQ s1 1) (GEQ s24 1)), p2:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, 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-C0100N0000000100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-05 finished in 506 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 25 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 24 transition count 16
Applied a total of 14 rules in 16 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 03:00:36] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-17 03:00:36] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 03:00:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 03:00:36] [INFO ] Implicit Places using invariants in 65 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
[2021-05-17 03:00:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 03:00:36] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 03:00:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 23/32 places, 16/22 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 5 place count 20 transition count 14
Applied a total of 5 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 03:00:36] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 03:00:36] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 03:00:36] [INFO ] Computed 7 place invariants in 13 ms
[2021-05-17 03:00:36] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 03:00:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 03:00:36] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 03:00:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1) (GEQ s17 700))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4343 reset in 127 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-08 finished in 476 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p1 U p2)&&p0)))], workingDir=/home/mcc/execution]
Support contains 9 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 03:00:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:36] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:36] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-17 03:00:36] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : GPPP-PT-C0100N0000000100-09 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (GEQ s17 1) (GEQ s18 1)), p1:(AND (GEQ s3 2) (GEQ s14 1) (GEQ s27 1)), p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s31 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-09 finished in 390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (X(F(p2))||G(p0)||p1))))], 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 03:00:37] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:37] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:37] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:37] [INFO ] Implicit Places using invariants in 49 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:37] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 03:00:37] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:37] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 03:00:37] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (LT s7 1) (LT s28 1)), p1:(OR (LT s7 1) (LT s28 1)), p0:(OR (LT s4 1) (LT s5 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Knowledge obtained : [p2, p1, p0]
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 7 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 30 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 29 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 29 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 29 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 28 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 28 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 28 transition count 19
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 12 rules in 20 ms. Remains 28 /31 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 03:00:38] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 03:00:38] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
[2021-05-17 03:00:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 03:00:39] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 03:00:39] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/31 places, 19/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
[2021-05-17 03:00:39] [INFO ] Flatten gal took : 11 ms
[2021-05-17 03:00:39] [INFO ] Flatten gal took : 8 ms
[2021-05-17 03:00:39] [INFO ] Time to serialize gal into /tmp/LTL14875879102129172386.gal : 77 ms
[2021-05-17 03:00:39] [INFO ] Time to serialize properties into /tmp/LTL17855725207603674914.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/LTL14875879102129172386.gal, -t, CGAL, -LTL, /tmp/LTL17855725207603674914.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/LTL14875879102129172386.gal -t CGAL -LTL /tmp/LTL17855725207603674914.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((NADPH<1)||(GSSG<1))")U((("((Ru5P<1)||(a2<1))")||(X(F("((Ru5P<1)||(a2<1))"))))||(G("((NADPH<1)||(GSSG<1))"))))))
Formula 0 simplified : !X("((NADPH<1)||(GSSG<1))" U ("((Ru5P<1)||(a2<1))" | XF"((Ru5P<1)||(a2<1))" | G"((NADPH<1)||(GSSG<1))"))
Detected timeout of ITS tools.
[2021-05-17 03:00:54] [INFO ] Flatten gal took : 4 ms
[2021-05-17 03:00:54] [INFO ] Applying decomposition
[2021-05-17 03:00:54] [INFO ] Flatten gal took : 3 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/graph16970156726449347844.txt, -o, /tmp/graph16970156726449347844.bin, -w, /tmp/graph16970156726449347844.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/graph16970156726449347844.bin, -l, -1, -v, -w, /tmp/graph16970156726449347844.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 03:00:54] [INFO ] Decomposing Gal with order
[2021-05-17 03:00:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 03:00:54] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 03:00:55] [INFO ] Flatten gal took : 176 ms
[2021-05-17 03:00:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 03:00:55] [INFO ] Time to serialize gal into /tmp/LTL9336309695172286483.gal : 3 ms
[2021-05-17 03:00:55] [INFO ] Time to serialize properties into /tmp/LTL16771279459552221896.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/LTL9336309695172286483.gal, -t, CGAL, -LTL, /tmp/LTL16771279459552221896.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/LTL9336309695172286483.gal -t CGAL -LTL /tmp/LTL16771279459552221896.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i0.u0.NADPH<1)||(i0.u1.GSSG<1))")U((("((u9.Ru5P<1)||(u9.a2<1))")||(X(F("((u9.Ru5P<1)||(u9.a2<1))"))))||(G("((i0.u0.NADPH<1)||(i0.u1.GSSG<1))"))))))
Formula 0 simplified : !X("((i0.u0.NADPH<1)||(i0.u1.GSSG<1))" U ("((u9.Ru5P<1)||(u9.a2<1))" | XF"((u9.Ru5P<1)||(u9.a2<1))" | G"((i0.u0.NADPH<1)||(i0.u1.GSSG<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7809603604597720896
[2021-05-17 03:01:10] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7809603604597720896
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/ltsmin7809603604597720896]
Compilation finished in 535 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7809603604597720896]
Link finished in 65 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(((LTLAPp0==true) U (X(<>((LTLAPp2==true)))||[]((LTLAPp0==true))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7809603604597720896]
LTSmin run took 269 ms.
FORMULA GPPP-PT-C0100N0000000100-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000000100-12 finished in 33935 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 11 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 03:01:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 03:01:11] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 03:01:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 03:01:11] [INFO ] Implicit Places using invariants in 43 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2021-05-17 03:01:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 03:01:11] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 03:01:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 15/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-17 03:01:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 03:01:11] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 03:01:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s15 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 1247 steps with 0 reset in 12 ms.
FORMULA GPPP-PT-C0100N0000000100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-13 finished in 262 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((F(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 32 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 29 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 27 transition count 19
Applied a total of 8 rules in 4 ms. Remains 27 /32 variables (removed 5) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 03:01:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 03:01:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 03:01:11] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 03:01:11] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 03:01:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 03:01:11] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2021-05-17 03:01:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 03:01:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 03:01:11] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/32 places, 19/22 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s2 1) (LT s7 1) (LT s26 1)), p2:(OR (LT s1 1) (LT s9 1) (LT s0 1) (LT s2 1) (LT s7 1) (LT s26 1)), p0:(AND (GEQ s14 1) (GEQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 969 reset in 392 ms.
Stack based approach found an accepted trace after 67 steps with 1 reset with depth 39 and stack size 38 in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-15 finished in 713 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621220473046
--------------------
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-C0100N0000000100"
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-C0100N0000000100, 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-162075331300245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 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 '
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 ;