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-162048875200316.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-11a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K 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.3K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.7K Mar 23 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 18:00 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 39K 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-11a-00
FORMULA_NAME DiscoveryGPU-PT-11a-01
FORMULA_NAME DiscoveryGPU-PT-11a-02
FORMULA_NAME DiscoveryGPU-PT-11a-03
FORMULA_NAME DiscoveryGPU-PT-11a-04
FORMULA_NAME DiscoveryGPU-PT-11a-05
FORMULA_NAME DiscoveryGPU-PT-11a-06
FORMULA_NAME DiscoveryGPU-PT-11a-07
FORMULA_NAME DiscoveryGPU-PT-11a-08
FORMULA_NAME DiscoveryGPU-PT-11a-09
FORMULA_NAME DiscoveryGPU-PT-11a-10
FORMULA_NAME DiscoveryGPU-PT-11a-11
FORMULA_NAME DiscoveryGPU-PT-11a-12
FORMULA_NAME DiscoveryGPU-PT-11a-13
FORMULA_NAME DiscoveryGPU-PT-11a-14
FORMULA_NAME DiscoveryGPU-PT-11a-15

=== Now, execution of the tool begins

BK_START 1620576294194

Running Version 0
[2021-05-09 16:04: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 16:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:04:56] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2021-05-09 16:04:56] [INFO ] Transformed 113 places.
[2021-05-09 16:04:56] [INFO ] Transformed 155 transitions.
[2021-05-09 16:04:56] [INFO ] Found NUPN structural information;
[2021-05-09 16:04:56] [INFO ] Parsed PT model containing 113 places and 155 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 16:04:56] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-11a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 98 transition count 140
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 98 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 95 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 95 transition count 134
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 95 transition count 126
Applied a total of 44 rules in 27 ms. Remains 95 /113 variables (removed 18) and now considering 126/155 (removed 29) transitions.
// Phase 1: matrix 126 rows 95 cols
[2021-05-09 16:04:56] [INFO ] Computed 2 place invariants in 16 ms
[2021-05-09 16:04:56] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 126 rows 95 cols
[2021-05-09 16:04:56] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:04:56] [INFO ] State equation strengthened by 81 read => feed constraints.
[2021-05-09 16:04:56] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 250 ms to find 1 implicit places.
// Phase 1: matrix 126 rows 94 cols
[2021-05-09 16:04:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:04:56] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Starting structural reductions, iteration 1 : 94/113 places, 126/155 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 94 cols
[2021-05-09 16:04:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:04:56] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 94/113 places, 126/155 transitions.
[2021-05-09 16:04:57] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 16:04:57] [INFO ] Flatten gal took : 32 ms
FORMULA DiscoveryGPU-PT-11a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:04:57] [INFO ] Flatten gal took : 12 ms
[2021-05-09 16:04:57] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 100000 steps, including 833 resets, run finished after 313 ms. (steps per millisecond=319 ) properties (out of 13) seen :10
Running SMT prover for 3 properties.
// Phase 1: matrix 126 rows 94 cols
[2021-05-09 16:04:57] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 16:04:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 16:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:04:57] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-09 16:04:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:04:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 16:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:04:57] [INFO ] [Nat]Absence check using state equation in 17 ms returned unsat
[2021-05-09 16:04:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 16:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:04:57] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-09 16:04:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:04:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 16:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:04:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned unsat
[2021-05-09 16:04:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 16:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:04:57] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-09 16:04:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:04:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 16:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:04:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
[2021-05-09 16:04:57] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-11a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 126/126 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 84 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 84 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 82 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 82 transition count 114
Applied a total of 24 rules in 11 ms. Remains 82 /94 variables (removed 12) and now considering 114/126 (removed 12) transitions.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:04:57] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-09 16:04:57] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:04:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:04:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-09 16:04:57] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:04:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:04:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/94 places, 114/126 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-00 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:(OR (EQ s39 0) (EQ s59 1)), p0:(OR (EQ s11 0) (EQ s68 1))], 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 316 ms.
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 82/82 places, 114/114 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 82 transition count 114
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 114
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 82 transition count 133
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 28 place count 75 transition count 119
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 35 place count 75 transition count 119
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 49 place count 61 transition count 91
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 63 place count 61 transition count 91
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 70 place count 54 transition count 84
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 77 place count 54 transition count 84
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 84 place count 47 transition count 70
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 91 place count 47 transition count 70
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 104 place count 34 transition count 50
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 13 rules applied. Total rules applied 117 place count 34 transition count 50
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 117 rules in 35 ms. Remains 34 /82 variables (removed 48) and now considering 50/114 (removed 64) transitions.
[2021-05-09 16:04:59] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 16:04:59] [INFO ] Flow matrix only has 46 transitions (discarded 4 similar events)
// Phase 1: matrix 46 rows 34 cols
[2021-05-09 16:04:59] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:04:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/82 places, 50/114 transitions.
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Product exploration explored 100000 steps with 50000 reset in 288 ms.
[2021-05-09 16:05:00] [INFO ] Flatten gal took : 8 ms
[2021-05-09 16:05:00] [INFO ] Flatten gal took : 6 ms
[2021-05-09 16:05:00] [INFO ] Time to serialize gal into /tmp/LTL17266694709506559045.gal : 2 ms
[2021-05-09 16:05:00] [INFO ] Time to serialize properties into /tmp/LTL231545770804755903.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/LTL17266694709506559045.gal, -t, CGAL, -LTL, /tmp/LTL231545770804755903.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/LTL17266694709506559045.gal -t CGAL -LTL /tmp/LTL231545770804755903.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p14==0)||(p95==1))")||(G("((p54==0)||(p80==1))"))))))
Formula 0 simplified : !XF("((p14==0)||(p95==1))" | G"((p54==0)||(p80==1))")
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t41, t43, t45, t47, t49, t51, t112, t113, t114, t115, t116, t118, t119, t121, t122, t123, t124, t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/91/23/114
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
903 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,9.04635,234036,1,0,162,1.06014e+06,264,108,2553,1.37678e+06,245
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11a-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-11a-00 finished in 12418 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 126/126 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 88 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 88 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 85 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 85 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 83 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 83 transition count 115
Applied a total of 22 rules in 6 ms. Remains 83 /94 variables (removed 11) and now considering 115/126 (removed 11) transitions.
// Phase 1: matrix 115 rows 83 cols
[2021-05-09 16:05:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:10] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 115 rows 83 cols
[2021-05-09 16:05:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-09 16:05:10] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 83 cols
[2021-05-09 16:05:10] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/94 places, 115/126 transitions.
Stuttering acceptance computed with spot in 552 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-01 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:(EQ s14 1), p0:(OR (EQ s75 0) (EQ s25 1))], 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 174 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Graph (complete) has 227 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 83 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 83/83 places, 115/115 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 83 transition count 134
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 29 place count 75 transition count 118
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 37 place count 75 transition count 118
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 53 place count 59 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 69 place count 59 transition count 86
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 76 place count 52 transition count 79
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 83 place count 52 transition count 79
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 90 place count 45 transition count 65
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 97 place count 45 transition count 65
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 111 place count 31 transition count 44
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 125 place count 31 transition count 44
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 125 rules in 12 ms. Remains 31 /83 variables (removed 52) and now considering 44/115 (removed 71) transitions.
[2021-05-09 16:05:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:05:11] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 31 cols
[2021-05-09 16:05:11] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:11] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/83 places, 44/115 transitions.
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
[2021-05-09 16:05:12] [INFO ] Flatten gal took : 7 ms
[2021-05-09 16:05:12] [INFO ] Flatten gal took : 6 ms
[2021-05-09 16:05:12] [INFO ] Time to serialize gal into /tmp/LTL8798115526951413071.gal : 2 ms
[2021-05-09 16:05:12] [INFO ] Time to serialize properties into /tmp/LTL12532994577849789379.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/LTL8798115526951413071.gal, -t, CGAL, -LTL, /tmp/LTL12532994577849789379.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/LTL8798115526951413071.gal -t CGAL -LTL /tmp/LTL12532994577849789379.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p104==0)||(p33==1))")||(G("(p17==1)"))))))
Formula 0 simplified : !XF("((p104==0)||(p33==1))" | G"(p17==1)")
Reverse transition relation is NOT exact ! Due to transitions t19, t28, t32, t34, t36, t38, t40, t41, t43, t47, t49, t51, t112, t113, t114, t115, t116, t118, t119, t121, t122, t123, t124, t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/91/24/115
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
1098 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,10.9998,233312,1,0,165,1.09355e+06,266,108,2578,1.39791e+06,247
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11a-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-11a-01 finished in 14828 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(X(F(!p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 126/126 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 84 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 84 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 83 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 83 transition count 115
Applied a total of 22 rules in 5 ms. Remains 83 /94 variables (removed 11) and now considering 115/126 (removed 11) transitions.
// Phase 1: matrix 115 rows 83 cols
[2021-05-09 16:05:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:25] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 115 rows 83 cols
[2021-05-09 16:05:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:25] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-09 16:05:25] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 83 cols
[2021-05-09 16:05:25] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/94 places, 115/126 transitions.
Stuttering acceptance computed with spot in 544 ms :[(AND (NOT p0) (NOT p1)), p0, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s45 0) (EQ s11 1)), p1:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-02 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property DiscoveryGPU-PT-11a-02 finished in 701 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0 U (G(p0)||(F(G(p2))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 126/126 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 100 edges and 92 vertex of which 38 / 92 are part of one of the 19 SCC in 2 ms
Free SCC test removed 19 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 73 transition count 103
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 65 place count 51 transition count 84
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 46 transition count 74
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 46 transition count 74
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 46 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 45 transition count 73
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 82 place count 40 transition count 63
Iterating global reduction 4 with 5 rules applied. Total rules applied 87 place count 40 transition count 63
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 91 place count 36 transition count 55
Iterating global reduction 4 with 4 rules applied. Total rules applied 95 place count 36 transition count 55
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 99 place count 32 transition count 50
Iterating global reduction 4 with 4 rules applied. Total rules applied 103 place count 32 transition count 50
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 31 transition count 49
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 31 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 113 place count 27 transition count 45
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 117 place count 23 transition count 37
Iterating global reduction 4 with 4 rules applied. Total rules applied 121 place count 23 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 22 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 22 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 21 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 21 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 20 transition count 33
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 19 transition count 30
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 19 transition count 30
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 18 transition count 29
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 18 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 18 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 17 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 16 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 15 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 14 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 13 transition count 23
Applied a total of 137 rules in 19 ms. Remains 13 /94 variables (removed 81) and now considering 23/126 (removed 103) transitions.
[2021-05-09 16:05:25] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 13 cols
[2021-05-09 16:05:25] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:05:25] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 16:05:25] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 13 cols
[2021-05-09 16:05:25] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:05:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:05:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 16:05:25] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:05:25] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 13 cols
[2021-05-09 16:05:25] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:05:25] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/94 places, 23/126 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s11 0) (NEQ s5 1)), p0:(AND (NEQ s11 0) (NEQ s5 1)), p2:(AND (NEQ s3 0) (NEQ s8 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-04 finished in 147 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 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 126/126 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 88 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 88 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 86 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 86 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 85 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 85 transition count 117
Applied a total of 18 rules in 4 ms. Remains 85 /94 variables (removed 9) and now considering 117/126 (removed 9) transitions.
// Phase 1: matrix 117 rows 85 cols
[2021-05-09 16:05:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:25] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 117 rows 85 cols
[2021-05-09 16:05:25] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-09 16:05:25] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 85 cols
[2021-05-09 16:05:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:26] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/94 places, 117/126 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-09 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 s56 0) (EQ s1 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 180 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Graph (complete) has 230 edges and 85 vertex of which 83 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 2 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, 117/117 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 85 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 117
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 24 place count 85 transition count 138
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 77 transition count 122
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 77 transition count 122
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 61 transition count 90
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 61 transition count 90
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 53 transition count 82
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 53 transition count 82
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 45 transition count 66
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 45 transition count 66
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 120 place count 29 transition count 42
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 136 place count 29 transition count 42
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 136 rules in 17 ms. Remains 29 /85 variables (removed 56) and now considering 42/117 (removed 75) transitions.
[2021-05-09 16:05:26] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:05:26] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
// Phase 1: matrix 38 rows 29 cols
[2021-05-09 16:05:26] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:27] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/85 places, 42/117 transitions.
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
[2021-05-09 16:05:27] [INFO ] Flatten gal took : 6 ms
[2021-05-09 16:05:27] [INFO ] Flatten gal took : 6 ms
[2021-05-09 16:05:27] [INFO ] Time to serialize gal into /tmp/LTL6192576127590142008.gal : 2 ms
[2021-05-09 16:05:27] [INFO ] Time to serialize properties into /tmp/LTL14832653532627734228.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/LTL6192576127590142008.gal, -t, CGAL, -LTL, /tmp/LTL14832653532627734228.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/LTL6192576127590142008.gal -t CGAL -LTL /tmp/LTL14832653532627734228.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p74==0)||(p1==1))"))))
Formula 0 simplified : !XF"((p74==0)||(p1==1))"
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t43, t45, t47, t49, t51, t112, t113, t114, t115, t116, t118, t119, t120, t121, t122, t123, t124, t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/94/23/117
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
915 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,9.17023,228612,1,0,164,1.04059e+06,260,110,2613,1.28499e+06,247
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-11a-09 finished in 11971 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620576339192

--------------------
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-11a"
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-11a, 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-162048875200316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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