Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:43 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 4.1K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C03M03P03D03-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-15

=== Now, execution of the tool begins

BK_START 1620838255129

Running Version 0
[2021-05-12 16:50:56] [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-12 16:50:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:50:56] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2021-05-12 16:50:56] [INFO ] Transformed 111 places.
[2021-05-12 16:50:56] [INFO ] Transformed 45 transitions.
[2021-05-12 16:50:56] [INFO ] Parsed PT model containing 111 places and 45 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:50:56] [INFO ] Initial state test concluded for 1 properties.
Support contains 51 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 23 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 86 transition count 45
Applied a total of 25 rules in 13 ms. Remains 86 /111 variables (removed 25) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 86 cols
[2021-05-12 16:50:56] [INFO ] Computed 42 place invariants in 8 ms
[2021-05-12 16:50:57] [INFO ] Implicit Places using invariants in 136 ms returned [11, 19, 25, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 162 ms to find 4 implicit places.
// Phase 1: matrix 45 rows 82 cols
[2021-05-12 16:50:57] [INFO ] Computed 38 place invariants in 4 ms
[2021-05-12 16:50:57] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 82/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 82 cols
[2021-05-12 16:50:57] [INFO ] Computed 38 place invariants in 3 ms
[2021-05-12 16:50:57] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/111 places, 45/45 transitions.
[2021-05-12 16:50:57] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 16:50:57] [INFO ] Flatten gal took : 28 ms
FORMULA IOTPpurchase-PT-C03M03P03D03-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:50:57] [INFO ] Flatten gal took : 9 ms
[2021-05-12 16:50:57] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 118 steps, including 0 resets, run visited all 23 properties in 8 ms. (steps per millisecond=14 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 64 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 41 place count 49 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 53 place count 37 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 53 place count 37 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 72 place count 26 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 72 place count 26 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 24 transition count 14
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 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 90 place count 16 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 15 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 91 place count 15 transition count 7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 13 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 13 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 98 place count 11 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 100 place count 9 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 100 place count 9 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 102 place count 8 transition count 4
Applied a total of 102 rules in 20 ms. Remains 8 /82 variables (removed 74) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 8 cols
[2021-05-12 16:50:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:50:57] [INFO ] Implicit Places using invariants in 15 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-12 16:50:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 7 cols
[2021-05-12 16:50:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:50:57] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 7/82 places, 4/45 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 5 transition count 3
Applied a total of 3 rules in 1 ms. Remains 5 /7 variables (removed 2) and now considering 3/4 (removed 1) transitions.
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 16:50:57] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-12 16:50:57] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 16:50:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:50:57] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/82 places, 3/45 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 202 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-00 finished in 453 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X((p2||G(p3)||G(p4)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 65 transition count 45
Applied a total of 17 rules in 3 ms. Remains 65 /82 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:50:58] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:50:58] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:50:58] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-12 16:50:58] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 64/82 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:50:58] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-12 16:50:58] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 64/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 9390 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p4) (NOT p3)), (AND (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p4), acceptance={} source=3 dest: 0}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p4), acceptance={} source=4 dest: 3}, { cond=(AND p3 p4), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p4)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p4), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p3 p4), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p4)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) p4), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3 p4), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2) p3 p4), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3) p4), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2) p3 (NOT p4)), acceptance={} source=6 dest: 10}], [{ cond=(NOT p3), acceptance={} source=7 dest: 0}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p4)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p4), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3 p4), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p4)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0 p3 p4), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p3) p4), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) p0 p3 (NOT p4)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) p0 p4), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=10 dest: 10}]], initial=2, aps=[p1:(AND (GEQ s13 1) (GEQ s42 1)), p0:(GEQ s38 1), p4:(OR (LT s15 1) (LT s16 1)), p3:(AND (GEQ s8 1) (GEQ s53 1)), p2:(AND (GEQ s17 1) (GEQ s43 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-01 finished in 9593 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 63 transition count 45
Applied a total of 19 rules in 3 ms. Remains 63 /82 variables (removed 19) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:07] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:51:07] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:07] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:51:07] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:07] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:51:07] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s14 1) (LT s25 1) (LT s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 56 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-02 finished in 439 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(G(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 25 place count 56 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 31 place count 50 transition count 33
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 31 place count 50 transition count 21
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 59 place count 34 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 59 place count 34 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 31 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 86 place count 18 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 17 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 17 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 15 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 15 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 12 transition count 7
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 6 with 2 rules applied. Total rules applied 97 place count 11 transition count 6
Applied a total of 97 rules in 7 ms. Remains 11 /82 variables (removed 71) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2021-05-12 16:51:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:51:08] [INFO ] Implicit Places using invariants in 30 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
[2021-05-12 16:51:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2021-05-12 16:51:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:51:08] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 10/82 places, 6/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-12 16:51:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2021-05-12 16:51:08] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:51:08] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/82 places, 6/45 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1), p1]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1)), p1:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-04 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 64 transition count 45
Applied a total of 18 rules in 6 ms. Remains 64 /82 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:51:08] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-12 16:51:08] [INFO ] Implicit Places using invariants in 32 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:08] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 16:51:08] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 63/82 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:08] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 16:51:08] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3806 reset in 240 ms.
Product exploration explored 100000 steps with 3776 reset in 209 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3772 reset in 121 ms.
Product exploration explored 100000 steps with 3779 reset in 155 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 63/63 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 7 place count 63 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 63 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 62 transition count 44
Deduced a syphon composed of 27 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 18 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:51:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2021-05-12 16:51:09] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:51:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 44/45 transitions.
Product exploration explored 100000 steps with 10923 reset in 299 ms.
Product exploration explored 100000 steps with 10923 reset in 214 ms.
[2021-05-12 16:51:10] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:51:10] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:51:10] [INFO ] Time to serialize gal into /tmp/LTL7300461033392239626.gal : 1 ms
[2021-05-12 16:51:10] [INFO ] Time to serialize properties into /tmp/LTL3977091886374833408.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/LTL7300461033392239626.gal, -t, CGAL, -LTL, /tmp/LTL3977091886374833408.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/LTL7300461033392239626.gal -t CGAL -LTL /tmp/LTL3977091886374833408.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((PaymentHandlerPayment_p5_0>=1)&&(PaymentRequest_p11_9>=1))||((BrandList_p11_2>=1)&&(p3_2>=1)))"))))
Formula 0 simplified : !XF"(((PaymentHandlerPayment_p5_0>=1)&&(PaymentRequest_p11_9>=1))||((BrandList_p11_2>=1)&&(p3_2>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
22 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.239272,22828,1,0,158,41561,20,34,1401,23470,336
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C03M03P03D03-05 finished in 2059 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 66 transition count 45
Applied a total of 16 rules in 3 ms. Remains 66 /82 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:51:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-12 16:51:10] [INFO ] Implicit Places using invariants in 27 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:51:10] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:51:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 65/82 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:51:10] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-12 16:51:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 65/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s2 1), p0:(OR (AND (GEQ s12 1) (GEQ s15 1) (GEQ s20 1) (GEQ s50 1)) (GEQ s53 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][false, false, false, false]]
Product exploration explored 100000 steps with 1457 reset in 149 ms.
Product exploration explored 100000 steps with 1456 reset in 164 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1462 reset in 143 ms.
Product exploration explored 100000 steps with 1452 reset in 160 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 6 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 65/65 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 8 place count 65 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 21 place count 65 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 65 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 64 transition count 44
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 64 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 29 rules in 8 ms. Remains 64 /65 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:51:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 64 cols
[2021-05-12 16:51:11] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:51:11] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/65 places, 44/45 transitions.
Product exploration explored 100000 steps with 3412 reset in 185 ms.
Product exploration explored 100000 steps with 3429 reset in 202 ms.
[2021-05-12 16:51:11] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:51:11] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:51:11] [INFO ] Time to serialize gal into /tmp/LTL5176068847774144056.gal : 1 ms
[2021-05-12 16:51:11] [INFO ] Time to serialize properties into /tmp/LTL11431896636416877491.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/LTL5176068847774144056.gal, -t, CGAL, -LTL, /tmp/LTL11431896636416877491.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/LTL5176068847774144056.gal -t CGAL -LTL /tmp/LTL11431896636416877491.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(((((Organization_p21_8>=1)&&(Payment_p21_7>=1))&&(Status_p21_9>=1))&&(p5_1>=1))||(p5_4>=1))"))&&(F("(ConsumerDelivery_p6_0>=1)")))))
Formula 0 simplified : !X(F"(((((Organization_p21_8>=1)&&(Payment_p21_7>=1))&&(Status_p21_9>=1))&&(p5_1>=1))||(p5_4>=1))" & F"(ConsumerDelivery_p6_0>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
104 unique states visited
0 strongly connected components in search stack
123 transitions explored
64 items max in DFS search stack
232 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,2.33344,85840,1,0,3629,386297,33,1063,1464,482091,7743
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C03M03P03D03-06 finished in 4343 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 6 places :
Implicit places reduction removed 6 places
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 13 rules applied. Total rules applied 13 place count 66 transition count 38
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 25 rules applied. Total rules applied 38 place count 53 transition count 26
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 51 place count 41 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 40 transition count 25
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 52 place count 40 transition count 17
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 72 place count 28 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 72 place count 28 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 78 place count 25 transition count 14
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 10 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 94 place count 15 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 14 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 13 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 97 place count 13 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 102 place count 10 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 102 place count 10 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 105 place count 8 transition count 4
Applied a total of 105 rules in 10 ms. Remains 8 /82 variables (removed 74) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 8 cols
[2021-05-12 16:51:14] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:51:14] [INFO ] Implicit Places using invariants in 22 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
[2021-05-12 16:51:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 7 cols
[2021-05-12 16:51:14] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:51:14] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 7/82 places, 4/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-12 16:51:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 7 cols
[2021-05-12 16:51:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:51:14] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/82 places, 4/45 transitions.
Stuttering acceptance computed with spot in 7813 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s5 1)), p1:(GEQ s0 1)], 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 5153 reset in 84 ms.
Product exploration explored 100000 steps with 5152 reset in 98 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5179 reset in 72 ms.
Product exploration explored 100000 steps with 5113 reset in 97 ms.
[2021-05-12 16:51:23] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:51:23] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:51:23] [INFO ] Time to serialize gal into /tmp/LTL14542128548591149007.gal : 10 ms
[2021-05-12 16:51:23] [INFO ] Time to serialize properties into /tmp/LTL14781220333046768166.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/LTL14542128548591149007.gal, -t, CGAL, -LTL, /tmp/LTL14781220333046768166.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/LTL14542128548591149007.gal -t CGAL -LTL /tmp/LTL14781220333046768166.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((((PayReceipt_p21_15>=1)&&(PaymentNote_p21_16>=1))&&(Status_p21_14>=1))&&(p3_10>=1))"))||(G(F("(ConsumerOffer_p1>=1)"))))))
Formula 0 simplified : !F(G"((((PayReceipt_p21_15>=1)&&(PaymentNote_p21_16>=1))&&(Status_p21_14>=1))&&(p3_10>=1))" | GF"(ConsumerOffer_p1>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 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.020416,16672,1,0,33,537,34,9,181,509,87
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C03M03P03D03-07 finished in 8452 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 6 places :
Implicit places reduction removed 6 places
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 14 rules applied. Total rules applied 14 place count 65 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 26 rules applied. Total rules applied 40 place count 51 transition count 25
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 53 place count 39 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 38 transition count 24
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 54 place count 38 transition count 15
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 76 place count 25 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 76 place count 25 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 82 place count 22 transition count 12
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 8 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 95 place count 14 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 13 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 96 place count 13 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 9 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 103 place count 9 transition count 4
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 106 place count 7 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 108 place count 5 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 108 place count 5 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 110 place count 4 transition count 2
Applied a total of 110 rules in 5 ms. Remains 4 /82 variables (removed 78) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 4 cols
[2021-05-12 16:51:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:51:23] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 2 rows 4 cols
[2021-05-12 16:51:23] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:51:23] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-12 16:51:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 4 cols
[2021-05-12 16:51:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:51:23] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/82 places, 2/45 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 97 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 4 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-08 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 63 transition count 45
Applied a total of 19 rules in 8 ms. Remains 63 /82 variables (removed 19) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:23] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:51:23] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:51:23] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:51:23] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 62/82 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:51:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:51:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s34 1), p0:(AND (LT s43 1) (OR (LT s27 1) (LT s39 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 62/62 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 62 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 7 place count 62 transition count 45
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 20 place count 62 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 61 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 61 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 29 rules in 7 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:51:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2021-05-12 16:51:24] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:51:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 50000 reset in 346 ms.
Product exploration explored 100000 steps with 50000 reset in 355 ms.
[2021-05-12 16:51:25] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:51:25] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:51:25] [INFO ] Time to serialize gal into /tmp/LTL7187170978489289083.gal : 2 ms
[2021-05-12 16:51:25] [INFO ] Time to serialize properties into /tmp/LTL11274587076575186070.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/LTL7187170978489289083.gal, -t, CGAL, -LTL, /tmp/LTL11274587076575186070.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/LTL7187170978489289083.gal -t CGAL -LTL /tmp/LTL11274587076575186070.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("((p4_1<1)&&((p11_4<1)||(p3_4<1)))"))&&(F("(p2_1<1)")))))
Formula 0 simplified : !F(X"((p4_1<1)&&((p11_4<1)||(p3_4<1)))" & F"(p2_1<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
15 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.159413,20164,1,0,6,21709,22,0,1376,20895,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C03M03P03D03-09 finished in 2155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X((!p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 64 transition count 45
Applied a total of 18 rules in 1 ms. Remains 64 /82 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:51:25] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-12 16:51:25] [INFO ] Implicit Places using invariants in 44 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:25] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:51:25] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 63/82 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:25] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:51:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s21 1)), p2:(AND (GEQ s14 1) (GEQ s40 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2379 reset in 137 ms.
Product exploration explored 100000 steps with 2374 reset in 150 ms.
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2382 reset in 135 ms.
Product exploration explored 100000 steps with 2376 reset in 149 ms.
[2021-05-12 16:51:26] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:51:26] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:51:26] [INFO ] Time to serialize gal into /tmp/LTL4984479027924454698.gal : 1 ms
[2021-05-12 16:51:26] [INFO ] Time to serialize properties into /tmp/LTL5001157597095284575.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/LTL4984479027924454698.gal, -t, CGAL, -LTL, /tmp/LTL5001157597095284575.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/LTL4984479027924454698.gal -t CGAL -LTL /tmp/LTL5001157597095284575.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((X(("(ConsumerDelivery_p6_0<1)")U("((PaymentAmount_p11_6>=1)&&(p3_5>=1))")))||("((p1_1>=1)&&(p10_0>=1))")))))
Formula 0 simplified : !FG("((p1_1>=1)&&(p10_0>=1))" | X("(ConsumerDelivery_p6_0<1)" U "((PaymentAmount_p11_6>=1)&&(p3_5>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
28 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.288646,25020,1,0,19,46360,42,4,1501,36497,49
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C03M03P03D03-10 finished in 1310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&X(G(!p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 64 transition count 45
Applied a total of 18 rules in 1 ms. Remains 64 /82 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:51:26] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-12 16:51:26] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:51:26] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-12 16:51:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:51:26] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-12 16:51:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 102 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), true]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-11 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(OR (LT s15 1) (LT s26 1) (LT s50 1)), p1:(OR (LT s10 1) (LT s13 1)), p0:(GEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-11 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F((X(X(X(F(p2))))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 64 transition count 45
Applied a total of 18 rules in 1 ms. Remains 64 /82 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:51:27] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-12 16:51:27] [INFO ] Implicit Places using invariants in 23 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:27] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:51:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 63/82 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:51:27] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:51:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p2), acceptance={0} source=6 dest: 0}, { cond=(NOT p0), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s52 1)) (AND (GEQ s5 1) (GEQ s6 1))), p1:(AND (GEQ s5 1) (GEQ s6 1)), p2:(AND (GEQ s8 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-13 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 6 places :
Implicit places reduction removed 6 places
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 14 rules applied. Total rules applied 14 place count 68 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 23 rules applied. Total rules applied 37 place count 55 transition count 27
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 47 place count 45 transition count 27
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 47 place count 45 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 69 place count 32 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 32 transition count 15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 29 transition count 15
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 93 place count 18 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 17 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 94 place count 17 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 15 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 15 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 101 place count 13 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 102 place count 12 transition count 5
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 107 place count 9 transition count 3
Applied a total of 107 rules in 9 ms. Remains 9 /82 variables (removed 73) and now considering 3/45 (removed 42) transitions.
// Phase 1: matrix 3 rows 9 cols
[2021-05-12 16:51:27] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:51:27] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 3 rows 9 cols
[2021-05-12 16:51:27] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:51:27] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-12 16:51:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 9 cols
[2021-05-12 16:51:27] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:51:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/82 places, 3/45 transitions.
Stuttering acceptance computed with spot in 7415 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-14 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:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s8 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 21612 reset in 91 ms.
Product exploration explored 100000 steps with 21888 reset in 84 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21877 reset in 88 ms.
Product exploration explored 100000 steps with 21804 reset in 86 ms.
[2021-05-12 16:51:35] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:51:35] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:51:35] [INFO ] Time to serialize gal into /tmp/LTL10575839351759592728.gal : 1 ms
[2021-05-12 16:51:35] [INFO ] Time to serialize properties into /tmp/LTL9857718167201858813.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/LTL10575839351759592728.gal, -t, CGAL, -LTL, /tmp/LTL9857718167201858813.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/LTL10575839351759592728.gal -t CGAL -LTL /tmp/LTL9857718167201858813.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((Delivery_p20>=1)&&(OfferResponce_p10>=1))&&(Order_p20>=1))&&(Organization_p20_2>=1))&&(Payment_p20>=1))&&(Status_p20>=1))&&(p2_2>=1))"))))
Formula 0 simplified : !GF"(((((((Delivery_p20>=1)&&(OfferResponce_p10>=1))&&(Order_p20>=1))&&(Organization_p20_2>=1))&&(Payment_p20>=1))&&(Status_p20>=1))&&(p2_2>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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.010706,16392,1,0,11,234,24,1,224,191,29
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C03M03P03D03-14 finished in 7975 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((!p0&&G(F(p1))&&(!p2 U (p3||G(!p2)))))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 67 transition count 45
Applied a total of 15 rules in 5 ms. Remains 67 /82 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2021-05-12 16:51:35] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-12 16:51:35] [INFO ] Implicit Places using invariants in 41 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:51:35] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-12 16:51:35] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 66/82 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:51:35] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-12 16:51:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/82 places, 45/45 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (NOT p1), (NOT p1), (OR p0 (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(OR p0 (AND (NOT p3) p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(OR p0 (AND (NOT p3) p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s26 1) (GEQ s39 1)), p0:(AND (GEQ s13 1) (GEQ s17 1) (GEQ s20 1) (GEQ s40 1)), p3:(AND (OR (LT s8 1) (LT s55 1)) (OR (LT s13 1) (LT s17 1) (LT s20 1) (LT s40 1))), p2:(AND (GEQ s8 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6063 reset in 110 ms.
Product exploration explored 100000 steps with 6034 reset in 126 ms.
Knowledge obtained : [(NOT p1), (NOT p0), p3, (NOT p2)]
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (NOT p1), (NOT p1), (OR p0 (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Product exploration explored 100000 steps with 6069 reset in 109 ms.
Product exploration explored 100000 steps with 6060 reset in 123 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (OR (NOT p1) p0 (AND p2 (NOT p3))), (NOT p1), (NOT p1), (OR p0 (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Support contains 8 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 66/66 places, 45/45 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 6 place count 66 transition count 45
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 20 place count 66 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 66 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 65 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 65 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 29 rules in 4 ms. Remains 65 /66 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:51:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 65 cols
[2021-05-12 16:51:37] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-12 16:51:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/66 places, 44/45 transitions.
Product exploration explored 100000 steps with 10888 reset in 168 ms.
Product exploration explored 100000 steps with 10863 reset in 181 ms.
[2021-05-12 16:51:37] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:51:37] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:51:37] [INFO ] Time to serialize gal into /tmp/LTL2139528627266726750.gal : 1 ms
[2021-05-12 16:51:37] [INFO ] Time to serialize properties into /tmp/LTL17973318758962701395.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/LTL2139528627266726750.gal, -t, CGAL, -LTL, /tmp/LTL17973318758962701395.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/LTL2139528627266726750.gal -t CGAL -LTL /tmp/LTL17973318758962701395.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(((G(F("((p11_0>=1)&&(p3_1>=1))")))&&(("((HowDeliver_p12_2<1)||(p6_2<1))")U(("(((HowDeliver_p12_2<1)||(p6_2<1))&&((((PayReceipt_p21_15<1)||(PaymentNote_p21_16<1))||(Status_p21_14<1))||(p3_10<1)))")||(G("((HowDeliver_p12_2<1)||(p6_2<1))")))))&&("((((PayReceipt_p21_15<1)||(PaymentNote_p21_16<1))||(Status_p21_14<1))||(p3_10<1))")))))))
Formula 0 simplified : !XXXF("((((PayReceipt_p21_15<1)||(PaymentNote_p21_16<1))||(Status_p21_14<1))||(p3_10<1))" & GF"((p11_0>=1)&&(p3_1>=1))" & ("((HowDeliver_p12_2<1)||(p6_2<1))" U ("(((HowDeliver_p12_2<1)||(p6_2<1))&&((((PayReceipt_p21_15<1)||(PaymentNote_p21_16<1))||(Status_p21_14<1))||(p3_10<1)))" | G"((HowDeliver_p12_2<1)||(p6_2<1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
0 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
121 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.23533,55232,1,0,359,231848,54,20,1588,186283,880
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C03M03P03D03-15 finished in 3530 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620838299851

--------------------
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="IOTPpurchase-PT-C03M03P03D03"
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 IOTPpurchase-PT-C03M03P03D03, 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 r121-tall-162075406900365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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