Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038144000541.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CSRepetitions-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038144000541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 76K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 321K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 239K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 22 12:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 22 12:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 71K 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 CSRepetitions-PT-03-00
FORMULA_NAME CSRepetitions-PT-03-01
FORMULA_NAME CSRepetitions-PT-03-02
FORMULA_NAME CSRepetitions-PT-03-03
FORMULA_NAME CSRepetitions-PT-03-04
FORMULA_NAME CSRepetitions-PT-03-05
FORMULA_NAME CSRepetitions-PT-03-06
FORMULA_NAME CSRepetitions-PT-03-07
FORMULA_NAME CSRepetitions-PT-03-08
FORMULA_NAME CSRepetitions-PT-03-09
FORMULA_NAME CSRepetitions-PT-03-10
FORMULA_NAME CSRepetitions-PT-03-11
FORMULA_NAME CSRepetitions-PT-03-12
FORMULA_NAME CSRepetitions-PT-03-13
FORMULA_NAME CSRepetitions-PT-03-14
FORMULA_NAME CSRepetitions-PT-03-15

=== Now, execution of the tool begins

BK_START 1620552184982

Running Version 0
[2021-05-09 09:23:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 09:23:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 09:23:06] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-09 09:23:06] [INFO ] Transformed 58 places.
[2021-05-09 09:23:06] [INFO ] Transformed 81 transitions.
[2021-05-09 09:23:06] [INFO ] Parsed PT model containing 58 places and 81 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 09:23:06] [INFO ] Initial state test concluded for 1 properties.
Support contains 58 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 8 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:06] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-09 09:23:07] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:07] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-09 09:23:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:07] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:07] [INFO ] Computed 12 place invariants in 16 ms
[2021-05-09 09:23:07] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
[2021-05-09 09:23:07] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 09:23:07] [INFO ] Flatten gal took : 28 ms
FORMULA CSRepetitions-PT-03-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 09:23:07] [INFO ] Flatten gal took : 9 ms
[2021-05-09 09:23:07] [INFO ] Input system was already deterministic with 81 transitions.
Finished random walk after 71 steps, including 2 resets, run visited all 19 properties in 3 ms. (steps per millisecond=23 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 22 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:07] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-09 09:23:07] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:07] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-09 09:23:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:07] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-09 09:23:07] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s50 1)) (AND (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s16 1) (GEQ s33 1)) (AND (GEQ s2 1) (GEQ s56 1)) (AND (GEQ s47 1) (GEQ s56 1)) (AND (GEQ s21 1) (GEQ s33 1)) (AND (GEQ s25 1) (GEQ s33 1)) (AND (GEQ s41 1) (GEQ s50 1)) (AND (GEQ s47 1) (GEQ s50 1)) (AND (GEQ s2 1) (GEQ s33 1)) (AND (GEQ s43 1) (GEQ s56 1)) (AND (GEQ s33 1) (GEQ s38 1)) (AND (GEQ s25 1) (GEQ s56 1)) (AND (GEQ s33 1) (GEQ s43 1)) (AND (GEQ s33 1) (GEQ s41 1)) (AND (GEQ s43 1) (GEQ s50 1)) (AND (GEQ s8 1) (GEQ s33 1)) (AND (GEQ s38 1) (GEQ s56 1)) (AND (GEQ s21 1) (GEQ s56 1)) (AND (GEQ s16 1) (GEQ s50 1)) (AND (GEQ s38 1) (GEQ s50 1)) (AND (GEQ s41 1) (GEQ s56 1)) (AND (GEQ s33 1) (GEQ s47 1)) (AND (GEQ s21 1) (GEQ s50 1)) (AND (GEQ s8 1) (GEQ s50 1)) (AND (GEQ s25 1) (GEQ s50 1)) (AND (GEQ s16 1) (GEQ s56 1))), p1:(OR (AND (GEQ s13 1) (GEQ s48 1)) (AND (GEQ s17 1) (GEQ s48 1)) (AND (GEQ s31 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s48 1)) (AND (GEQ s10 1) (GEQ s48 1)) (AND (GEQ s5 1) (GEQ s48 1)) (AND (GEQ s37 1) (GEQ s48 1)) (AND (GEQ s48 1) (GEQ s49 1)) (AND (GEQ s44 1) (GEQ s48 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 22 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 7 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-09 09:23:09] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:09] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:09] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Product exploration explored 100000 steps with 50000 reset in 462 ms.
Product exploration explored 100000 steps with 50000 reset in 390 ms.
[2021-05-09 09:23:10] [INFO ] Flatten gal took : 6 ms
[2021-05-09 09:23:10] [INFO ] Flatten gal took : 6 ms
[2021-05-09 09:23:10] [INFO ] Time to serialize gal into /tmp/LTL849985040508154285.gal : 3 ms
[2021-05-09 09:23:10] [INFO ] Time to serialize properties into /tmp/LTL17965593257864068498.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL849985040508154285.gal, -t, CGAL, -LTL, /tmp/LTL17965593257864068498.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL849985040508154285.gal -t CGAL -LTL /tmp/LTL17965593257864068498.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((((((((((((((((((((((RequestBuffer_1>=1)&&(Server_Waiting_3>=1))||((RequestBuffer_6>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_7>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_1>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_3>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_4>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_5>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_2>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_3>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_1>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_8>=1)&&(Server_Waiting_2>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_9>=1)))||((RequestBuffer_5>=1)&&(Server_Waiting_2>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_8>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_2>=1)))||((RequestBuffer_8>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_6>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_9>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_4>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_7>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_9>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_2>=1)&&(Server_Waiting_2>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_3>=1)))||((RequestBuffer_4>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_6>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_5>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_7>=1)&&(Server_Waiting_2>=1)))"))U(X("((((((((((Client_Sending_8>=1)&&(RequestBufferSlots>=1))||((Client_Sending_7>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_6>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_1>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_2>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_9>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_5>=1)&&(RequestBufferSlots>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_3>=1)))||((Client_Sending_4>=1)&&(RequestBufferSlots>=1)))"))))
Formula 0 simplified : !(G"((((((((((((((((((((((((((((RequestBuffer_1>=1)&&(Server_Waiting_3>=1))||((RequestBuffer_6>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_7>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_1>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_3>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_4>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_5>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_2>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_3>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_1>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_8>=1)&&(Server_Waiting_2>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_9>=1)))||((RequestBuffer_5>=1)&&(Server_Waiting_2>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_8>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_2>=1)))||((RequestBuffer_8>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_6>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_9>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_4>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_7>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_9>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_2>=1)&&(Server_Waiting_2>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_3>=1)))||((RequestBuffer_4>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_6>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_5>=1)&&(Server_Waiting_3>=1)))||((RequestBuffer_7>=1)&&(Server_Waiting_2>=1)))" U X"((((((((((Client_Sending_8>=1)&&(RequestBufferSlots>=1))||((Client_Sending_7>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_6>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_1>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_2>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_9>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_5>=1)&&(RequestBufferSlots>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_3>=1)))||((Client_Sending_4>=1)&&(RequestBufferSlots>=1)))")
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t7, t9, t13, t14, t15, t16, t17, t18, t19, t23, t24, t27, t28, t31, t32, t33, t35, t39, t40, t41, t44, t45, t47, t49, t50, t51, t53, t54, t55, t56, t58, t59, t64, t66, t67, t69, t70, t72, t73, t77, t78, t79, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/36/45/81
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
150 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.53404,62656,1,0,220,287792,186,86,2319,237329,177
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-03-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CSRepetitions-PT-03-00 finished in 4594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 40 transition count 72
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 51 place count 16 transition count 48
Iterating global reduction 0 with 24 rules applied. Total rules applied 75 place count 16 transition count 48
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 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 10 transition count 45
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 102 place count 10 transition count 27
Applied a total of 102 rules in 32 ms. Remains 10 /58 variables (removed 48) and now considering 27/81 (removed 54) transitions.
// Phase 1: matrix 27 rows 10 cols
[2021-05-09 09:23:12] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 09:23:12] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 27 rows 10 cols
[2021-05-09 09:23:12] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 09:23:12] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-09 09:23:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 10 cols
[2021-05-09 09:23:12] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 09:23:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/58 places, 27/81 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s2 1) (LT s0 1) (LT s3 1) (LT s5 1) (LT s6 1) (LT s1 1) (LT s4 1) (LT s7 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7640 reset in 168 ms.
Stack based approach found an accepted trace after 10 steps with 1 reset with depth 2 and stack size 2 in 0 ms.
FORMULA CSRepetitions-PT-03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-02 finished in 331 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)||(X(p0)&&G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 19 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:12] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:12] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:12] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:12] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:12] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:12] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND p0 p1), p0]
Running random walk in product with property : CSRepetitions-PT-03-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s48 1)) (AND (GEQ s17 1) (GEQ s48 1)) (AND (GEQ s31 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s48 1)) (AND (GEQ s10 1) (GEQ s48 1)) (AND (GEQ s5 1) (GEQ s48 1)) (AND (GEQ s37 1) (GEQ s48 1)) (AND (GEQ s48 1) (GEQ s49 1)) (AND (GEQ s44 1) (GEQ s48 1))), p1:(AND (LT s16 1) (LT s2 1) (LT s21 1) (LT s38 1) (LT s41 1) (LT s8 1) (LT s25 1) (LT s43 1) (LT s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6929 reset in 233 ms.
Stack based approach found an accepted trace after 31 steps with 1 reset with depth 20 and stack size 20 in 0 ms.
FORMULA CSRepetitions-PT-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-03 finished in 430 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:12] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:12] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:12] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:12] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2021-05-09 09:23:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:12] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:12] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-04 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 (GEQ s36 1) (GEQ s53 1) (GEQ s55 1) (GEQ s54 1) (GEQ s7 1) (GEQ s23 1) (GEQ s40 1) (GEQ s26 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-04 finished in 248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(!p0) U ((X(!p0)&&p1)||X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 45 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:13] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:13] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, p0, true]
Running random walk in product with property : CSRepetitions-PT-03-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s36 1) (GEQ s53 1) (GEQ s55 1) (GEQ s54 1) (GEQ s7 1) (GEQ s23 1) (GEQ s40 1) (GEQ s26 1) (GEQ s15 1)), p1:(AND (OR (LT s12 1) (LT s44 1)) (OR (LT s32 1) (LT s49 1)) (OR (LT s18 1) (LT s49 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s29 1) (LT s31 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s5 1) (LT s9 1)) (OR (LT s24 1) (LT s37 1)) (OR (LT s0 1) (LT s3 1)) (OR (LT s28 1) (LT s31 1)) (OR (LT s10 1) (LT s51 1)) (OR (LT s10 1) (LT s57 1)) (OR (LT s17 1) (LT s22 1)) (OR (LT s14 1) (LT s49 1)) (OR (LT s5 1) (LT s52 1)) (OR (LT s27 1) (LT s31 1)) (OR (LT s39 1) (LT s44 1)) (OR (LT s13 1) (LT s19 1)) (OR (LT s13 1) (LT s20 1)) (OR (LT s5 1) (LT s46 1)) (OR (LT s17 1) (LT s35 1)) (OR (LT s42 1) (LT s44 1)) (OR (LT s34 1) (LT s37 1)) (OR (LT s10 1) (LT s11 1)) (OR (LT s13 1) (LT s45 1)) (OR (LT s6 1) (LT s17 1)) (OR (LT s30 1) (LT s37 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-05 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 18 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:13] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:13] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CSRepetitions-PT-03-06 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (GEQ s36 1) (GEQ s53 1) (GEQ s55 1) (GEQ s54 1) (GEQ s7 1) (GEQ s23 1) (GEQ s40 1) (GEQ s26 1) (GEQ s15 1)), p0:(AND (LT s16 1) (LT s2 1) (LT s21 1) (LT s38 1) (LT s41 1) (LT s8 1) (LT s25 1) (LT s43 1) (LT s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-06 finished in 241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||F(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:13] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:13] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:13] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 95 ms :[p0, p0, p0]
Running random walk in product with property : CSRepetitions-PT-03-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (GEQ s36 1) (GEQ s53 1) (GEQ s55 1) (GEQ s54 1) (GEQ s7 1) (GEQ s23 1) (GEQ s40 1) (GEQ s26 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2848 reset in 224 ms.
Stack based approach found an accepted trace after 1562 steps with 44 reset with depth 35 and stack size 35 in 9 ms.
FORMULA CSRepetitions-PT-03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-07 finished in 499 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:14] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s13 1) (GEQ s48 1)), p0:(AND (GEQ s48 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 34 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-PT-03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-08 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(p1)||p0))&&X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-03-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s24 1) (GEQ s37 1)) (GEQ s26 1)), p1:(GEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-03-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-09 finished in 255 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 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:14] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-10 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:(OR (LT s44 1) (LT s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-10 finished in 286 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X((G((p1 U p2)) U (G((p1 U p2))&&p3)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-03-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s38 1) (GEQ s50 1)), p3:(AND (GEQ s38 1) (GEQ s50 1)), p2:(AND (GEQ s10 1) (GEQ s51 1)), p1:(GEQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-12 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 44 transition count 74
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 39 place count 26 transition count 56
Iterating global reduction 0 with 18 rules applied. Total rules applied 57 place count 26 transition count 56
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 61 place count 22 transition count 40
Iterating global reduction 0 with 4 rules applied. Total rules applied 65 place count 22 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 69 place count 22 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 20 transition count 34
Applied a total of 73 rules in 7 ms. Remains 20 /58 variables (removed 38) and now considering 34/81 (removed 47) transitions.
[2021-05-09 09:23:15] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 20 cols
[2021-05-09 09:23:15] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 09:23:15] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 09:23:15] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 20 cols
[2021-05-09 09:23:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 09:23:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-09 09:23:15] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-09 09:23:15] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 09:23:15] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 20 cols
[2021-05-09 09:23:15] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 09:23:15] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/58 places, 34/81 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s14 1) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s17 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 32787 reset in 122 ms.
Stack based approach found an accepted trace after 48 steps with 16 reset with depth 2 and stack size 2 in 0 ms.
FORMULA CSRepetitions-PT-03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-13 finished in 229 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)&&(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 40 transition count 72
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 51 place count 16 transition count 48
Iterating global reduction 0 with 24 rules applied. Total rules applied 75 place count 16 transition count 48
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 80 place count 11 transition count 28
Iterating global reduction 0 with 5 rules applied. Total rules applied 85 place count 11 transition count 28
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 90 place count 11 transition count 23
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 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 99 place count 5 transition count 20
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 4 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 108 place count 3 transition count 12
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 112 place count 3 transition count 8
Applied a total of 112 rules in 9 ms. Remains 3 /58 variables (removed 55) and now considering 8/81 (removed 73) transitions.
// Phase 1: matrix 8 rows 3 cols
[2021-05-09 09:23:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 09:23:15] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 3 cols
[2021-05-09 09:23:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 09:23:15] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-09 09:23:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 3 cols
[2021-05-09 09:23:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 09:23:15] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/58 places, 8/81 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-03-14 automaton TGBA [mat=[[{ cond=(OR p0 (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 0}, { cond=(NOT p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1 1), p2:(AND (LT s1 1) (LT s0 1)), p1:(LT s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-14 finished in 159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:15] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:15] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:15] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:15] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:15] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CSRepetitions-PT-03-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s54 1), p1:(AND (GEQ s25 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-15 finished in 274 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620552196179

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038144000541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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