fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r078-tall-165260109800052
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DiscoveryGPU-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
262.852 7598.00 14624.00 47.60 FTFFTFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109800052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 DiscoveryGPU-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.2K Apr 30 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 06:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 06:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 32K May 10 09:33 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 DiscoveryGPU-PT-09a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652629299755

Running Version 202205111006
[2022-05-15 15:41:40] [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]
[2022-05-15 15:41:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:41:41] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2022-05-15 15:41:41] [INFO ] Transformed 93 places.
[2022-05-15 15:41:41] [INFO ] Transformed 127 transitions.
[2022-05-15 15:41:41] [INFO ] Found NUPN structural information;
[2022-05-15 15:41:41] [INFO ] Parsed PT model containing 93 places and 127 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 86 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 86 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 81 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 81 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 79 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 79 transition count 111
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 35 place count 79 transition count 104
Applied a total of 35 rules in 27 ms. Remains 79 /93 variables (removed 14) and now considering 104/127 (removed 23) transitions.
// Phase 1: matrix 104 rows 79 cols
[2022-05-15 15:41:41] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-15 15:41:41] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 104 rows 79 cols
[2022-05-15 15:41:41] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:41:41] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-15 15:41:41] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 79 cols
[2022-05-15 15:41:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:41:41] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/93 places, 104/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/93 places, 104/127 transitions.
Support contains 28 out of 79 places after structural reductions.
[2022-05-15 15:41:41] [INFO ] Flatten gal took : 26 ms
[2022-05-15 15:41:41] [INFO ] Flatten gal took : 14 ms
[2022-05-15 15:41:41] [INFO ] Input system was already deterministic with 104 transitions.
Finished random walk after 420 steps, including 4 resets, run visited all 26 properties in 57 ms. (steps per millisecond=7 )
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 235 edges and 79 vertex of which 77 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&F(p1))||(X(p2)&&G(p3))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 71 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 70 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 70 transition count 95
Applied a total of 18 rules in 8 ms. Remains 70 /79 variables (removed 9) and now considering 95/104 (removed 9) transitions.
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:42] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:42] [INFO ] Computed 2 place invariants in 12 ms
[2022-05-15 15:41:42] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 15:41:42] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:42] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 95/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/79 places, 95/104 transitions.
Stuttering acceptance computed with spot in 493 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p3 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=p3, acceptance={} source=0 dest: 4}, { cond=p3, acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=7 dest: 3}]], initial=0, aps=[p0:(EQ s19 1), p3:(OR (EQ s11 0) (EQ s69 0)), p1:(OR (EQ s26 0) (EQ s69 0)), p2:(AND (EQ s65 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 7 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-00 finished in 788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(!X(F(p0))) U p1))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 73 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 73 transition count 98
Applied a total of 12 rules in 10 ms. Remains 73 /79 variables (removed 6) and now considering 98/104 (removed 6) transitions.
// Phase 1: matrix 98 rows 73 cols
[2022-05-15 15:41:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:42] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 98 rows 73 cols
[2022-05-15 15:41:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:43] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-15 15:41:43] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/79 places, 98/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 72 /72 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 72/79 places, 98/104 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s1 1), p1:(OR (AND (EQ s42 1) (EQ s52 1) (EQ s71 1)) (AND (EQ s44 1) (EQ s71 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 279 ms.
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 191 edges and 72 vertex of which 70 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p0)))))
Knowledge based reduction with 6 factoid took 123 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-01 finished in 918 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(G(p0))))||G(p1)||p2)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 71 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 70 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 70 transition count 95
Applied a total of 18 rules in 13 ms. Remains 70 /79 variables (removed 9) and now considering 95/104 (removed 9) transitions.
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:43] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:43] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 15:41:43] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:44] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 95/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/79 places, 95/104 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=p1, acceptance={} source=7 dest: 3}]], initial=5, aps=[p2:(EQ s32 1), p1:(AND (EQ s44 1) (EQ s69 1)), p0:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-02 finished in 486 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Graph (complete) has 235 edges and 79 vertex of which 77 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 77 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 73 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 15 place count 67 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 21 place count 67 transition count 92
Applied a total of 21 rules in 19 ms. Remains 67 /79 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 67 cols
[2022-05-15 15:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:44] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 92 rows 67 cols
[2022-05-15 15:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:44] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 15:41:44] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/79 places, 92/104 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 49 transition count 75
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 42 transition count 61
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 42 transition count 61
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 35 transition count 47
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 35 transition count 47
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 28 transition count 40
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 28 transition count 40
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 21 transition count 26
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 21 transition count 26
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 14 transition count 19
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 14 transition count 19
Applied a total of 105 rules in 16 ms. Remains 14 /66 variables (removed 52) and now considering 19/92 (removed 73) transitions.
[2022-05-15 15:41:44] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 15:41:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:41:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-15 15:41:44] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 15:41:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 15:41:44] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/79 places, 19/104 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/79 places, 19/104 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-05 finished in 350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 70 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 70 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 69 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 69 transition count 94
Applied a total of 20 rules in 9 ms. Remains 69 /79 variables (removed 10) and now considering 94/104 (removed 10) transitions.
// Phase 1: matrix 94 rows 69 cols
[2022-05-15 15:41:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:44] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2022-05-15 15:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:44] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 15:41:44] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 94/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/79 places, 94/104 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-07 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(!X(p0)) U (G(p2)&&p1))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 72 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 72 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 71 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 71 transition count 96
Applied a total of 16 rules in 9 ms. Remains 71 /79 variables (removed 8) and now considering 96/104 (removed 8) transitions.
// Phase 1: matrix 96 rows 71 cols
[2022-05-15 15:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:44] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 96 rows 71 cols
[2022-05-15 15:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:45] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-15 15:41:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 96 rows 71 cols
[2022-05-15 15:41:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 96/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 71/79 places, 96/104 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s18 1) (EQ s69 1))) (EQ s11 1) (EQ s70 1)), p2:(AND (EQ s11 1) (EQ s70 1)), p0:(AND (EQ s26 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8591 reset in 233 ms.
Stack based approach found an accepted trace after 8363 steps with 689 reset with depth 35 and stack size 33 in 17 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-08 finished in 736 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(X(p1))&&p2)))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Graph (complete) has 235 edges and 79 vertex of which 77 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 77 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 73 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 15 place count 67 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 21 place count 67 transition count 92
Applied a total of 21 rules in 6 ms. Remains 67 /79 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 67 cols
[2022-05-15 15:41:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:45] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 92 rows 67 cols
[2022-05-15 15:41:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:45] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 15:41:45] [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.
[2022-05-15 15:41:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 92 rows 67 cols
[2022-05-15 15:41:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:45] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/79 places, 92/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/79 places, 92/104 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s25 0), p1:(AND (EQ s19 1) (EQ s65 1)), p0:(AND (EQ s48 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-10 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p0))&&G(X(p0))))||(p1 U p2)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 70 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 70 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 69 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 69 transition count 94
Applied a total of 20 rules in 16 ms. Remains 69 /79 variables (removed 10) and now considering 94/104 (removed 10) transitions.
// Phase 1: matrix 94 rows 69 cols
[2022-05-15 15:41:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:46] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 69 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:46] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/79 places, 94/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/79 places, 94/104 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}]], initial=5, aps=[p2:(EQ s57 1), p1:(AND (EQ s46 1) (EQ s68 1)), p0:(OR (EQ s46 0) (EQ s68 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 329 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-11 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Graph (complete) has 235 edges and 79 vertex of which 77 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 77 transition count 99
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 74 transition count 99
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 12 place count 69 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 69 transition count 94
Applied a total of 17 rules in 13 ms. Remains 69 /79 variables (removed 10) and now considering 94/104 (removed 10) transitions.
// Phase 1: matrix 94 rows 69 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:41:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 109 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/79 places, 94/104 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 50 transition count 76
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 43 transition count 62
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 43 transition count 62
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 37 transition count 50
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 37 transition count 50
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 31 transition count 44
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 31 transition count 44
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 25 transition count 32
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 25 transition count 32
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 92 place count 19 transition count 26
Iterating global reduction 0 with 6 rules applied. Total rules applied 98 place count 19 transition count 26
Applied a total of 98 rules in 6 ms. Remains 19 /68 variables (removed 49) and now considering 26/94 (removed 68) transitions.
[2022-05-15 15:41:46] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-15 15:41:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-15 15:41:46] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-15 15:41:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:41:46] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/79 places, 26/104 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/79 places, 26/104 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s18 1)), p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-13 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Graph (complete) has 235 edges and 79 vertex of which 77 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 77 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 73 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 15 place count 67 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 21 place count 67 transition count 92
Applied a total of 21 rules in 6 ms. Remains 67 /79 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 67 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 92 rows 67 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-15 15:41:46] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2022-05-15 15:41:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 92 rows 67 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:46] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/79 places, 92/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/79 places, 92/104 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-14 automaton TGBA Formula[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:(AND (EQ s20 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16850 steps with 747 reset in 28 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-14 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p1))&&(G(p2)||p3)&&p0)))'
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 71 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 70 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 70 transition count 95
Applied a total of 18 rules in 6 ms. Remains 70 /79 variables (removed 9) and now considering 95/104 (removed 9) transitions.
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:46] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:41:47] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-15 15:41:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 95 rows 70 cols
[2022-05-15 15:41:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:41:47] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 95/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/79 places, 95/104 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p2), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s60 0) (EQ s68 0)) (OR (EQ s13 0) (EQ s68 0))), p3:(AND (EQ s32 1) (EQ s69 1)), p2:(EQ s42 0), p1:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-15 finished in 376 ms.
All properties solved by simple procedures.
Total runtime 6415 ms.

BK_STOP 1652629307353

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r078-tall-165260109800052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;