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-162038144000540.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038144000540
=====================================================================

--------------------
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 1620552174273

Running Version 0
[2021-05-09 09:22:56] [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-09 09:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 09:22:56] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-09 09:22:56] [INFO ] Transformed 58 places.
[2021-05-09 09:22:56] [INFO ] Transformed 81 transitions.
[2021-05-09 09:22:56] [INFO ] Parsed PT model containing 58 places and 81 transitions in 74 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 09:22:56] [INFO ] Initial state test concluded for 1 properties.
FORMULA CSRepetitions-PT-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 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 7 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:22:56] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-09 09:22:56] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:56] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-09 09:22:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:22:56] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:56] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:22:56] [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:22:56] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 09:22:56] [INFO ] Flatten gal took : 37 ms
FORMULA CSRepetitions-PT-03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 09:22:56] [INFO ] Flatten gal took : 12 ms
[2021-05-09 09:22:56] [INFO ] Input system was already deterministic with 81 transitions.
Incomplete random walk after 100000 steps, including 3334 resets, run finished after 213 ms. (steps per millisecond=469 ) properties (out of 25) seen :22
Running SMT prover for 3 properties.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:57] [INFO ] Computed 12 place invariants in 13 ms
[2021-05-09 09:22:57] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2021-05-09 09:22:57] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2021-05-09 09:22:57] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2021-05-09 09:22:57] [INFO ] Initial state test concluded for 1 properties.
FORMULA CSRepetitions-PT-03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 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:22:57] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:22:57] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:57] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-09 09:22:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:22:57] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:57] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:22:57] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s33 s50 s56) (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22564 reset in 361 ms.
Stack based approach found an accepted trace after 262 steps with 56 reset with depth 5 and stack size 5 in 2 ms.
FORMULA CSRepetitions-PT-03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-00 finished in 989 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(F(p1)))))], 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 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:22:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:22:58] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:58] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-09 09:22:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:22:58] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:22:58] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19 s20 s22 s24 s27 s28 s29 s30 s32 s34 s35 s39 s42 s45 s46 s51 s52 s57) (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49)), p0:(LEQ 2 (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-02 finished in 463 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 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:22:58] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:22:58] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:22:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:22:59] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:22:59] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:22:59] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55) (ADD s33 s50 s56))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6134 reset in 395 ms.
Stack based approach found an accepted trace after 2088 steps with 131 reset with depth 6 and stack size 6 in 5 ms.
FORMULA CSRepetitions-PT-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-03 finished in 1319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 13 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:00] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:00] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:00] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:00] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:00] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:00] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-04 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:(GT s48 (ADD s33 s50 s56)), p0:(GT 3 (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 13 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 4 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-09 09:23:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:01] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:01] [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 350 ms.
Product exploration explored 100000 steps with 50000 reset in 307 ms.
[2021-05-09 09:23:02] [INFO ] Flatten gal took : 7 ms
[2021-05-09 09:23:02] [INFO ] Flatten gal took : 7 ms
[2021-05-09 09:23:02] [INFO ] Time to serialize gal into /tmp/LTL3662516622439800251.gal : 3 ms
[2021-05-09 09:23:02] [INFO ] Time to serialize properties into /tmp/LTL260163548292325683.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/LTL3662516622439800251.gal, -t, CGAL, -LTL, /tmp/LTL260163548292325683.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/LTL3662516622439800251.gal -t CGAL -LTL /tmp/LTL260163548292325683.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((((((((Client_Sending_1+Client_Sending_9)+Client_Sending_2)+Client_Sending_8)+Client_Sending_7)+Client_Sending_6)+Client_Sending_5)+Client_Sending_4)+Client_Sending_3)<3)")||(G("(RequestBufferSlots>((Server_Waiting_1+Server_Waiting_3)+Server_Waiting_2))"))))))
Formula 0 simplified : !XF("(((((((((Client_Sending_1+Client_Sending_9)+Client_Sending_2)+Client_Sending_8)+Client_Sending_7)+Client_Sending_6)+Client_Sending_5)+Client_Sending_4)+Client_Sending_3)<3)" | G"(RequestBufferSlots>((Server_Waiting_1+Server_Waiting_3)+Server_Waiting_2))")
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.52328,61900,1,0,220,287744,198,86,2262,237311,179
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-03-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CSRepetitions-PT-03-04 finished in 3879 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U X(X(X(G(p1))))))&&(X(p2)||G(p0))))], workingDir=/home/mcc/execution]
Support contains 46 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:03] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:03] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:03] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 09:23:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:04] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:04] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-03-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 8}], [{ cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ 1 s48), p2:(LEQ 2 (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49)), p1:(GT (ADD s7 s15 s23 s26 s36 s40 s53 s54 s55) (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19 s20 s22 s24 s27 s28 s29 s30 s32 s34 s35 s39 s42 s45 s46 s51 s52 s57))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-03-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-05 finished in 488 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 13 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:04] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:04] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:04] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:04] [INFO ] Implicit Places using invariants and state equation in 56 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:04] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-09 09:23:04] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ (ADD s33 s50 s56) s48), p0:(LEQ 1 (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27658 reset in 242 ms.
Product exploration explored 100000 steps with 27720 reset in 239 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 27662 reset in 225 ms.
Product exploration explored 100000 steps with 27648 reset in 193 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 13 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 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-09 09:23:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:06] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-09 09:23:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Product exploration explored 100000 steps with 27707 reset in 365 ms.
Product exploration explored 100000 steps with 27724 reset in 297 ms.
[2021-05-09 09:23:06] [INFO ] Flatten gal took : 5 ms
[2021-05-09 09:23:06] [INFO ] Flatten gal took : 7 ms
[2021-05-09 09:23:06] [INFO ] Time to serialize gal into /tmp/LTL5394739375353969908.gal : 4 ms
[2021-05-09 09:23:06] [INFO ] Time to serialize properties into /tmp/LTL15962013978162262574.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/LTL5394739375353969908.gal, -t, CGAL, -LTL, /tmp/LTL15962013978162262574.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/LTL5394739375353969908.gal -t CGAL -LTL /tmp/LTL15962013978162262574.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((((((((Client_Sending_1+Client_Sending_9)+Client_Sending_2)+Client_Sending_8)+Client_Sending_7)+Client_Sending_6)+Client_Sending_5)+Client_Sending_4)+Client_Sending_3)>=1)"))||(F("(((Server_Waiting_1+Server_Waiting_3)+Server_Waiting_2)<=RequestBufferSlots)"))))))
Formula 0 simplified : !XX(G"(((((((((Client_Sending_1+Client_Sending_9)+Client_Sending_2)+Client_Sending_8)+Client_Sending_7)+Client_Sending_6)+Client_Sending_5)+Client_Sending_4)+Client_Sending_3)>=1)" | F"(((Server_Waiting_1+Server_Waiting_3)+Server_Waiting_2)<=RequestBufferSlots)")
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
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
543 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,5.43672,154032,1,0,320,734412,198,174,2401,911891,368
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CSRepetitions-PT-03-06 finished in 9273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(G(p0))&&G((p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 40 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 15 ms returned []
// 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 ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:13] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 121 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 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-03-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s33 s50 s56)), p2:(LEQ (ADD s0 s5 s10 s13 s17 s31 s37 s44 s49) (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19 s20 s22 s24 s27 s28 s29 s30 s32 s34 s35 s39 s42 s45 s46 s51 s52 s57)), p0:(LEQ s48 (ADD s1 s3 s4 s6 s9 s11 s12 s14 s18 s19 s20 s22 s24 s27 s28 s29 s30 s32 s34 s35 s39 s42 s45 s46 s51 s52 s57))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-07 finished in 456 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 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 0 ms
[2021-05-09 09:23:14] [INFO ] Implicit Places using invariants in 57 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 107 ms returned []
Implicit Place search using SMT with State Equation took 179 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:16] [INFO ] Dead Transitions using invariants and state equation in 2419 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-03-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s13 s48), p1:(LEQ s1 s50)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2999 reset in 165 ms.
Stack based approach found an accepted trace after 28090 steps with 839 reset with depth 36 and stack size 36 in 49 ms.
FORMULA CSRepetitions-PT-03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-10 finished in 3074 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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 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:17] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:17] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:17] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 09:23:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:17] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:17] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-09 09:23:17] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CSRepetitions-PT-03-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s33 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 49 steps with 24 reset in 0 ms.
FORMULA CSRepetitions-PT-03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-11 finished in 290 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], 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:17] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:17] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:17] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 09:23:20] [INFO ] Implicit Places using invariants and state equation in 2572 ms returned []
Implicit Place search using SMT with State Equation took 2644 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:20] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-09 09:23:20] [INFO ] Dead Transitions using invariants and state equation in 315 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s34 s55) (LEQ 2 s44))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 3 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.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 58 transition count 81
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 14 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-09 09:23:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 09:23:21] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 09:23:21] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Product exploration explored 100000 steps with 50000 reset in 525 ms.
Product exploration explored 100000 steps with 50000 reset in 519 ms.
[2021-05-09 09:23:22] [INFO ] Flatten gal took : 22 ms
[2021-05-09 09:23:22] [INFO ] Flatten gal took : 8 ms
[2021-05-09 09:23:22] [INFO ] Time to serialize gal into /tmp/LTL10083641944750675851.gal : 2 ms
[2021-05-09 09:23:22] [INFO ] Time to serialize properties into /tmp/LTL3999698720631068379.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/LTL10083641944750675851.gal, -t, CGAL, -LTL, /tmp/LTL3999698720631068379.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/LTL10083641944750675851.gal -t CGAL -LTL /tmp/LTL3999698720631068379.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((Server_Anwering_5_2<=Client_Waiting_1)||(Client_Sending_4>=2))"))))
Formula 0 simplified : !XF"((Server_Anwering_5_2<=Client_Waiting_1)||(Client_Sending_4>=2))"
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
167 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.70102,60728,1,0,220,287744,188,86,2247,237315,175
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-03-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CSRepetitions-PT-03-14 finished in 7002 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 62 place count 21 transition count 36
Iterating global reduction 0 with 5 rules applied. Total rules applied 67 place count 21 transition count 36
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 72 place count 21 transition count 31
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 76 place count 19 transition count 29
Applied a total of 76 rules in 54 ms. Remains 19 /58 variables (removed 39) and now considering 29/81 (removed 52) transitions.
[2021-05-09 09:23:24] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
// Phase 1: matrix 27 rows 19 cols
[2021-05-09 09:23:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 09:23:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2021-05-09 09:23:24] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
// Phase 1: matrix 27 rows 19 cols
[2021-05-09 09:23:24] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 09:23:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-09 09:23:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-09 09:23:24] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 09:23:24] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
// Phase 1: matrix 27 rows 19 cols
[2021-05-09 09:23:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 09:23:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/58 places, 29/81 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ s13 s0), p0:(GT s14 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14256 reset in 119 ms.
Stack based approach found an accepted trace after 34 steps with 4 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CSRepetitions-PT-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-15 finished in 368 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620552205440

--------------------
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="CSRepetitions-PT-03"
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 CSRepetitions-PT-03, 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 r026-tajo-162038144000540"
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 [ "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 ;