Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K 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 BusinessProcesses-PT-05-00
FORMULA_NAME BusinessProcesses-PT-05-01
FORMULA_NAME BusinessProcesses-PT-05-02
FORMULA_NAME BusinessProcesses-PT-05-03
FORMULA_NAME BusinessProcesses-PT-05-04
FORMULA_NAME BusinessProcesses-PT-05-05
FORMULA_NAME BusinessProcesses-PT-05-06
FORMULA_NAME BusinessProcesses-PT-05-07
FORMULA_NAME BusinessProcesses-PT-05-08
FORMULA_NAME BusinessProcesses-PT-05-09
FORMULA_NAME BusinessProcesses-PT-05-10
FORMULA_NAME BusinessProcesses-PT-05-11
FORMULA_NAME BusinessProcesses-PT-05-12
FORMULA_NAME BusinessProcesses-PT-05-13
FORMULA_NAME BusinessProcesses-PT-05-14
FORMULA_NAME BusinessProcesses-PT-05-15

=== Now, execution of the tool begins

BK_START 1620543059248

Running Version 0
[2021-05-09 06:51:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 06:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:51:01] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-09 06:51:01] [INFO ] Transformed 368 places.
[2021-05-09 06:51:01] [INFO ] Transformed 319 transitions.
[2021-05-09 06:51:01] [INFO ] Found NUPN structural information;
[2021-05-09 06:51:01] [INFO ] Parsed PT model containing 368 places and 319 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:51:01] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 367 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 54 place count 313 transition count 266
Iterating global reduction 1 with 52 rules applied. Total rules applied 106 place count 313 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 313 transition count 265
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 133 place count 287 transition count 239
Iterating global reduction 2 with 26 rules applied. Total rules applied 159 place count 287 transition count 239
Applied a total of 159 rules in 79 ms. Remains 287 /367 variables (removed 80) and now considering 239/318 (removed 79) transitions.
// Phase 1: matrix 239 rows 287 cols
[2021-05-09 06:51:01] [INFO ] Computed 55 place invariants in 10 ms
[2021-05-09 06:51:01] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 239 rows 287 cols
[2021-05-09 06:51:01] [INFO ] Computed 55 place invariants in 9 ms
[2021-05-09 06:51:01] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 287 cols
[2021-05-09 06:51:01] [INFO ] Computed 55 place invariants in 2 ms
[2021-05-09 06:51:02] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 287/367 places, 239/318 transitions.
[2021-05-09 06:51:02] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 06:51:02] [INFO ] Flatten gal took : 54 ms
FORMULA BusinessProcesses-PT-05-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:51:02] [INFO ] Flatten gal took : 19 ms
[2021-05-09 06:51:02] [INFO ] Input system was already deterministic with 239 transitions.
Incomplete random walk after 100000 steps, including 944 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 23) seen :22
Running SMT prover for 1 properties.
// Phase 1: matrix 239 rows 287 cols
[2021-05-09 06:51:02] [INFO ] Computed 55 place invariants in 11 ms
[2021-05-09 06:51:02] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 06:51:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:51:02] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-09 06:51:02] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 5 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 4 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2021-05-09 06:51:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 937 ms
[2021-05-09 06:51:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:51:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-09 06:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:51:03] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2021-05-09 06:51:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 849 ms
[2021-05-09 06:51:04] [INFO ] Computed and/alt/rep : 237/464/237 causal constraints (skipped 1 transitions) in 23 ms.
[2021-05-09 06:51:05] [INFO ] Added : 195 causal constraints over 40 iterations in 888 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&X(G((p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 272 transition count 224
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 268 transition count 220
Applied a total of 38 rules in 58 ms. Remains 268 /287 variables (removed 19) and now considering 220/239 (removed 19) transitions.
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:05] [INFO ] Computed 55 place invariants in 11 ms
[2021-05-09 06:51:05] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:06] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:06] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:06] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:06] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 268/287 places, 220/239 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-05-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s57 1), p2:(EQ s143 0), p1:(AND (EQ s73 1) (EQ s214 1) (EQ s253 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 931 reset in 354 ms.
Product exploration explored 100000 steps with 940 reset in 329 ms.
Graph (complete) has 575 edges and 268 vertex of which 267 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 929 reset in 300 ms.
Product exploration explored 100000 steps with 947 reset in 212 ms.
Applying partial POR strategy [true, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Support contains 5 out of 268 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 268/268 places, 220/220 transitions.
Graph (trivial) has 129 edges and 268 vertex of which 6 / 268 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 263 transition count 214
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 31 place count 263 transition count 311
Deduced a syphon composed of 78 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 79 place count 263 transition count 311
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 254 transition count 278
Deduced a syphon composed of 69 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 254 transition count 278
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 153 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 181 place count 254 transition count 278
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 201 place count 234 transition count 258
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 221 place count 234 transition count 258
Deduced a syphon composed of 133 places in 0 ms
Applied a total of 221 rules in 97 ms. Remains 234 /268 variables (removed 34) and now considering 258/220 (removed -38) transitions.
[2021-05-09 06:51:09] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 258 rows 234 cols
[2021-05-09 06:51:09] [INFO ] Computed 55 place invariants in 3 ms
[2021-05-09 06:51:09] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 234/268 places, 258/220 transitions.
Stuttering criterion allowed to conclude after 984 steps with 151 reset in 24 ms.
FORMULA BusinessProcesses-PT-05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-01 finished in 3626 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 151 edges and 287 vertex of which 7 / 287 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 280 transition count 193
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 242 transition count 193
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 77 place count 242 transition count 140
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 195 place count 177 transition count 140
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 209 place count 163 transition count 126
Iterating global reduction 2 with 14 rules applied. Total rules applied 223 place count 163 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 223 place count 163 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 225 place count 162 transition count 125
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 376 place count 85 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 84 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 378 place count 83 transition count 50
Applied a total of 378 rules in 35 ms. Remains 83 /287 variables (removed 204) and now considering 50/239 (removed 189) transitions.
// Phase 1: matrix 50 rows 83 cols
[2021-05-09 06:51:09] [INFO ] Computed 39 place invariants in 0 ms
[2021-05-09 06:51:09] [INFO ] Implicit Places using invariants in 48 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
[2021-05-09 06:51:09] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 50 rows 82 cols
[2021-05-09 06:51:09] [INFO ] Computed 38 place invariants in 0 ms
[2021-05-09 06:51:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 82/287 places, 50/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2021-05-09 06:51:09] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 50 rows 82 cols
[2021-05-09 06:51:09] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:51:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/287 places, 50/239 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s21 1), p1:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18254 reset in 141 ms.
Product exploration explored 100000 steps with 18235 reset in 149 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 18087 reset in 122 ms.
Product exploration explored 100000 steps with 18189 reset in 132 ms.
[2021-05-09 06:51:10] [INFO ] Flatten gal took : 5 ms
[2021-05-09 06:51:10] [INFO ] Flatten gal took : 4 ms
[2021-05-09 06:51:10] [INFO ] Time to serialize gal into /tmp/LTL10168797774616847392.gal : 3 ms
[2021-05-09 06:51:10] [INFO ] Time to serialize properties into /tmp/LTL13532144577786939072.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/LTL10168797774616847392.gal, -t, CGAL, -LTL, /tmp/LTL13532144577786939072.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/LTL10168797774616847392.gal -t CGAL -LTL /tmp/LTL13532144577786939072.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(p145!=1)")||(F("(p125!=1)")))))
Formula 0 simplified : !G("(p145!=1)" | F"(p125!=1)")
Reverse transition relation is NOT exact ! Due to transitions t33, t72.t76.t79.t82.t85.t88.t92.t95.t99.t102.t105.t109.t103.t100.t93.t86.t83.t80.t77, t238.t114.t194.t115.t30, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/47/3/50
Computing Next relation with stutter on 24 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
11 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.143639,19344,1,0,65,9019,127,51,2526,6863,116
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-05-03 finished in 1208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||X((p1||F(p2)||X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 273 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 273 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 270 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 270 transition count 222
Applied a total of 34 rules in 22 ms. Remains 270 /287 variables (removed 17) and now considering 222/239 (removed 17) transitions.
// Phase 1: matrix 222 rows 270 cols
[2021-05-09 06:51:10] [INFO ] Computed 55 place invariants in 2 ms
[2021-05-09 06:51:10] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 222 rows 270 cols
[2021-05-09 06:51:10] [INFO ] Computed 55 place invariants in 2 ms
[2021-05-09 06:51:10] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 270 cols
[2021-05-09 06:51:10] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:10] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 270/287 places, 222/239 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p2:(EQ s264 1), p0:(EQ s131 1), p1:(EQ s231 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, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-04 finished in 602 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 149 edges and 287 vertex of which 4 / 287 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 283 transition count 197
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 245 transition count 197
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 77 place count 245 transition count 143
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 198 place count 178 transition count 143
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 211 place count 165 transition count 130
Iterating global reduction 2 with 13 rules applied. Total rules applied 224 place count 165 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 224 place count 165 transition count 129
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 226 place count 164 transition count 129
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 381 place count 85 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 383 place count 84 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 384 place count 83 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 385 place count 82 transition count 51
Applied a total of 385 rules in 35 ms. Remains 82 /287 variables (removed 205) and now considering 51/239 (removed 188) transitions.
// Phase 1: matrix 51 rows 82 cols
[2021-05-09 06:51:11] [INFO ] Computed 38 place invariants in 0 ms
[2021-05-09 06:51:11] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 51 rows 82 cols
[2021-05-09 06:51:11] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:51:11] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 158 ms to find 38 implicit places.
[2021-05-09 06:51:11] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 51 rows 44 cols
[2021-05-09 06:51:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:51:11] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 44/287 places, 51/239 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 44 transition count 43
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 36 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 31 transition count 38
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 31 transition count 38
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 31 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 27 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 27 transition count 34
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 44 place count 22 transition count 29
Applied a total of 44 rules in 5 ms. Remains 22 /44 variables (removed 22) and now considering 29/51 (removed 22) transitions.
// Phase 1: matrix 29 rows 22 cols
[2021-05-09 06:51:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:51:11] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 29 rows 22 cols
[2021-05-09 06:51:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:51:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/287 places, 29/239 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s19 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19649 reset in 164 ms.
Product exploration explored 100000 steps with 19868 reset in 179 ms.
Graph (complete) has 61 edges and 22 vertex of which 20 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 19713 reset in 124 ms.
Product exploration explored 100000 steps with 19881 reset in 150 ms.
[2021-05-09 06:51:12] [INFO ] Flatten gal took : 2 ms
[2021-05-09 06:51:12] [INFO ] Flatten gal took : 1 ms
[2021-05-09 06:51:12] [INFO ] Time to serialize gal into /tmp/LTL2900596594570662594.gal : 1 ms
[2021-05-09 06:51:12] [INFO ] Time to serialize properties into /tmp/LTL18336530131426345814.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/LTL2900596594570662594.gal, -t, CGAL, -LTL, /tmp/LTL18336530131426345814.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/LTL2900596594570662594.gal -t CGAL -LTL /tmp/LTL18336530131426345814.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p269==0)")||(G("(p77==1)"))))))
Formula 0 simplified : !GF("(p269==0)" | G"(p77==1)")
Reverse transition relation is NOT exact ! Due to transitions t33, t149, t238.t114.t194.t115.t30.t1, t233.t25.t104.t179.t234.t180.t181.t30.t1, t212.t12.t57.t145.t213.t146.t147.t30.t1, t209.t11.t63.t141.t211.t142.t143.t30.t1, t206.t8.t65.t66.t137.t208.t138.t139.t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/22/7/29
Computing Next relation with stutter on 18 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 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.023394,17228,1,0,61,2164,97,40,695,2564,103
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-05-05 finished in 1255 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 150 edges and 287 vertex of which 7 / 287 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 280 transition count 194
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 243 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 242 transition count 193
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 77 place count 242 transition count 141
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 193 place count 178 transition count 141
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 206 place count 165 transition count 128
Iterating global reduction 3 with 13 rules applied. Total rules applied 219 place count 165 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 219 place count 165 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 221 place count 164 transition count 127
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 378 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 379 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 380 place count 82 transition count 49
Applied a total of 380 rules in 17 ms. Remains 82 /287 variables (removed 205) and now considering 49/239 (removed 190) transitions.
// Phase 1: matrix 49 rows 82 cols
[2021-05-09 06:51:12] [INFO ] Computed 39 place invariants in 0 ms
[2021-05-09 06:51:12] [INFO ] Implicit Places using invariants in 81 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
[2021-05-09 06:51:12] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 49 rows 81 cols
[2021-05-09 06:51:12] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:51:12] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 81/287 places, 49/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2021-05-09 06:51:12] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 49 rows 81 cols
[2021-05-09 06:51:12] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:51:12] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/287 places, 49/239 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (NEQ s7 1) (NEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-06 finished in 337 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 153 edges and 287 vertex of which 7 / 287 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 280 transition count 192
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 241 transition count 192
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 79 place count 241 transition count 138
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 200 place count 174 transition count 138
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 214 place count 160 transition count 124
Iterating global reduction 2 with 14 rules applied. Total rules applied 228 place count 160 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 228 place count 160 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 159 transition count 123
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 383 place count 81 transition count 48
Applied a total of 383 rules in 15 ms. Remains 81 /287 variables (removed 206) and now considering 48/239 (removed 191) transitions.
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 06:51:12] [INFO ] Computed 39 place invariants in 1 ms
[2021-05-09 06:51:12] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2021-05-09 06:51:12] [INFO ] Computed 39 place invariants in 0 ms
[2021-05-09 06:51:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 06:51:12] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 238 ms to find 39 implicit places.
[2021-05-09 06:51:12] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 48 rows 42 cols
[2021-05-09 06:51:12] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 06:51:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 42/287 places, 48/239 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 40
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 34 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 29 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 29 transition count 35
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 29 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 25 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 25 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 44 place count 20 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 20 transition count 25
Applied a total of 45 rules in 4 ms. Remains 20 /42 variables (removed 22) and now considering 25/48 (removed 23) transitions.
// Phase 1: matrix 25 rows 20 cols
[2021-05-09 06:51:12] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:51:13] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 25 rows 20 cols
[2021-05-09 06:51:13] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 06:51:13] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/287 places, 25/239 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 0)], 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 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-07 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 272 transition count 224
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 268 transition count 220
Applied a total of 38 rules in 10 ms. Remains 268 /287 variables (removed 19) and now considering 220/239 (removed 19) transitions.
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:13] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:13] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:13] [INFO ] Computed 55 place invariants in 5 ms
[2021-05-09 06:51:13] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:13] [INFO ] Computed 55 place invariants in 2 ms
[2021-05-09 06:51:13] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
Finished structural reductions, in 1 iterations. Remains : 268/287 places, 220/239 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-05-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s186 1), p0:(NEQ s21 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-08 finished in 730 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U X(p1))||X(X(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 272 transition count 224
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 268 transition count 220
Applied a total of 38 rules in 15 ms. Remains 268 /287 variables (removed 19) and now considering 220/239 (removed 19) transitions.
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:13] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:13] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:14] [INFO ] Computed 55 place invariants in 5 ms
[2021-05-09 06:51:14] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 268 cols
[2021-05-09 06:51:14] [INFO ] Computed 55 place invariants in 2 ms
[2021-05-09 06:51:15] [INFO ] Dead Transitions using invariants and state equation in 1532 ms returned []
Finished structural reductions, in 1 iterations. Remains : 268/287 places, 220/239 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}]], initial=0, aps=[p0:(AND (EQ s49 1) (EQ s229 1)), p2:(NEQ s49 0), p1:(EQ s229 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, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-09 finished in 2132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 150 edges and 287 vertex of which 7 / 287 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 280 transition count 194
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 243 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 242 transition count 193
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 77 place count 242 transition count 139
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 198 place count 175 transition count 139
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 211 place count 162 transition count 126
Iterating global reduction 3 with 13 rules applied. Total rules applied 224 place count 162 transition count 126
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 375 place count 85 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 376 place count 84 transition count 51
Applied a total of 376 rules in 21 ms. Remains 84 /287 variables (removed 203) and now considering 51/239 (removed 188) transitions.
// Phase 1: matrix 51 rows 84 cols
[2021-05-09 06:51:16] [INFO ] Computed 39 place invariants in 0 ms
[2021-05-09 06:51:16] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 51 rows 84 cols
[2021-05-09 06:51:16] [INFO ] Computed 39 place invariants in 0 ms
[2021-05-09 06:51:16] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 34, 36, 38, 40, 42, 44, 48, 49, 51, 53, 55, 57, 59, 61, 63, 65]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 251 ms to find 33 implicit places.
[2021-05-09 06:51:16] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-09 06:51:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 06:51:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 51/287 places, 51/239 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 51 transition count 46
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 46 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 43 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 43 transition count 43
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 17 place count 43 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 42 transition count 42
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 4 with 12 rules applied. Total rules applied 30 place count 36 transition count 36
Applied a total of 30 rules in 4 ms. Remains 36 /51 variables (removed 15) and now considering 36/51 (removed 15) transitions.
// Phase 1: matrix 36 rows 36 cols
[2021-05-09 06:51:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 06:51:16] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 36 rows 36 cols
[2021-05-09 06:51:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 06:51:16] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 36/287 places, 36/239 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-10 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}]], initial=0, aps=[p1:(AND (NEQ s22 1) (NEQ s0 1)), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 29079 reset in 95 ms.
Product exploration explored 100000 steps with 29025 reset in 131 ms.
Graph (complete) has 101 edges and 36 vertex of which 33 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 29057 reset in 88 ms.
Product exploration explored 100000 steps with 28896 reset in 107 ms.
[2021-05-09 06:51:17] [INFO ] Flatten gal took : 6 ms
[2021-05-09 06:51:17] [INFO ] Flatten gal took : 5 ms
[2021-05-09 06:51:17] [INFO ] Time to serialize gal into /tmp/LTL1177650677207525902.gal : 2 ms
[2021-05-09 06:51:17] [INFO ] Time to serialize properties into /tmp/LTL3993806510613157612.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/LTL1177650677207525902.gal, -t, CGAL, -LTL, /tmp/LTL3993806510613157612.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/LTL1177650677207525902.gal -t CGAL -LTL /tmp/LTL3993806510613157612.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p152==1)")||(G("((p217!=1)&&(p129!=1))")))))
Formula 0 simplified : !F("(p152==1)" | G"((p217!=1)&&(p129!=1))")
Reverse transition relation is NOT exact ! Due to transitions t33, t71, t204.t7.t81.t133.t190.t205.t134.t135.t30, t194.t115, t95.t99.t102.t105.t109.t103.t100, t92.t93, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/6/36
Computing Next relation with stutter on 21 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4 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.056718,17424,1,0,69,3630,106,44,1107,3165,106
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-05-10 finished in 1151 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 152 edges and 287 vertex of which 7 / 287 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 280 transition count 193
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 242 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 241 transition count 192
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 79 place count 241 transition count 138
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 200 place count 174 transition count 138
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 214 place count 160 transition count 124
Iterating global reduction 3 with 14 rules applied. Total rules applied 228 place count 160 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 228 place count 160 transition count 123
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 159 transition count 123
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 383 place count 81 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 384 place count 80 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 79 transition count 47
Applied a total of 385 rules in 36 ms. Remains 79 /287 variables (removed 208) and now considering 47/239 (removed 192) transitions.
// Phase 1: matrix 47 rows 79 cols
[2021-05-09 06:51:17] [INFO ] Computed 38 place invariants in 0 ms
[2021-05-09 06:51:17] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 47 rows 79 cols
[2021-05-09 06:51:17] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:51:17] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 142 ms to find 38 implicit places.
[2021-05-09 06:51:17] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 47 rows 41 cols
[2021-05-09 06:51:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:51:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 41/287 places, 47/239 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 41 transition count 40
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 34 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 29 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 29 transition count 35
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 29 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 25 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 25 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 42 place count 20 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 20 transition count 25
Applied a total of 43 rules in 4 ms. Remains 20 /41 variables (removed 21) and now considering 25/47 (removed 22) transitions.
// Phase 1: matrix 25 rows 20 cols
[2021-05-09 06:51:17] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 06:51:17] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 25 rows 20 cols
[2021-05-09 06:51:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:51:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/287 places, 25/239 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-11 finished in 319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 272 transition count 224
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 272 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 269 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 269 transition count 221
Applied a total of 36 rules in 11 ms. Remains 269 /287 variables (removed 18) and now considering 221/239 (removed 18) transitions.
// Phase 1: matrix 221 rows 269 cols
[2021-05-09 06:51:17] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:17] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 221 rows 269 cols
[2021-05-09 06:51:17] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:17] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 269 cols
[2021-05-09 06:51:17] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:17] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/287 places, 221/239 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s254 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 212 ms.
Product exploration explored 100000 steps with 33333 reset in 173 ms.
Graph (complete) has 578 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 219 ms.
Product exploration explored 100000 steps with 33333 reset in 224 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 269 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 269/269 places, 221/221 transitions.
Graph (trivial) has 133 edges and 269 vertex of which 6 / 269 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 264 transition count 215
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 30 place count 264 transition count 325
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 82 place count 264 transition count 325
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 91 place count 255 transition count 292
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 100 place count 255 transition count 292
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 157 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 185 place count 255 transition count 292
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 205 place count 235 transition count 272
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 225 place count 235 transition count 272
Deduced a syphon composed of 137 places in 0 ms
Applied a total of 225 rules in 27 ms. Remains 235 /269 variables (removed 34) and now considering 272/221 (removed -51) transitions.
[2021-05-09 06:51:19] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 272 rows 235 cols
[2021-05-09 06:51:19] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:19] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/269 places, 272/221 transitions.
Product exploration explored 100000 steps with 33333 reset in 756 ms.
Product exploration explored 100000 steps with 33333 reset in 582 ms.
[2021-05-09 06:51:20] [INFO ] Flatten gal took : 10 ms
[2021-05-09 06:51:20] [INFO ] Flatten gal took : 11 ms
[2021-05-09 06:51:20] [INFO ] Time to serialize gal into /tmp/LTL13408551354930156120.gal : 10 ms
[2021-05-09 06:51:20] [INFO ] Time to serialize properties into /tmp/LTL4085860929295963387.ltl : 3 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/LTL13408551354930156120.gal, -t, CGAL, -LTL, /tmp/LTL4085860929295963387.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/LTL13408551354930156120.gal -t CGAL -LTL /tmp/LTL4085860929295963387.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p339!=1)")))))
Formula 0 simplified : !XXF"(p339!=1)"
Detected timeout of ITS tools.
[2021-05-09 06:51:36] [INFO ] Flatten gal took : 12 ms
[2021-05-09 06:51:36] [INFO ] Applying decomposition
[2021-05-09 06:51:36] [INFO ] Flatten gal took : 21 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/graph415182364065482171.txt, -o, /tmp/graph415182364065482171.bin, -w, /tmp/graph415182364065482171.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/graph415182364065482171.bin, -l, -1, -v, -w, /tmp/graph415182364065482171.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:51:36] [INFO ] Decomposing Gal with order
[2021-05-09 06:51:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:51:36] [INFO ] Removed a total of 69 redundant transitions.
[2021-05-09 06:51:36] [INFO ] Flatten gal took : 57 ms
[2021-05-09 06:51:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2021-05-09 06:51:36] [INFO ] Time to serialize gal into /tmp/LTL15346489711474919622.gal : 5 ms
[2021-05-09 06:51:36] [INFO ] Time to serialize properties into /tmp/LTL5272191171920743520.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/LTL15346489711474919622.gal, -t, CGAL, -LTL, /tmp/LTL5272191171920743520.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/LTL15346489711474919622.gal -t CGAL -LTL /tmp/LTL5272191171920743520.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i18.u87.p339!=1)")))))
Formula 0 simplified : !XXF"(i18.u87.p339!=1)"
Reverse transition relation is NOT exact ! Due to transitions t173, t217, t219, t220, t221, t224, t230, i0.u73.t44, i0.u74.t41, i1.i0.t116, i1.i0.u37.t123, i1.i0.u39.t119, i1.i0.u43.t112, i1.i1.u41.t115, i2.u33.t131, i2.u35.t127, i3.u31.t135, i4.t178, i4.t169, i4.u9.t184, i4.u11.t181, i4.u15.t172, i6.u13.t176, i6.u14.t175, i6.u56.t96, i7.u19.t163, i8.u21.t158, i8.u22.t156, i8.u54.t103, i9.i0.u23.t153, i9.i1.u25.t149, i10.u27.t143, i10.u29.t139, i12.u71.t50, i12.u72.t47, i13.u67.t62, i13.u68.t59, i13.u69.t56, i13.u70.t53, i14.u62.t77, i14.u63.t73, i14.u64.t69, i14.u66.t65, i15.i0.u17.t167, i15.i0.u18.t166, i15.i1.u60.t83, i15.i1.u61.t80, i16.u58.t89, i16.u59.t86, i17.u52.t109, i17.u53.t106, i17.u55.t100, i17.u57.t93, i18.t10, i18.u76.t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/164/55/219
Computing Next relation with stutter on 24 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
174 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.78059,71320,1,0,119045,366,2946,180260,149,868,298013
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-05-12 finished in 20982 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 271 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 271 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 267 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 267 transition count 219
Applied a total of 40 rules in 10 ms. Remains 267 /287 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 267 cols
[2021-05-09 06:51:38] [INFO ] Computed 55 place invariants in 18 ms
[2021-05-09 06:51:38] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 219 rows 267 cols
[2021-05-09 06:51:38] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:38] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 267 cols
[2021-05-09 06:51:38] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:51:39] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 267/287 places, 219/239 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s73 1) (EQ s213 1) (EQ s252 1)), p0:(NEQ s128 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 341 ms.
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Graph (complete) has 574 edges and 267 vertex of which 266 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 82 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 117 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 267 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 267/267 places, 219/219 transitions.
Graph (trivial) has 130 edges and 267 vertex of which 6 / 267 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 262 transition count 213
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 30 place count 262 transition count 313
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 79 place count 262 transition count 313
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 253 transition count 280
Deduced a syphon composed of 69 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 253 transition count 280
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 180 place count 253 transition count 280
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 200 place count 233 transition count 260
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 220 place count 233 transition count 260
Deduced a syphon composed of 132 places in 0 ms
Applied a total of 220 rules in 29 ms. Remains 233 /267 variables (removed 34) and now considering 260/219 (removed -41) transitions.
[2021-05-09 06:51:40] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 260 rows 233 cols
[2021-05-09 06:51:40] [INFO ] Computed 55 place invariants in 3 ms
[2021-05-09 06:51:41] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 233/267 places, 260/219 transitions.
Product exploration explored 100000 steps with 50000 reset in 1261 ms.
Product exploration explored 100000 steps with 50000 reset in 910 ms.
[2021-05-09 06:51:43] [INFO ] Flatten gal took : 22 ms
[2021-05-09 06:51:43] [INFO ] Flatten gal took : 17 ms
[2021-05-09 06:51:43] [INFO ] Time to serialize gal into /tmp/LTL13413506511811785391.gal : 3 ms
[2021-05-09 06:51:43] [INFO ] Time to serialize properties into /tmp/LTL17036899198585662448.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/LTL13413506511811785391.gal, -t, CGAL, -LTL, /tmp/LTL17036899198585662448.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/LTL13413506511811785391.gal -t CGAL -LTL /tmp/LTL17036899198585662448.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p146!=1)")||(G("(((p88!=1)||(p249!=1))||(p337!=1))"))))))
Formula 0 simplified : !XF("(p146!=1)" | G"(((p88!=1)||(p249!=1))||(p337!=1))")
Detected timeout of ITS tools.
[2021-05-09 06:51:58] [INFO ] Flatten gal took : 17 ms
[2021-05-09 06:51:58] [INFO ] Applying decomposition
[2021-05-09 06:51:58] [INFO ] Flatten gal took : 37 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/graph6260588139130774889.txt, -o, /tmp/graph6260588139130774889.bin, -w, /tmp/graph6260588139130774889.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/graph6260588139130774889.bin, -l, -1, -v, -w, /tmp/graph6260588139130774889.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:51:58] [INFO ] Decomposing Gal with order
[2021-05-09 06:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:51:58] [INFO ] Removed a total of 70 redundant transitions.
[2021-05-09 06:51:58] [INFO ] Flatten gal took : 41 ms
[2021-05-09 06:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2021-05-09 06:51:58] [INFO ] Time to serialize gal into /tmp/LTL427906983878593007.gal : 4 ms
[2021-05-09 06:51:58] [INFO ] Time to serialize properties into /tmp/LTL10139213897277624377.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/LTL427906983878593007.gal, -t, CGAL, -LTL, /tmp/LTL10139213897277624377.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/LTL427906983878593007.gal -t CGAL -LTL /tmp/LTL10139213897277624377.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i15.u48.p146!=1)")||(G("(((i2.u28.p88!=1)||(i0.u70.p249!=1))||(i2.u85.p337!=1))"))))))
Formula 0 simplified : !XF("(i15.u48.p146!=1)" | G"(((i2.u28.p88!=1)||(i0.u70.p249!=1))||(i2.u85.p337!=1))")
Reverse transition relation is NOT exact ! Due to transitions t116, t173, t178, t217, t220, t221, t224, t230, i0.u70.t50, i0.u71.t47, i0.u72.t44, i0.u73.t41, i1.u35.t127, i1.u37.t123, i2.u27.t143, i2.u29.t139, i3.u23.t153, i3.u25.t149, i4.u17.t167, i4.u18.t166, i4.u19.t163, i5.t169, i5.u9.t184, i5.u15.t172, i5.u55.t100, i6.i0.u11.t181, i6.i1.u52.t109, i6.i1.u53.t106, i6.i1.u54.t103, i7.u13.t176, i7.u14.t175, i8.i0.u31.t135, i8.i1.u33.t131, i10.i1.u39.t119, i10.i1.u41.t115, i11.i0.u43.t112, i11.i1.u75.t33, i12.u67.t59, i12.u68.t56, i12.u69.t53, i13.i0.u21.t158, i13.i0.u22.t156, i13.i1.u65.t65, i13.i1.u66.t62, i14.u63.t73, i14.u64.t69, i15.u60.t83, i15.u61.t80, i15.u62.t77, i16.u56.t96, i16.u57.t93, i16.u58.t89, i16.u59.t86, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/163/53/216
Computing Next relation with stutter on 24 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
486 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,4.91401,205452,1,0,414799,418,2906,563846,150,1002,950906
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-05-14 finished in 26000 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 153 edges and 287 vertex of which 7 / 287 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 280 transition count 192
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 241 transition count 192
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 79 place count 241 transition count 138
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 200 place count 174 transition count 138
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 214 place count 160 transition count 124
Iterating global reduction 2 with 14 rules applied. Total rules applied 228 place count 160 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 228 place count 160 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 159 transition count 123
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 381 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 383 place count 80 transition count 48
Applied a total of 383 rules in 42 ms. Remains 80 /287 variables (removed 207) and now considering 48/239 (removed 191) transitions.
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 06:52:04] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:52:04] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2021-05-09 06:52:04] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:52:04] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 158 ms to find 33 implicit places.
[2021-05-09 06:52:04] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 48 rows 47 cols
[2021-05-09 06:52:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 06:52:04] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 47/287 places, 48/239 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 47 transition count 40
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 39 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 34 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 34 transition count 35
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 34 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 31 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 30 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 30 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 44 place count 25 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 25 transition count 25
Applied a total of 45 rules in 4 ms. Remains 25 /47 variables (removed 22) and now considering 25/48 (removed 23) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-05-09 06:52:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 06:52:04] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-05-09 06:52:04] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 06:52:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-09 06:52:04] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 25/287 places, 25/239 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-15 finished in 404 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620543125387

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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