Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 32K 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 DiscoveryGPU-PT-09a-00
FORMULA_NAME DiscoveryGPU-PT-09a-01
FORMULA_NAME DiscoveryGPU-PT-09a-02
FORMULA_NAME DiscoveryGPU-PT-09a-03
FORMULA_NAME DiscoveryGPU-PT-09a-04
FORMULA_NAME DiscoveryGPU-PT-09a-05
FORMULA_NAME DiscoveryGPU-PT-09a-06
FORMULA_NAME DiscoveryGPU-PT-09a-07
FORMULA_NAME DiscoveryGPU-PT-09a-08
FORMULA_NAME DiscoveryGPU-PT-09a-09
FORMULA_NAME DiscoveryGPU-PT-09a-10
FORMULA_NAME DiscoveryGPU-PT-09a-11
FORMULA_NAME DiscoveryGPU-PT-09a-12
FORMULA_NAME DiscoveryGPU-PT-09a-13
FORMULA_NAME DiscoveryGPU-PT-09a-14
FORMULA_NAME DiscoveryGPU-PT-09a-15

=== Now, execution of the tool begins

BK_START 1620574969257

Running Version 0
[2021-05-09 15:42:59] [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 15:42:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:42:59] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-09 15:42:59] [INFO ] Transformed 93 places.
[2021-05-09 15:42:59] [INFO ] Transformed 127 transitions.
[2021-05-09 15:42:59] [INFO ] Found NUPN structural information;
[2021-05-09 15:42:59] [INFO ] Parsed PT model containing 93 places and 127 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:42:59] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-09a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 93 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 86 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 86 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 85 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 85 transition count 118
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 85 transition count 110
Applied a total of 24 rules in 24 ms. Remains 85 /93 variables (removed 8) and now considering 110/127 (removed 17) transitions.
// Phase 1: matrix 110 rows 85 cols
[2021-05-09 15:42:59] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-09 15:42:59] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 110 rows 85 cols
[2021-05-09 15:42:59] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:42:59] [INFO ] State equation strengthened by 70 read => feed constraints.
[2021-05-09 15:42:59] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 85 cols
[2021-05-09 15:42:59] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:42:59] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/93 places, 110/127 transitions.
[2021-05-09 15:43:00] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 15:43:00] [INFO ] Flatten gal took : 33 ms
FORMULA DiscoveryGPU-PT-09a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:43:00] [INFO ] Flatten gal took : 12 ms
[2021-05-09 15:43:00] [INFO ] Input system was already deterministic with 110 transitions.
Incomplete random walk after 100000 steps, including 1026 resets, run finished after 309 ms. (steps per millisecond=323 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 85 cols
[2021-05-09 15:43:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 15:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:43:00] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-09 15:43:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:43:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 15:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:43:00] [INFO ] [Nat]Absence check using state equation in 24 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2021-05-09 15:43:00] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-09a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X((p1 U (G(p1)||p2)))&&p0) U X(X(G(p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 110/110 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 79 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 74 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 72 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 72 transition count 97
Applied a total of 26 rules in 9 ms. Remains 72 /85 variables (removed 13) and now considering 97/110 (removed 13) transitions.
// Phase 1: matrix 97 rows 72 cols
[2021-05-09 15:43:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:00] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 97 rows 72 cols
[2021-05-09 15:43:00] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:43:00] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-09 15:43:00] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
// Phase 1: matrix 97 rows 71 cols
[2021-05-09 15:43:00] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:00] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 71/85 places, 97/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 71 cols
[2021-05-09 15:43:00] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:00] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 71/85 places, 97/110 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p3), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=5, aps=[p2:(OR (EQ s34 0) (EQ s40 1)), p1:(AND (NEQ s11 0) (NEQ s16 1)), p3:(OR (EQ s34 0) (EQ s40 1)), p0:(AND (NEQ s11 0) (NEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-09a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-01 finished in 633 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((X(p1) U (p2&&X(p1))))||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 110/110 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 73 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 73 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 70 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 70 transition count 95
Applied a total of 30 rules in 8 ms. Remains 70 /85 variables (removed 15) and now considering 95/110 (removed 15) transitions.
// Phase 1: matrix 95 rows 70 cols
[2021-05-09 15:43:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:01] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 95 rows 70 cols
[2021-05-09 15:43:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:01] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-09 15:43:01] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
// Phase 1: matrix 95 rows 69 cols
[2021-05-09 15:43:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:01] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 69/85 places, 95/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 69 /69 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 69 cols
[2021-05-09 15:43:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:01] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 69/85 places, 95/110 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-09a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s26 1)), p2:(OR (EQ s53 0) (EQ s26 1)), p1:(EQ s58 1)], nbAcceptance=0, 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 270 ms.
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Graph (complete) has 187 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Support contains 3 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 69/69 places, 95/95 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 69 transition count 110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 63 transition count 98
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 63 transition count 98
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 41 place count 51 transition count 74
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 53 place count 51 transition count 74
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 59 place count 45 transition count 68
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 45 transition count 68
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 71 place count 39 transition count 56
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 77 place count 39 transition count 56
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 89 place count 27 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 101 place count 27 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 101 rules in 20 ms. Remains 27 /69 variables (removed 42) and now considering 38/95 (removed 57) transitions.
[2021-05-09 15:43:02] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:43:02] [INFO ] Flow matrix only has 36 transitions (discarded 2 similar events)
// Phase 1: matrix 36 rows 27 cols
[2021-05-09 15:43:02] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-09 15:43:02] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/69 places, 38/95 transitions.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
[2021-05-09 15:43:03] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:43:03] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:43:03] [INFO ] Time to serialize gal into /tmp/LTL91415132247784372.gal : 4 ms
[2021-05-09 15:43:03] [INFO ] Time to serialize properties into /tmp/LTL14027837227257610873.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/LTL91415132247784372.gal, -t, CGAL, -LTL, /tmp/LTL14027837227257610873.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/LTL91415132247784372.gal -t CGAL -LTL /tmp/LTL14027837227257610873.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p73==0)||(p35==1))")||(X((X("(p78==1)"))U(("((p73==0)||(p35==1))")&&(X("(p78==1)"))))))))
Formula 0 simplified : !X("((p73==0)||(p35==1))" | X(X"(p78==1)" U ("((p73==0)||(p35==1))" & X"(p78==1)")))
Reverse transition relation is NOT exact ! Due to transitions t4, t24, t28, t30, t32, t34, t35, t37, t39, t41, t97, t98, t100, t101, t103, t104, t106, t107, t108, t109, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/20/95
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
338 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,3.38542,110392,1,0,139,474699,210,90,2132,638004,201
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-09a-02 finished in 12335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F((p0||G(p1))))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 87 edges and 82 vertex of which 34 / 82 are part of one of the 17 SCC in 2 ms
Free SCC test removed 17 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 65 transition count 89
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 61 place count 45 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 44 transition count 71
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 40 transition count 63
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 40 transition count 63
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 40 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 39 transition count 62
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 75 place count 36 transition count 56
Iterating global reduction 5 with 3 rules applied. Total rules applied 78 place count 36 transition count 56
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 80 place count 34 transition count 52
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 34 transition count 52
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 84 place count 32 transition count 50
Iterating global reduction 5 with 2 rules applied. Total rules applied 86 place count 32 transition count 50
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 98 place count 26 transition count 44
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 100 place count 24 transition count 40
Iterating global reduction 5 with 2 rules applied. Total rules applied 102 place count 24 transition count 40
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 23 transition count 37
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 23 transition count 37
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 22 transition count 36
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 22 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 108 place count 21 transition count 36
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 109 place count 20 transition count 33
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 20 transition count 33
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 111 place count 19 transition count 32
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 19 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 19 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 18 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 17 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 16 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 15 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 14 transition count 26
Applied a total of 118 rules in 24 ms. Remains 14 /85 variables (removed 71) and now considering 26/110 (removed 84) transitions.
[2021-05-09 15:43:13] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 14 cols
[2021-05-09 15:43:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:43:13] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 15:43:13] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 14 cols
[2021-05-09 15:43:13] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-09 15:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:43:13] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-09 15:43:13] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 15:43:13] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 14 cols
[2021-05-09 15:43:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:43:13] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/85 places, 26/110 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s12 0) (EQ s5 1)), p0:(EQ s9 1), p2:(NEQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-03 finished in 126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 110/110 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 72 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 72 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 70 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 70 transition count 95
Applied a total of 30 rules in 5 ms. Remains 70 /85 variables (removed 15) and now considering 95/110 (removed 15) transitions.
// Phase 1: matrix 95 rows 70 cols
[2021-05-09 15:43:13] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:13] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 95 rows 70 cols
[2021-05-09 15:43:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:13] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-09 15:43:13] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
// Phase 1: matrix 95 rows 69 cols
[2021-05-09 15:43:13] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 69/85 places, 95/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 69 cols
[2021-05-09 15:43:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:13] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 69/85 places, 95/110 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s46 1))], 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 225 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Graph (complete) has 187 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 69/69 places, 95/95 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 69 transition count 111
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 63 transition count 99
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 63 transition count 99
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 51 transition count 75
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 51 transition count 75
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 45 transition count 69
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 45 transition count 69
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 39 transition count 57
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 39 transition count 57
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 27 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 27 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 102 rules in 10 ms. Remains 27 /69 variables (removed 42) and now considering 39/95 (removed 56) transitions.
[2021-05-09 15:43:14] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:43:14] [INFO ] Flow matrix only has 36 transitions (discarded 3 similar events)
// Phase 1: matrix 36 rows 27 cols
[2021-05-09 15:43:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:14] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/69 places, 39/95 transitions.
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
[2021-05-09 15:43:15] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:43:15] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:43:15] [INFO ] Time to serialize gal into /tmp/LTL9317466677629055093.gal : 2 ms
[2021-05-09 15:43:15] [INFO ] Time to serialize properties into /tmp/LTL5461920923097523590.ltl : 0 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/LTL9317466677629055093.gal, -t, CGAL, -LTL, /tmp/LTL5461920923097523590.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/LTL9317466677629055093.gal -t CGAL -LTL /tmp/LTL5461920923097523590.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p15==0)||(p63==1))"))))
Formula 0 simplified : !XF"((p15==0)||(p63==1))"
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t28, t32, t34, t35, t37, t39, t41, t43, t97, t98, t100, t101, t103, t104, t106, t107, t108, t109, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/20/95
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
517 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.18275,151780,1,0,139,665457,216,90,2136,921228,203
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09a-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-09a-06 finished in 7480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 110/110 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 85 transition count 104
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 79 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 73 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 73 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 70 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 70 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 69 transition count 94
Applied a total of 32 rules in 11 ms. Remains 69 /85 variables (removed 16) and now considering 94/110 (removed 16) transitions.
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:21] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:21] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:21] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:21] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-09 15:43:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
[2021-05-09 15:43:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 68/85 places, 94/110 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 50 transition count 76
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 43 transition count 62
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 43 transition count 62
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 36 transition count 48
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 36 transition count 48
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 29 transition count 41
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 29 transition count 41
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 22 transition count 27
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 22 transition count 27
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 16 transition count 21
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 16 transition count 21
Applied a total of 104 rules in 8 ms. Remains 16 /68 variables (removed 52) and now considering 21/94 (removed 73) transitions.
[2021-05-09 15:43:21] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2021-05-09 15:43:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:21] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 15:43:21] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2021-05-09 15:43:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 15:43:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/85 places, 21/110 transitions.
Stuttering acceptance computed with spot in 8257 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 117 steps with 2 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-10 finished in 8448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(F((p0&&F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 85 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 85/85 places, 110/110 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 72 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 69 transition count 94
Applied a total of 32 rules in 4 ms. Remains 69 /85 variables (removed 16) and now considering 94/110 (removed 16) transitions.
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:29] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:29] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:29] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-09 15:43:29] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:29] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 68/85 places, 94/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 68/85 places, 94/110 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s42 1)], 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 134 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Graph (complete) has 186 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 68/68 places, 94/94 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 68 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 94
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 68 transition count 111
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 27 place count 60 transition count 95
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 35 place count 60 transition count 95
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 51 place count 44 transition count 63
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 67 place count 44 transition count 63
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 74 place count 37 transition count 56
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 81 place count 37 transition count 56
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 88 place count 30 transition count 42
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 95 place count 30 transition count 42
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 109 place count 16 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 123 place count 16 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 123 rules in 9 ms. Remains 16 /68 variables (removed 52) and now considering 21/94 (removed 73) transitions.
[2021-05-09 15:43:30] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:43:30] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
// Phase 1: matrix 20 rows 16 cols
[2021-05-09 15:43:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:30] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/68 places, 21/94 transitions.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Starting structural reductions, iteration 0 : 68/68 places, 94/94 transitions.
Applied a total of 0 rules in 0 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:30] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:30] [INFO ] State equation strengthened by 46 read => feed constraints.
[2021-05-09 15:43:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:31] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:43:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 94/94 transitions.
[2021-05-09 15:43:31] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:43:31] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:43:31] [INFO ] Time to serialize gal into /tmp/LTL10571291266512514536.gal : 1 ms
[2021-05-09 15:43:31] [INFO ] Time to serialize properties into /tmp/LTL16277344894651510307.ltl : 0 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/LTL10571291266512514536.gal, -t, CGAL, -LTL, /tmp/LTL16277344894651510307.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/LTL10571291266512514536.gal -t CGAL -LTL /tmp/LTL16277344894651510307.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((X(F(("(p57!=1)")||(X(F(("(p57!=1)")&&(F("((p82!=0)&&(p70!=1))")))))))))
Formula 0 simplified : !XF("(p57!=1)" | XF("(p57!=1)" & F"((p82!=0)&&(p70!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t12, t18, t34, t41, t82, t87, t92, t95, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, t109, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/89/21/110
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
99 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,0.997558,46080,1,0,152,143947,246,99,2559,203950,233
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((F(G("((p66!=0)&&(p75!=1))")))||(G("((((p90==0)&&(p74==1))||(p55==0))||(p5==1))"))))
Formula 1 simplified : !(FG"((p66!=0)&&(p75!=1))" | G"((((p90==0)&&(p74==1))||(p55==0))||(p5==1))")
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2021-05-09 15:43:46] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:43:46] [INFO ] Applying decomposition
[2021-05-09 15:43:46] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14503521000462617604.txt, -o, /tmp/graph14503521000462617604.bin, -w, /tmp/graph14503521000462617604.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14503521000462617604.bin, -l, -1, -v, -w, /tmp/graph14503521000462617604.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:43:46] [INFO ] Decomposing Gal with order
[2021-05-09 15:43:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:43:46] [INFO ] Removed a total of 65 redundant transitions.
[2021-05-09 15:43:46] [INFO ] Flatten gal took : 30 ms
[2021-05-09 15:43:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 7 ms.
[2021-05-09 15:43:46] [INFO ] Time to serialize gal into /tmp/LTL7555127563262215154.gal : 3 ms
[2021-05-09 15:43:46] [INFO ] Time to serialize properties into /tmp/LTL3282989298223630918.ltl : 0 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/LTL7555127563262215154.gal, -t, CGAL, -LTL, /tmp/LTL3282989298223630918.ltl, -c, -stutter-deadlock], 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/LTL7555127563262215154.gal -t CGAL -LTL /tmp/LTL3282989298223630918.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((F(G("((i7.u25.p66!=0)&&(i8.u28.p75!=1))")))||(G("((((i9.u34.p90==0)&&(i8.u28.p74==1))||(i6.u20.p55==0))||(i0.i0.u1.p5==1))"))))
Formula 0 simplified : !(FG"((i7.u25.p66!=0)&&(i8.u28.p75!=1))" | G"((((i9.u34.p90==0)&&(i8.u28.p74==1))||(i6.u20.p55==0))||(i0.i0.u1.p5==1))")
Reverse transition relation is NOT exact ! Due to transitions t34, t41, t82, t87, t92, t95, i0.i0.u0.t103, i0.i1.u2.t104, i1.i0.u4.t105, i1.i1.u6.t106, i2.u8.t102, i2.u11.t101, i3.i1.u15.t107, i4.u9.t12, i4.u9.t18, i4.u18.t100, i6.u21.t108, i7.u23.t99, i7.u25.t98, i8.u29.t109, i9.u33.t97, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/63/21/84
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
27 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,0.275879,28300,1,0,27929,626,1348,41457,166,3538,41956
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(((G(F("((i0.i0.u0.p2==0)||(i0.i0.u0.p1==1))")))||(G("((i8.u27.p72==0)||(i2.u10.p24==1))")))U(X("(i7.u25.p67==1)"))))U(X("(i7.u25.p67==1)"))))
Formula 1 simplified : !(G((GF"((i0.i0.u0.p2==0)||(i0.i0.u0.p1==1))" | G"((i8.u27.p72==0)||(i2.u10.p24==1))") U X"(i7.u25.p67==1)") U X"(i7.u25.p67==1)")
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
17 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,0.440186,38156,1,0,48576,695,1469,67875,171,4232,69296
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-09a-12 finished in 17118 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620575034862

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a execution
cd execution
if [ "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 ;