fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r159-oct2-162089267800068
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Planning-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
281.279 6600.00 14214.00 44.00 FFFFFFFFFFFTFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267800068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 Planning-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267800068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 09:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 11:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 56K May 5 16:51 model.pnml
-rw-r--r-- 1 mcc users 1 May 5 16:51 unfinite

--------------------
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 Planning-PT-none-00
FORMULA_NAME Planning-PT-none-01
FORMULA_NAME Planning-PT-none-02
FORMULA_NAME Planning-PT-none-03
FORMULA_NAME Planning-PT-none-04
FORMULA_NAME Planning-PT-none-05
FORMULA_NAME Planning-PT-none-06
FORMULA_NAME Planning-PT-none-07
FORMULA_NAME Planning-PT-none-08
FORMULA_NAME Planning-PT-none-09
FORMULA_NAME Planning-PT-none-10
FORMULA_NAME Planning-PT-none-11
FORMULA_NAME Planning-PT-none-12
FORMULA_NAME Planning-PT-none-13
FORMULA_NAME Planning-PT-none-14
FORMULA_NAME Planning-PT-none-15

=== Now, execution of the tool begins

BK_START 1621180162467

Running Version 0
[2021-05-16 15:49:24] [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-16 15:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:49:24] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-16 15:49:24] [INFO ] Transformed 126 places.
[2021-05-16 15:49:24] [INFO ] Transformed 128 transitions.
[2021-05-16 15:49:24] [INFO ] Parsed PT model containing 126 places and 128 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:49:24] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 2 places and 0 transitions.
FORMULA Planning-PT-none-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 128/128 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 104 transition count 125
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 97 transition count 118
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 97 transition count 118
Applied a total of 37 rules in 21 ms. Remains 97 /124 variables (removed 27) and now considering 118/128 (removed 10) transitions.
[2021-05-16 15:49:24] [INFO ] Flow matrix only has 94 transitions (discarded 24 similar events)
// Phase 1: matrix 94 rows 97 cols
[2021-05-16 15:49:24] [INFO ] Computed 37 place invariants in 8 ms
[2021-05-16 15:49:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2021-05-16 15:49:24] [INFO ] Flow matrix only has 94 transitions (discarded 24 similar events)
// Phase 1: matrix 94 rows 97 cols
[2021-05-16 15:49:24] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-16 15:49:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2021-05-16 15:49:24] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2021-05-16 15:49:24] [INFO ] Flow matrix only has 94 transitions (discarded 24 similar events)
// Phase 1: matrix 94 rows 97 cols
[2021-05-16 15:49:24] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-16 15:49:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 97/124 places, 118/128 transitions.
[2021-05-16 15:49:24] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 15:49:24] [INFO ] Flatten gal took : 29 ms
FORMULA Planning-PT-none-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:49:24] [INFO ] Flatten gal took : 11 ms
[2021-05-16 15:49:25] [INFO ] Input system was already deterministic with 118 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=248 ) properties (out of 24) seen :17
Running SMT prover for 7 properties.
[2021-05-16 15:49:25] [INFO ] Flow matrix only has 94 transitions (discarded 24 similar events)
// Phase 1: matrix 94 rows 97 cols
[2021-05-16 15:49:25] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using 36 positive place invariants in 2 ms returned unsat
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned unsat
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using 36 positive place invariants in 2 ms returned unsat
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using 36 positive and 1 generalized place invariants in 0 ms returned unsat
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using 36 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 15:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2021-05-16 15:49:25] [INFO ] [Real]Absence check using 36 positive place invariants in 1 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2021-05-16 15:49:25] [INFO ] Initial state test concluded for 5 properties.
FORMULA Planning-PT-none-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Graph (trivial) has 37 edges and 97 vertex of which 28 / 97 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 456 edges and 83 vertex of which 77 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 63 transition count 89
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 56 transition count 82
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 56 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 53 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 53 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 53 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 57 place count 42 transition count 67
Applied a total of 57 rules in 18 ms. Remains 42 /97 variables (removed 55) and now considering 67/118 (removed 51) transitions.
[2021-05-16 15:49:25] [INFO ] Flow matrix only has 42 transitions (discarded 25 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-16 15:49:25] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-16 15:49:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-16 15:49:25] [INFO ] Flow matrix only has 42 transitions (discarded 25 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-16 15:49:25] [INFO ] Computed 18 place invariants in 5 ms
[2021-05-16 15:49:25] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-16 15:49:25] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2021-05-16 15:49:25] [INFO ] Redundant transitions in 55 ms returned []
[2021-05-16 15:49:25] [INFO ] Flow matrix only has 42 transitions (discarded 25 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-16 15:49:25] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-16 15:49:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/97 places, 67/118 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : Planning-PT-none-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s41)], 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 0 steps with 0 reset in 1 ms.
FORMULA Planning-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-02 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(p0&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Graph (trivial) has 34 edges and 97 vertex of which 26 / 97 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 458 edges and 84 vertex of which 80 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 67 transition count 92
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 22 place count 60 transition count 85
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 60 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 57 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 57 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 57 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 48 transition count 71
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 55 place count 46 transition count 70
Applied a total of 55 rules in 27 ms. Remains 46 /97 variables (removed 51) and now considering 70/118 (removed 48) transitions.
[2021-05-16 15:49:26] [INFO ] Flow matrix only has 46 transitions (discarded 24 similar events)
// Phase 1: matrix 46 rows 46 cols
[2021-05-16 15:49:26] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-16 15:49:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2021-05-16 15:49:26] [INFO ] Flow matrix only has 46 transitions (discarded 24 similar events)
// Phase 1: matrix 46 rows 46 cols
[2021-05-16 15:49:26] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-16 15:49:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-16 15:49:26] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [3]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 201 ms to find 1 implicit places.
[2021-05-16 15:49:26] [INFO ] Redundant transitions in 25 ms returned [5, 6, 42, 60]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions :[60, 42, 6, 5]
[2021-05-16 15:49:26] [INFO ] Flow matrix only has 45 transitions (discarded 20 similar events)
// Phase 1: matrix 45 rows 45 cols
[2021-05-16 15:49:26] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-16 15:49:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 45/97 places, 65/118 transitions.
Graph (trivial) has 2 edges and 45 vertex of which 2 / 45 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.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 63
Applied a total of 2 rules in 4 ms. Remains 43 /45 variables (removed 2) and now considering 63/65 (removed 2) transitions.
[2021-05-16 15:49:26] [INFO ] Flow matrix only has 43 transitions (discarded 20 similar events)
// Phase 1: matrix 43 rows 43 cols
[2021-05-16 15:49:26] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-16 15:49:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-16 15:49:26] [INFO ] Flow matrix only has 43 transitions (discarded 20 similar events)
// Phase 1: matrix 43 rows 43 cols
[2021-05-16 15:49:26] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-16 15:49:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:26] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 43/97 places, 63/118 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Planning-PT-none-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 1 s13), p1:(LEQ s37 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA Planning-PT-none-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-03 finished in 539 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 91 transition count 116
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 84 transition count 109
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 84 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 81 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 81 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 81 transition count 100
Applied a total of 31 rules in 7 ms. Remains 81 /97 variables (removed 16) and now considering 100/118 (removed 18) transitions.
[2021-05-16 15:49:26] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
// Phase 1: matrix 75 rows 81 cols
[2021-05-16 15:49:26] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2021-05-16 15:49:26] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
// Phase 1: matrix 75 rows 81 cols
[2021-05-16 15:49:26] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-16 15:49:26] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2021-05-16 15:49:26] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
// Phase 1: matrix 75 rows 81 cols
[2021-05-16 15:49:26] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-16 15:49:26] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/97 places, 100/118 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Planning-PT-none-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s18 s42), p0:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5 reset in 384 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Planning-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-04 finished in 664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1&&X(F((p2||G(F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 91 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 85 transition count 110
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 85 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 82 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 82 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 82 transition count 101
Applied a total of 29 rules in 5 ms. Remains 82 /97 variables (removed 15) and now considering 101/118 (removed 17) transitions.
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 77 transitions (discarded 24 similar events)
// Phase 1: matrix 77 rows 82 cols
[2021-05-16 15:49:27] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 77 transitions (discarded 24 similar events)
// Phase 1: matrix 77 rows 82 cols
[2021-05-16 15:49:27] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-16 15:49:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-16 15:49:27] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 77 transitions (discarded 24 similar events)
// Phase 1: matrix 77 rows 82 cols
[2021-05-16 15:49:27] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-16 15:49:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/97 places, 101/118 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Planning-PT-none-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s66 s73), p0:(GT 3 s3), p2:(LEQ 1 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1068 reset in 279 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA Planning-PT-none-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-05 finished in 485 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Graph (trivial) has 34 edges and 97 vertex of which 26 / 97 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 457 edges and 84 vertex of which 78 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 65 transition count 91
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 57 transition count 83
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 57 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 52 transition count 59
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 52 transition count 59
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 47 place count 52 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 43 transition count 49
Applied a total of 61 rules in 14 ms. Remains 43 /97 variables (removed 54) and now considering 49/118 (removed 69) transitions.
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 41 transitions (discarded 8 similar events)
// Phase 1: matrix 41 rows 43 cols
[2021-05-16 15:49:27] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 15:49:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 41 transitions (discarded 8 similar events)
// Phase 1: matrix 41 rows 43 cols
[2021-05-16 15:49:27] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-16 15:49:27] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:27] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2021-05-16 15:49:27] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 41 transitions (discarded 8 similar events)
// Phase 1: matrix 41 rows 43 cols
[2021-05-16 15:49:27] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 15:49:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/97 places, 49/118 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Planning-PT-none-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s17 s3)], 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 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-06 finished in 156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Graph (trivial) has 35 edges and 97 vertex of which 28 / 97 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 456 edges and 83 vertex of which 78 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 64 transition count 89
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 57 transition count 82
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 57 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 54 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 54 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 54 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 54 place count 45 transition count 68
Applied a total of 54 rules in 6 ms. Remains 45 /97 variables (removed 52) and now considering 68/118 (removed 50) transitions.
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 44 transitions (discarded 24 similar events)
// Phase 1: matrix 44 rows 45 cols
[2021-05-16 15:49:27] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 44 transitions (discarded 24 similar events)
// Phase 1: matrix 44 rows 45 cols
[2021-05-16 15:49:27] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-16 15:49:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-16 15:49:27] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-05-16 15:49:27] [INFO ] Redundant transitions in 17 ms returned []
[2021-05-16 15:49:27] [INFO ] Flow matrix only has 44 transitions (discarded 24 similar events)
// Phase 1: matrix 44 rows 45 cols
[2021-05-16 15:49:27] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-16 15:49:27] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/97 places, 68/118 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : Planning-PT-none-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s16)], 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 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-07 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Graph (trivial) has 36 edges and 97 vertex of which 28 / 97 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 456 edges and 83 vertex of which 78 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 64 transition count 89
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 57 transition count 82
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 57 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 53 transition count 74
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 53 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 53 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 60 place count 42 transition count 64
Applied a total of 60 rules in 14 ms. Remains 42 /97 variables (removed 55) and now considering 64/118 (removed 54) transitions.
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 42 transitions (discarded 22 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-16 15:49:28] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-16 15:49:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 42 transitions (discarded 22 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-16 15:49:28] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-16 15:49:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-16 15:49:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2021-05-16 15:49:28] [INFO ] Redundant transitions in 19 ms returned []
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 42 transitions (discarded 22 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-16 15:49:28] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-16 15:49:28] [INFO ] Dead Transitions using invariants and state equation in 225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/97 places, 64/118 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Planning-PT-none-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:(AND (LEQ s6 s5) (LEQ s30 s4))], 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 126 steps with 0 reset in 5 ms.
FORMULA Planning-PT-none-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-10 finished in 428 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Graph (trivial) has 37 edges and 97 vertex of which 28 / 97 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 456 edges and 83 vertex of which 77 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 63 transition count 89
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 55 transition count 81
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 55 transition count 81
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 50 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 50 transition count 57
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 50 transition count 52
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 65 place count 39 transition count 46
Applied a total of 65 rules in 9 ms. Remains 39 /97 variables (removed 58) and now considering 46/118 (removed 72) transitions.
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 38 transitions (discarded 8 similar events)
// Phase 1: matrix 38 rows 39 cols
[2021-05-16 15:49:28] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-16 15:49:28] [INFO ] Implicit Places using invariants in 29 ms returned []
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 38 transitions (discarded 8 similar events)
// Phase 1: matrix 38 rows 39 cols
[2021-05-16 15:49:28] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-16 15:49:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-16 15:49:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2021-05-16 15:49:28] [INFO ] Redundant transitions in 20 ms returned []
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 38 transitions (discarded 8 similar events)
// Phase 1: matrix 38 rows 39 cols
[2021-05-16 15:49:28] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-16 15:49:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/97 places, 46/118 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : Planning-PT-none-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT s19 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-12 finished in 179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 97/97 places, 118/118 transitions.
Graph (trivial) has 34 edges and 97 vertex of which 26 / 97 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 457 edges and 84 vertex of which 79 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 66 transition count 91
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 59 transition count 84
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 59 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 55 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 55 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 55 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 59 place count 44 transition count 66
Applied a total of 59 rules in 5 ms. Remains 44 /97 variables (removed 53) and now considering 66/118 (removed 52) transitions.
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 44 transitions (discarded 22 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-16 15:49:28] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:28] [INFO ] Implicit Places using invariants in 86 ms returned []
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 44 transitions (discarded 22 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-16 15:49:28] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-16 15:49:28] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2021-05-16 15:49:28] [INFO ] Redundant transitions in 31 ms returned []
[2021-05-16 15:49:28] [INFO ] Flow matrix only has 44 transitions (discarded 22 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-16 15:49:28] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-16 15:49:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/97 places, 66/118 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Planning-PT-none-14 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:(OR (LEQ s4 s40) (LEQ 3 s14) (LEQ 1 s34))], 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 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-14 finished in 290 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621180169067

--------------------
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="Planning-PT-none"
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 Planning-PT-none, 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 r159-oct2-162089267800068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Planning-PT-none.tgz
mv Planning-PT-none 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;