About the Execution of ITS-Tools for GPPP-PT-C0001N0000001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 548.340 | 76720.00 | 96050.00 | 516.40 | FFTFFFFFTTFFFTFF | 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-162075331200189.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-C0001N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331200189
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K 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:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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-C0001N0000001000-00
FORMULA_NAME GPPP-PT-C0001N0000001000-01
FORMULA_NAME GPPP-PT-C0001N0000001000-02
FORMULA_NAME GPPP-PT-C0001N0000001000-03
FORMULA_NAME GPPP-PT-C0001N0000001000-04
FORMULA_NAME GPPP-PT-C0001N0000001000-05
FORMULA_NAME GPPP-PT-C0001N0000001000-06
FORMULA_NAME GPPP-PT-C0001N0000001000-07
FORMULA_NAME GPPP-PT-C0001N0000001000-08
FORMULA_NAME GPPP-PT-C0001N0000001000-09
FORMULA_NAME GPPP-PT-C0001N0000001000-10
FORMULA_NAME GPPP-PT-C0001N0000001000-11
FORMULA_NAME GPPP-PT-C0001N0000001000-12
FORMULA_NAME GPPP-PT-C0001N0000001000-13
FORMULA_NAME GPPP-PT-C0001N0000001000-14
FORMULA_NAME GPPP-PT-C0001N0000001000-15
=== Now, execution of the tool begins
BK_START 1621202136497
Running Version 0
[2021-05-16 21:55:39] [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-16 21:55:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 21:55:39] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-16 21:55:39] [INFO ] Transformed 33 places.
[2021-05-16 21:55:39] [INFO ] Transformed 22 transitions.
[2021-05-16 21:55:39] [INFO ] Parsed PT model containing 33 places and 22 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 21:55:39] [INFO ] Initial state test concluded for 2 properties.
Support contains 25 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 21 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 21:55:39] [INFO ] Computed 13 place invariants in 10 ms
[2021-05-16 21:55:39] [INFO ] Dead Transitions using invariants and state equation in 226 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 21:55:39] [INFO ] Computed 13 place invariants in 4 ms
[2021-05-16 21:55:39] [INFO ] Implicit Places using invariants in 72 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:40] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-16 21:55:40] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Starting structural reductions, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:40] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 21:55:40] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
[2021-05-16 21:55:40] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 21:55:40] [INFO ] Flatten gal took : 45 ms
FORMULA GPPP-PT-C0001N0000001000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 21:55:40] [INFO ] Flatten gal took : 15 ms
[2021-05-16 21:55:40] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 46897 steps, including 1 resets, run visited all 18 properties in 188 ms. (steps per millisecond=249 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:55:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:55:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:40] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 21:55:41] [INFO ] Implicit Places using invariants in 41 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:55:41] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:55:41] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:55:41] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 21:55:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 2) (GEQ s11 1) (GEQ s23 1)), p1:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18803 reset in 424 ms.
Stack based approach found an accepted trace after 689 steps with 127 reset with depth 20 and stack size 20 in 4 ms.
FORMULA GPPP-PT-C0001N0000001000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-00 finished in 929 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((X(p0)&&F(p1))||G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:41] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 21:55:41] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:41] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-16 21:55:41] [INFO ] Implicit Places using invariants in 78 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:55:41] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:55:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:55:42] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:55:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s5 1) (LT s9 1)), p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2675 reset in 247 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-01 finished in 670 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:55:42] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:55:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:42] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 21:55:42] [INFO ] Implicit Places using invariants in 59 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:55:42] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:55:42] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:55:42] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:55:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s11 1) (GEQ s22 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-03 finished in 380 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F(p0))&&(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 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.
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-16 21:55:42] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:55:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:42] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:55:42] [INFO ] Implicit Places using invariants in 62 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:55:42] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:55:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 21:55:43] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 21:55:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s16 1), p2:(GEQ s8 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]]
Product exploration explored 100000 steps with 2949 reset in 236 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-04 finished in 758 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:55:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:55:43] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:55:43] [INFO ] Implicit Places using invariants in 74 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:55:43] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:55:43] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Starting structural reductions, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:55:43] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-16 21:55:43] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s22 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-05 finished in 479 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
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 5 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 30 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 29 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 29 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 28 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 25 transition count 17
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 13 place count 23 transition count 16
Applied a total of 13 rules in 38 ms. Remains 23 /31 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 23 cols
[2021-05-16 21:55:44] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:55:44] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-16 21:55:44] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:55:44] [INFO ] Implicit Places using invariants in 35 ms returned [1, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
[2021-05-16 21:55:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2021-05-16 21:55:44] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 21:55:44] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 21/31 places, 16/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 15
Applied a total of 2 rules in 6 ms. Remains 20 /21 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 20 cols
[2021-05-16 21:55:44] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 21:55:44] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-16 21:55:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 21:55:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 21:55:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/31 places, 15/22 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-06 finished in 304 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
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 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 30 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 29 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 29 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 28 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 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 12 place count 24 transition count 16
Applied a total of 12 rules in 9 ms. Remains 24 /31 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 21:55:44] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 21:55:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 21:55:44] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 21:55:44] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
[2021-05-16 21:55:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2021-05-16 21:55:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 21:55:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/31 places, 16/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 17 transition count 12
Applied a total of 8 rules in 4 ms. Remains 17 /21 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-16 21:55:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 21:55:44] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-16 21:55:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 21:55:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 21:55:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : GPPP-PT-C0001N0000001000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 2) (GEQ s7 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-07 finished in 241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:55:44] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:55:44] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:55:44] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 21:55:44] [INFO ] Implicit Places using invariants in 35 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:55:44] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:55:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:55:44] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:55:44] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s15 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 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 5 edges and 29 vertex of which 2 / 29 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: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 28 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 28 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 28 transition count 21
Performed 2 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 2 rules applied. Total rules applied 6 place count 28 transition count 21
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 6 rules in 7 ms. Remains 28 /29 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 28 cols
[2021-05-16 21:55:45] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:55:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
[2021-05-16 21:55:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 21 rows 28 cols
[2021-05-16 21:55:45] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:55:45] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/29 places, 21/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 484 ms.
Product exploration explored 100000 steps with 50000 reset in 349 ms.
[2021-05-16 21:55:46] [INFO ] Flatten gal took : 5 ms
[2021-05-16 21:55:46] [INFO ] Flatten gal took : 5 ms
[2021-05-16 21:55:46] [INFO ] Time to serialize gal into /tmp/LTL10516594232337501970.gal : 2 ms
[2021-05-16 21:55:46] [INFO ] Time to serialize properties into /tmp/LTL2038671633538773219.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/LTL10516594232337501970.gal, -t, CGAL, -LTL, /tmp/LTL2038671633538773219.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/LTL10516594232337501970.gal -t CGAL -LTL /tmp/LTL2038671633538773219.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((_1_3_BPG<1)||(ADP<1))"))))
Formula 0 simplified : !XF"((_1_3_BPG<1)||(ADP<1))"
Detected timeout of ITS tools.
[2021-05-16 21:56:01] [INFO ] Flatten gal took : 4 ms
[2021-05-16 21:56:01] [INFO ] Applying decomposition
[2021-05-16 21:56:01] [INFO ] Flatten gal took : 4 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/graph7432350854096362551.txt, -o, /tmp/graph7432350854096362551.bin, -w, /tmp/graph7432350854096362551.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/graph7432350854096362551.bin, -l, -1, -v, -w, /tmp/graph7432350854096362551.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 21:56:01] [INFO ] Decomposing Gal with order
[2021-05-16 21:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:56:01] [INFO ] Flatten gal took : 57 ms
[2021-05-16 21:56:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 21:56:01] [INFO ] Time to serialize gal into /tmp/LTL12942932347001795562.gal : 1 ms
[2021-05-16 21:56:01] [INFO ] Time to serialize properties into /tmp/LTL1937368789166192087.ltl : 0 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/LTL12942932347001795562.gal, -t, CGAL, -LTL, /tmp/LTL1937368789166192087.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/LTL12942932347001795562.gal -t CGAL -LTL /tmp/LTL1937368789166192087.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((u3._1_3_BPG<1)||(u4.ADP<1))"))))
Formula 0 simplified : !XF"((u3._1_3_BPG<1)||(u4.ADP<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2608373662174992422
[2021-05-16 21:56:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2608373662174992422
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/ltsmin2608373662174992422]
Compilation finished in 389 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2608373662174992422]
Link finished in 52 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin2608373662174992422]
LTSmin run took 393 ms.
FORMULA GPPP-PT-C0001N0000001000-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-09 finished in 33167 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||X(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:56:17] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 21:56:17] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:56:17] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:56:17] [INFO ] Implicit Places using invariants in 45 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:56:17] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:56:17] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 29/31 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-16 21:56:17] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:56:18] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s0 7) (GEQ s21 7)), p0:(OR (LT s0 7) (LT s21 7)), p2:(AND (GEQ s2 1) (GEQ s3 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][false, false, false]]
Product exploration explored 100000 steps with 11430 reset in 261 ms.
Stack based approach found an accepted trace after 85 steps with 10 reset with depth 8 and stack size 8 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-10 finished in 650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)&&X(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:56:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:56:18] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:56:18] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 21:56:18] [INFO ] Implicit Places using invariants in 50 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:56:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:56:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 29/31 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-16 21:56:18] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:56:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 127 ms :[p0, (OR p1 p0), (OR p0 p1), true]
Running random walk in product with property : GPPP-PT-C0001N0000001000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s24 1)), p1:(OR (LT s0 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-11 finished in 358 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:56:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:56:18] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:56:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:56:18] [INFO ] Implicit Places using invariants in 30 ms returned [0, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:56:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:56:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 29/31 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-16 21:56:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:56:18] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s3 1)), p0:(OR (AND (GEQ s5 1) (GEQ s26 1)) (AND (GEQ s0 1) (GEQ s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-12 finished in 296 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0&&X(X(p1)))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:56:19] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:56:19] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:56:19] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:56:19] [INFO ] Implicit Places using invariants in 38 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:56:19] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:56:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:56:19] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:56:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s22 1)), p1:(OR (LT s6 1) (LT 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]]
Product exploration explored 100000 steps with 33333 reset in 126 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 225 ms.
Product exploration explored 100000 steps with 33333 reset in 237 ms.
[2021-05-16 21:56:20] [INFO ] Flatten gal took : 4 ms
[2021-05-16 21:56:20] [INFO ] Flatten gal took : 3 ms
[2021-05-16 21:56:20] [INFO ] Time to serialize gal into /tmp/LTL1259696993707217158.gal : 1 ms
[2021-05-16 21:56:20] [INFO ] Time to serialize properties into /tmp/LTL13313622766987193829.ltl : 0 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/LTL1259696993707217158.gal, -t, CGAL, -LTL, /tmp/LTL13313622766987193829.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/LTL1259696993707217158.gal -t CGAL -LTL /tmp/LTL13313622766987193829.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((Xu5P<1)||(E4P<1))"))||((X(X("((Xu5P<1)||(E4P<1))")))&&("((ATP<1)||(Gluc<1))")))))
Formula 0 simplified : !F(G"((Xu5P<1)||(E4P<1))" | ("((ATP<1)||(Gluc<1))" & XX"((Xu5P<1)||(E4P<1))"))
Detected timeout of ITS tools.
[2021-05-16 21:56:35] [INFO ] Flatten gal took : 3 ms
[2021-05-16 21:56:35] [INFO ] Applying decomposition
[2021-05-16 21:56:35] [INFO ] Flatten gal took : 2 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/graph7008676204742923850.txt, -o, /tmp/graph7008676204742923850.bin, -w, /tmp/graph7008676204742923850.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/graph7008676204742923850.bin, -l, -1, -v, -w, /tmp/graph7008676204742923850.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 21:56:35] [INFO ] Decomposing Gal with order
[2021-05-16 21:56:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:56:35] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-16 21:56:35] [INFO ] Flatten gal took : 12 ms
[2021-05-16 21:56:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-16 21:56:35] [INFO ] Time to serialize gal into /tmp/LTL10966721886940160536.gal : 5 ms
[2021-05-16 21:56:35] [INFO ] Time to serialize properties into /tmp/LTL11209848505525569331.ltl : 0 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/LTL10966721886940160536.gal, -t, CGAL, -LTL, /tmp/LTL11209848505525569331.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/LTL10966721886940160536.gal -t CGAL -LTL /tmp/LTL11209848505525569331.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((u7.Xu5P<1)||(i4.u2.E4P<1))"))||((X(X("((u7.Xu5P<1)||(i4.u2.E4P<1))")))&&("((i0.u5.ATP<1)||(i0.u5.Gluc<1))")))))
Formula 0 simplified : !F(G"((u7.Xu5P<1)||(i4.u2.E4P<1))" | ("((i0.u5.ATP<1)||(i0.u5.Gluc<1))" & XX"((u7.Xu5P<1)||(i4.u2.E4P<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin624799107112409660
[2021-05-16 21:56:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin624799107112409660
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/ltsmin624799107112409660]
Compilation finished in 219 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin624799107112409660]
Link finished in 37 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, <>(([]((LTLAPp0==true))||(X(X((LTLAPp0==true)))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin624799107112409660]
LTSmin run took 279 ms.
FORMULA GPPP-PT-C0001N0000001000-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-13 finished in 32157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G((F(p1)&&F(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 31 places. Attempting structural reductions.
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 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 30 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 29 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 29 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 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Applied a total of 9 rules in 7 ms. Remains 26 /31 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-16 21:56:51] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 21:56:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-16 21:56:51] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 21:56:51] [INFO ] Implicit Places using invariants in 40 ms returned [0, 1, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
[2021-05-16 21:56:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 21:56:51] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 21:56:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 23/31 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 23 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 21 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 21 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 20 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 18 transition count 12
Applied a total of 10 rules in 4 ms. Remains 18 /23 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 21:56:51] [INFO ] Computed 8 place invariants in 9 ms
[2021-05-16 21:56:51] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 21:56:51] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 21:56:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 21:56:51] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s6 1) (OR (LT s4 1) (LT s15 1))), p2:(AND (GEQ s5 1) (GEQ s6 1)), p1:(GEQ s3 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-14 finished in 379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(F(p0)) U G(p1))||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 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-16 21:56:51] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:56:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 21:56:51] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 21:56:51] [INFO ] Implicit Places using invariants in 37 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 21:56:51] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 21:56:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 29/31 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-16 21:56:51] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 21:56:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p1 (NOT p0)), (NOT p1), false, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1)), p1:(OR (LT s0 7) (LT s21 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 653 reset in 150 ms.
Stack based approach found an accepted trace after 225 steps with 1 reset with depth 105 and stack size 101 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-15 finished in 573 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621202213217
--------------------
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-C0001N0000001000"
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-C0001N0000001000, 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-162075331200189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000001000.tgz
mv GPPP-PT-C0001N0000001000 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 ;