About the Execution of ITS-Tools for GPPP-PT-C0100N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4040.275 | 1036596.00 | 1587263.00 | 2335.30 | FFFFTFFFFFFFFTTF | 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-162075331300236.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-C0100N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331300236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K 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.1K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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-C0100N0000000010-00
FORMULA_NAME GPPP-PT-C0100N0000000010-01
FORMULA_NAME GPPP-PT-C0100N0000000010-02
FORMULA_NAME GPPP-PT-C0100N0000000010-03
FORMULA_NAME GPPP-PT-C0100N0000000010-04
FORMULA_NAME GPPP-PT-C0100N0000000010-05
FORMULA_NAME GPPP-PT-C0100N0000000010-06
FORMULA_NAME GPPP-PT-C0100N0000000010-07
FORMULA_NAME GPPP-PT-C0100N0000000010-08
FORMULA_NAME GPPP-PT-C0100N0000000010-09
FORMULA_NAME GPPP-PT-C0100N0000000010-10
FORMULA_NAME GPPP-PT-C0100N0000000010-11
FORMULA_NAME GPPP-PT-C0100N0000000010-12
FORMULA_NAME GPPP-PT-C0100N0000000010-13
FORMULA_NAME GPPP-PT-C0100N0000000010-14
FORMULA_NAME GPPP-PT-C0100N0000000010-15
=== Now, execution of the tool begins
BK_START 1621216037984
Running Version 0
[2021-05-17 01:47:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 01:47:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 01:47:21] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-17 01:47:21] [INFO ] Transformed 33 places.
[2021-05-17 01:47:21] [INFO ] Transformed 22 transitions.
[2021-05-17 01:47:21] [INFO ] Parsed PT model containing 33 places and 22 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 01:47:21] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C0100N0000000010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 157 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 01:47:22] [INFO ] Computed 12 place invariants in 11 ms
[2021-05-17 01:47:22] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 01:47:22] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-17 01:47:22] [INFO ] Implicit Places using invariants in 73 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:22] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 01:47:22] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:22] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 01:47:22] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
[2021-05-17 01:47:22] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 01:47:22] [INFO ] Flatten gal took : 45 ms
FORMULA GPPP-PT-C0100N0000000010-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 01:47:22] [INFO ] Flatten gal took : 14 ms
[2021-05-17 01:47:22] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100001 steps, including 226 resets, run finished after 306 ms. (steps per millisecond=326 ) properties (out of 20) seen :19
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:23] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-17 01:47:23] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 01:47:23] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-17 01:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:47:23] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 01:47:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:47:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 01:47:23] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-17 01:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:47:29] [INFO ] [Nat]Absence check using state equation in 6103 ms returned unknown
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
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 19 place count 20 transition count 13
Applied a total of 19 rules in 22 ms. Remains 20 /31 variables (removed 11) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 01:47:29] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 01:47:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 01:47:29] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 01:47:29] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 01:47:29] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 01:47:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:47:29] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [0, 13]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 132 ms to find 2 implicit places.
[2021-05-17 01:47:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-17 01:47:29] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-17 01:47:29] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 18/31 places, 13/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2021-05-17 01:47:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-17 01:47:29] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-17 01:47:29] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 18/31 places, 13/22 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s15 s2)], 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 2 ms.
FORMULA GPPP-PT-C0100N0000000010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-00 finished in 703 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(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.
Graph (trivial) has 3 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.
Performed 1 Post agglomeration using F-continuation condition.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 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 8 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 25 transition count 17
Applied a total of 10 rules in 14 ms. Remains 25 /31 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 01:47:30] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 01:47:30] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 01:47:30] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:30] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 01:47:30] [INFO ] Computed 9 place invariants in 10 ms
[2021-05-17 01:47:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:47:30] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [0, 2, 18]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 157 ms to find 3 implicit places.
[2021-05-17 01:47:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 22 cols
[2021-05-17 01:47:30] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-17 01:47:30] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 22/31 places, 17/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2021-05-17 01:47:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 22 cols
[2021-05-17 01:47:30] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 01:47:30] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/31 places, 17/22 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT s13 s1), p1:(LEQ s0 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-03 finished in 486 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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.
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 31 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 23 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 21 transition count 15
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 19 place count 20 transition count 14
Applied a total of 19 rules in 14 ms. Remains 20 /31 variables (removed 11) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 01:47:30] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 01:47:30] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 01:47:30] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 01:47:30] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 01:47:30] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 01:47:31] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [0, 13]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 135 ms to find 2 implicit places.
[2021-05-17 01:47:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 01:47:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 18/31 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 01:47:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 01:47:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 18/31 places, 14/22 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9551 reset in 499 ms.
Stack based approach found an accepted trace after 57 steps with 3 reset with depth 9 and stack size 9 in 17 ms.
FORMULA GPPP-PT-C0100N0000000010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-06 finished in 885 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(((F(p1) U p2)&&F(p3))))))], 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 4 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:31] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:31] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-17 01:47:31] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:31] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-17 01:47:31] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:31] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:31] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:32] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s12), p2:(LEQ s7 s20), p1:(LEQ 1 s13), p3:(LEQ 3 s2)], 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 33304 reset in 253 ms.
Product exploration explored 100000 steps with 33330 reset in 299 ms.
Knowledge obtained : [(NOT p0), p2, (NOT p1), p3]
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 33335 reset in 89 ms.
Product exploration explored 100000 steps with 33346 reset in 95 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
Support contains 5 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 4 edges and 30 vertex of which 2 / 30 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 29 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 29 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 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 28 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 28 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 28 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 28 transition count 20
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 9 rules in 7 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 01:47:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
[2021-05-17 01:47:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 01:47:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Stuttering criterion allowed to conclude after 17921 steps with 6015 reset in 98 ms.
FORMULA GPPP-PT-C0100N0000000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-07 finished in 2622 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], 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-17 01:47:34] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:34] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:34] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-17 01:47:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 109 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C0100N0000000010-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT s5 s3), p0:(GT 1 s16)], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-08 finished in 414 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&F((p0&&(p1 U 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 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:34] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:34] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:34] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p0)), (NOT p2), true]
Running random walk in product with property : GPPP-PT-C0100N0000000010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s0 s22), p2:(LEQ 1 s2), p1:(LEQ 2 s25)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-09 finished in 566 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(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.
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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 19 transition count 13
Applied a total of 20 rules in 6 ms. Remains 19 /31 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 01:47:35] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 01:47:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 01:47:35] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 01:47:35] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 01:47:35] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 01:47:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:47:35] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2021-05-17 01:47:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 01:47:35] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 01:47:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/31 places, 13/22 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s17 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-10 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], 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-17 01:47:35] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:47:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:35] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:35] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:35] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:47:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 01:47:35] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 01:47:35] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-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=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT s25 s15), p0:(GT 3 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-12 finished in 468 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)&&X(F(p1))))))], 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-17 01:47:36] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:47:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:36] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:47:36] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:36] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:36] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 126 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:47:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:36] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s17 s23), p1:(GT 2 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 409 reset in 279 ms.
Product exploration explored 100000 steps with 447 reset in 325 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 463 reset in 147 ms.
Product exploration explored 100000 steps with 457 reset in 203 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 4 edges and 30 vertex of which 2 / 30 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 29 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 6 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 01:47:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
[2021-05-17 01:47:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 01:47:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:47:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Product exploration explored 100000 steps with 482 reset in 204 ms.
Product exploration explored 100000 steps with 449 reset in 153 ms.
[2021-05-17 01:47:38] [INFO ] Flatten gal took : 5 ms
[2021-05-17 01:47:38] [INFO ] Flatten gal took : 5 ms
[2021-05-17 01:47:38] [INFO ] Time to serialize gal into /tmp/LTL4039454106095156096.gal : 2 ms
[2021-05-17 01:47:38] [INFO ] Time to serialize properties into /tmp/LTL1692101317677103091.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/LTL4039454106095156096.gal, -t, CGAL, -LTL, /tmp/LTL1692101317677103091.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/LTL4039454106095156096.gal -t CGAL -LTL /tmp/LTL1692101317677103091.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(_3PG<=Gluc)"))&&(X(F("(b1<2)")))))))
Formula 0 simplified : !XF(G"(_3PG<=Gluc)" & XF"(b1<2)")
Detected timeout of ITS tools.
[2021-05-17 01:47:53] [INFO ] Flatten gal took : 9 ms
[2021-05-17 01:47:53] [INFO ] Applying decomposition
[2021-05-17 01:47:53] [INFO ] Flatten gal took : 15 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/graph18152431092278931590.txt, -o, /tmp/graph18152431092278931590.bin, -w, /tmp/graph18152431092278931590.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/graph18152431092278931590.bin, -l, -1, -v, -w, /tmp/graph18152431092278931590.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 01:47:53] [INFO ] Decomposing Gal with order
[2021-05-17 01:47:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 01:47:53] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-17 01:47:53] [INFO ] Flatten gal took : 39 ms
[2021-05-17 01:47:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 01:47:53] [INFO ] Time to serialize gal into /tmp/LTL17756812973995136370.gal : 2 ms
[2021-05-17 01:47:53] [INFO ] Time to serialize properties into /tmp/LTL6635306211889339234.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/LTL17756812973995136370.gal, -t, CGAL, -LTL, /tmp/LTL6635306211889339234.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/LTL17756812973995136370.gal -t CGAL -LTL /tmp/LTL6635306211889339234.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(gu4._3PG<=gu4.Gluc)"))&&(X(F("(gi0.gi1.gu8.b1<2)")))))))
Formula 0 simplified : !XF(G"(gu4._3PG<=gu4.Gluc)" & XF"(gi0.gi1.gu8.b1<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin359343245856231620
[2021-05-17 01:48:08] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin359343245856231620
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/ltsmin359343245856231620]
Compilation finished in 413 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin359343245856231620]
Link finished in 56 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))&&X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin359343245856231620]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000000010-14 finished in 47725 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||X(X(F(p1))))))))], 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-17 01:48:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:48:23] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:23] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-17 01:48:23] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:48:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:48:23] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 01:48:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 01:48:23] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:48:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s7), p1:(LEQ 2 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 479 steps with 1 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-15 finished in 336 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17809522133637412511
[2021-05-17 01:48:24] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2021-05-17 01:48:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 01:48:24] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2021-05-17 01:48:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 01:48:24] [INFO ] Applying decomposition
[2021-05-17 01:48:24] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2021-05-17 01:48:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 01:48:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17809522133637412511
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/ltsmin17809522133637412511]
[2021-05-17 01:48:24] [INFO ] Flatten gal took : 17 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/graph7655331176652012812.txt, -o, /tmp/graph7655331176652012812.bin, -w, /tmp/graph7655331176652012812.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/graph7655331176652012812.bin, -l, -1, -v, -w, /tmp/graph7655331176652012812.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 01:48:24] [INFO ] Decomposing Gal with order
[2021-05-17 01:48:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 01:48:24] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-17 01:48:24] [INFO ] Flatten gal took : 10 ms
[2021-05-17 01:48:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 01:48:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality18198417767908288268.gal : 2 ms
[2021-05-17 01:48:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality5943405816686282008.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/LTLCardinality18198417767908288268.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5943405816686282008.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/LTLCardinality18198417767908288268.gal -t CGAL -LTL /tmp/LTLCardinality5943405816686282008.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(gu7._3PG<=gu7.Gluc)"))&&(X(F("(gi0.gi1.gu8.b1<2)")))))))
Formula 0 simplified : !XF(G"(gu7._3PG<=gu7.Gluc)" & XF"(gi0.gi1.gu8.b1<2)")
Compilation finished in 313 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17809522133637412511]
Link finished in 40 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))&&X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17809522133637412511]
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gu1.Glutathione_oxidation, gi0.gi1.gu2.Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/19/2/22
Computing Next relation with stutter on 4 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: LTL layer: formula: X(<>(([]((LTLAPp0==true))&&X(<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 6/ 8), 0.001: "X(<>(([]((LTLAPp0==true))&&X(<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.046: State length is 32, there are 29 groups
pins2lts-mc-linux64( 0/ 8), 0.046: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.046: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.046: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.047: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.234: [Blue] ~77 levels ~960 states ~2864 transitions
pins2lts-mc-linux64( 0/ 8), 0.260: [Blue] ~197 levels ~1920 states ~7184 transitions
pins2lts-mc-linux64( 5/ 8), 0.262: [Blue] ~456 levels ~3840 states ~11080 transitions
pins2lts-mc-linux64( 0/ 8), 0.265: [Blue] ~407 levels ~7680 states ~25472 transitions
pins2lts-mc-linux64( 0/ 8), 0.269: [Blue] ~407 levels ~15360 states ~54088 transitions
pins2lts-mc-linux64( 7/ 8), 0.287: [Blue] ~415 levels ~30720 states ~103168 transitions
pins2lts-mc-linux64( 7/ 8), 0.313: [Blue] ~415 levels ~61440 states ~211352 transitions
pins2lts-mc-linux64( 3/ 8), 0.394: [Blue] ~422 levels ~122880 states ~420040 transitions
pins2lts-mc-linux64( 7/ 8), 0.509: [Blue] ~415 levels ~245760 states ~877224 transitions
pins2lts-mc-linux64( 7/ 8), 0.742: [Blue] ~415 levels ~491520 states ~1774440 transitions
pins2lts-mc-linux64( 7/ 8), 1.362: [Blue] ~415 levels ~983040 states ~3571488 transitions
pins2lts-mc-linux64( 3/ 8), 2.585: [Blue] ~422 levels ~1966080 states ~8284808 transitions
pins2lts-mc-linux64( 7/ 8), 5.406: [Blue] ~415 levels ~3932160 states ~17177832 transitions
pins2lts-mc-linux64( 5/ 8), 10.746: [Blue] ~464 levels ~7864320 states ~35611944 transitions
pins2lts-mc-linux64( 5/ 8), 21.517: [Blue] ~464 levels ~15728640 states ~71668512 transitions
pins2lts-mc-linux64( 5/ 8), 43.894: [Blue] ~464 levels ~31457280 states ~147135944 transitions
pins2lts-mc-linux64( 5/ 8), 102.550: [Blue] ~464 levels ~62914560 states ~322545064 transitions
pins2lts-mc-linux64( 7/ 8), 161.641: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 161.687:
pins2lts-mc-linux64( 0/ 8), 161.687: Explored 78162551 states 494150614 transitions, fanout: 6.322
pins2lts-mc-linux64( 0/ 8), 161.687: Total exploration time 161.610 sec (161.560 sec minimum, 161.590 sec on average)
pins2lts-mc-linux64( 0/ 8), 161.687: States per second: 483649, Transitions per second: 3057674
pins2lts-mc-linux64( 0/ 8), 161.687:
pins2lts-mc-linux64( 0/ 8), 161.687: State space has 78040788 states, 80 are accepting
pins2lts-mc-linux64( 0/ 8), 161.687: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 161.687: blue states: 78162551 (100.16%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 161.687: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 161.687: all-red states: 80 (0.00%), bogus 211 (0.00%)
pins2lts-mc-linux64( 0/ 8), 161.687:
pins2lts-mc-linux64( 0/ 8), 161.687: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 161.687:
pins2lts-mc-linux64( 0/ 8), 161.687: Queue width: 8B, total height: 3871, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 161.687: Tree memory: 851.4MB, 11.4 B/state, compr.: 8.8%
pins2lts-mc-linux64( 0/ 8), 161.687: Tree fill ratio (roots/leafs): 58.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 161.687: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 161.687: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 161.687: Est. total memory use: 851.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))&&X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17809522133637412511]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))&&X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17809522133637412511]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
279 unique states visited
0 strongly connected components in search stack
279 transitions explored
278 items max in DFS search stack
86860 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,868.625,3763248,1,0,680,2.20899e+07,24,1241,1123,2.59816e+07,3104
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0100N0000000010-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1621217074580
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-C0100N0000000010"
export BK_EXAMINATION="LTLCardinality"
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-C0100N0000000010, examination is LTLCardinality"
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-162075331300236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;