Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331400284.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C1000N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331400284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C1000N0000000100-00
FORMULA_NAME GPPP-PT-C1000N0000000100-01
FORMULA_NAME GPPP-PT-C1000N0000000100-02
FORMULA_NAME GPPP-PT-C1000N0000000100-03
FORMULA_NAME GPPP-PT-C1000N0000000100-04
FORMULA_NAME GPPP-PT-C1000N0000000100-05
FORMULA_NAME GPPP-PT-C1000N0000000100-06
FORMULA_NAME GPPP-PT-C1000N0000000100-07
FORMULA_NAME GPPP-PT-C1000N0000000100-08
FORMULA_NAME GPPP-PT-C1000N0000000100-09
FORMULA_NAME GPPP-PT-C1000N0000000100-10
FORMULA_NAME GPPP-PT-C1000N0000000100-11
FORMULA_NAME GPPP-PT-C1000N0000000100-12
FORMULA_NAME GPPP-PT-C1000N0000000100-13
FORMULA_NAME GPPP-PT-C1000N0000000100-14
FORMULA_NAME GPPP-PT-C1000N0000000100-15

=== Now, execution of the tool begins

BK_START 1621234961866

Running Version 0
[2021-05-17 07:02:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 07:02:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:02:45] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-17 07:02:45] [INFO ] Transformed 33 places.
[2021-05-17 07:02:45] [INFO ] Transformed 22 transitions.
[2021-05-17 07:02:45] [INFO ] Parsed PT model containing 33 places and 22 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 07:02:45] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C1000N0000000100-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 30 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:45] [INFO ] Invariants computation overflowed in 12 ms
[2021-05-17 07:02:45] [INFO ] Dead Transitions using invariants and state equation in 212 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:45] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:02:45] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:45] [INFO ] Invariants computation overflowed in 8 ms
[2021-05-17 07:02:45] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:45] [INFO ] Invariants computation overflowed in 5 ms
[2021-05-17 07:02:45] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
[2021-05-17 07:02:46] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 07:02:46] [INFO ] Flatten gal took : 46 ms
FORMULA GPPP-PT-C1000N0000000100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 07:02:46] [INFO ] Flatten gal took : 14 ms
[2021-05-17 07:02:46] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100008 steps, including 34 resets, run finished after 226 ms. (steps per millisecond=442 ) properties (out of 26) seen :23
Running SMT prover for 3 properties.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:46] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 07:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:02:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 07:02:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:02:46] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-17 07:02:46] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 07:02:46] [INFO ] Added : 12 causal constraints over 4 iterations in 58 ms. Result :sat
[2021-05-17 07:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:02:46] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2021-05-17 07:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:02:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 07:02:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:02:47] [INFO ] [Nat]Absence check using state equation in 32 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1)&&F(G((p2||X(p3)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:47] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:02:47] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:47] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:47] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 181 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:47] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 07:02:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:47] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s21), p1:(LEQ s27 s3), p2:(GT s21 s16), p3:(GT 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-00 finished in 948 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(G((p1||X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 07:02:48] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 07:02:48] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 155 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:48] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:48] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : GPPP-PT-C1000N0000000100-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s14 s8), p2:(LEQ 2 s14), p0:(LEQ s3 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-02 finished in 585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 27 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 57 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:02:48] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:02:48] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 104 ms to find 2 implicit places.
[2021-05-17 07:02:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 23/33 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 15
Applied a total of 2 rules in 5 ms. Remains 22 /23 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:48] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 07:02:48] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-17 07:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:02:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/33 places, 15/22 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ s11 s7) (GT 2 s1)), p0:(GT 2 s1)], 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 7 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-03 finished in 461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 13 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:02:49] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:02:49] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [0, 3, 13, 17]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 133 ms to find 4 implicit places.
[2021-05-17 07:02:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:49] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 20/33 places, 15/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 13
Applied a total of 4 rules in 4 ms. Remains 18 /20 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 18 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:49] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:02:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 s13) (GT s1 s14))], 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 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-04 finished in 346 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(F(p0)) U (p1||X(p2))) U p1))], workingDir=/home/mcc/execution]
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:49] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:49] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 115 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:49] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:49] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s3), p2:(LEQ s14 s7), p0:(LEQ s28 s6)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4352 reset in 468 ms.
Stack based approach found an accepted trace after 95 steps with 3 reset with depth 16 and stack size 16 in 5 ms.
FORMULA GPPP-PT-C1000N0000000100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-05 finished in 902 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))&&F((p1||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:50] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:50] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 07:02:50] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:50] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:50] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 153 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:50] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:50] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : GPPP-PT-C1000N0000000100-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GT s7 s20) (GT 3 s2)), p2:(GT 2 s26), p0:(GT 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-07 finished in 585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 8 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:02:50] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:51] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:51] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [0, 2, 3, 15, 19]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 135 ms to find 5 implicit places.
[2021-05-17 07:02:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 21 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 21/33 places, 17/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 18 transition count 14
Applied a total of 6 rules in 4 ms. Remains 18 /21 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:51] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:51] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9926 reset in 190 ms.
Stack based approach found an accepted trace after 654 steps with 62 reset with depth 15 and stack size 15 in 2 ms.
FORMULA GPPP-PT-C1000N0000000100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-10 finished in 575 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:51] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:51] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 147 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s20 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-11 finished in 422 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:51] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 135 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s14 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-12 finished in 310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((F(p0) U X(G(p1)))||(p1&&X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 114 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}], [{ cond=p1, acceptance={1} source=1 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ s27 s26), p0:(LEQ 2 s24)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5883 steps with 1 reset in 9 ms.
FORMULA GPPP-PT-C1000N0000000100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-14 finished in 273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 6 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:02:52] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [0, 2, 3, 13, 17]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 88 ms to find 5 implicit places.
[2021-05-17 07:02:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 19/33 places, 15/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 13
Applied a total of 4 rules in 2 ms. Remains 17 /19 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 17 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:02:52] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2021-05-17 07:02:52] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:02:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:02:52] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s2), p0:(LEQ 3 s9)], 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 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-15 finished in 304 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621234973806

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C1000N0000000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C1000N0000000100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331400284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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 ;