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-162075406800357.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-C01M01P01D01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K 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.0K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 63K 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-C01M01P01D01-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-15

=== Now, execution of the tool begins

BK_START 1620838097069

Running Version 0
[2021-05-12 16:48:18] [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:48:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:48:18] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-12 16:48:18] [INFO ] Transformed 111 places.
[2021-05-12 16:48:18] [INFO ] Transformed 45 transitions.
[2021-05-12 16:48:18] [INFO ] Found NUPN structural information;
[2021-05-12 16:48:18] [INFO ] Parsed PT model containing 111 places and 45 transitions in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:48:18] [INFO ] Initial state test concluded for 1 properties.
FORMULA IOTPpurchase-PT-C01M01P01D01-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 22 places
Discarding 3 places :
Implicit places reduction removed 3 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:48:18] [INFO ] Computed 42 place invariants in 7 ms
[2021-05-12 16:48:18] [INFO ] Implicit Places using invariants in 128 ms returned [12, 19, 25, 43, 45, 47, 48, 49, 50, 51, 52]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 153 ms to find 11 implicit places.
// Phase 1: matrix 45 rows 75 cols
[2021-05-12 16:48:18] [INFO ] Computed 31 place invariants in 3 ms
[2021-05-12 16:48:19] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Starting structural reductions, iteration 1 : 75/111 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 75 cols
[2021-05-12 16:48:19] [INFO ] Computed 31 place invariants in 3 ms
[2021-05-12 16:48:19] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 75/111 places, 45/45 transitions.
[2021-05-12 16:48:19] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 16:48:19] [INFO ] Flatten gal took : 28 ms
FORMULA IOTPpurchase-PT-C01M01P01D01-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:48:19] [INFO ] Flatten gal took : 9 ms
[2021-05-12 16:48:19] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 42 steps, including 0 resets, run visited all 23 properties in 3 ms. (steps per millisecond=14 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 58 transition count 28
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 40 transition count 26
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 38 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 37 transition count 25
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 44 place count 37 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 54 place count 32 transition count 20
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 7 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 67 place count 25 transition count 14
Applied a total of 67 rules in 17 ms. Remains 25 /75 variables (removed 50) and now considering 14/45 (removed 31) transitions.
// Phase 1: matrix 14 rows 25 cols
[2021-05-12 16:48:19] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-12 16:48:19] [INFO ] Implicit Places using invariants in 30 ms returned [1, 4, 6, 9, 10, 11, 15]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 31 ms to find 7 implicit places.
[2021-05-12 16:48:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-12 16:48:19] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-12 16:48:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 18/75 places, 14/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 15 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 15 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 14 transition count 10
Applied a total of 8 rules in 4 ms. Remains 14 /18 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-12 16:48:19] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:48:19] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2021-05-12 16:48:19] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:48:19] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/75 places, 10/45 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-00 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s13 1)), p1:(AND (EQ s6 1) (EQ s8 1)), p0:(OR (AND (EQ s6 1) (EQ s8 1)) (AND (EQ s4 1) (EQ s9 1) (EQ s12 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 254 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-00 finished in 571 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (G(p0)&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 57 transition count 45
Applied a total of 18 rules in 2 ms. Remains 57 /75 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2021-05-12 16:48:19] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 16:48:19] [INFO ] Implicit Places using invariants in 51 ms returned [11, 14, 19, 23, 25, 26, 27]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 52 ms to find 7 implicit places.
// Phase 1: matrix 45 rows 50 cols
[2021-05-12 16:48:20] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-12 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 50/75 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 50 cols
[2021-05-12 16:48:20] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s12 1) (NEQ s29 1)), p1:(AND (EQ s14 1) (EQ s15 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 24 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-01 finished in 257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 56 transition count 45
Applied a total of 19 rules in 2 ms. Remains 56 /75 variables (removed 19) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 56 cols
[2021-05-12 16:48:20] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-12 16:48:20] [INFO ] Implicit Places using invariants in 39 ms returned [11, 19, 23, 26, 27]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 40 ms to find 5 implicit places.
// Phase 1: matrix 45 rows 51 cols
[2021-05-12 16:48:20] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 51/75 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 51 cols
[2021-05-12 16:48:20] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s13 1) (EQ s22 1) (EQ s37 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-02 finished in 242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 56 transition count 45
Applied a total of 19 rules in 3 ms. Remains 56 /75 variables (removed 19) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 56 cols
[2021-05-12 16:48:20] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-12 16:48:20] [INFO ] Implicit Places using invariants in 29 ms returned [11, 14, 19, 23, 25, 26, 27]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 31 ms to find 7 implicit places.
// Phase 1: matrix 45 rows 49 cols
[2021-05-12 16:48:20] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 49/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 49 cols
[2021-05-12 16:48:20] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-03 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 (NEQ s5 1) (NEQ s6 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 38 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-03 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (G((X(p2)||p1))||F(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 58 transition count 45
Applied a total of 17 rules in 2 ms. Remains 58 /75 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2021-05-12 16:48:20] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-12 16:48:20] [INFO ] Implicit Places using invariants in 33 ms returned [11, 14, 19, 23, 25, 26, 27]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 34 ms to find 7 implicit places.
// Phase 1: matrix 45 rows 51 cols
[2021-05-12 16:48:20] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 51/75 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 51 cols
[2021-05-12 16:48:20] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:48:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) p0 (NOT p2)), (AND (NOT p3) p0 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-04 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s8 1) (EQ s40 1)), p1:(OR (EQ s13 0) (EQ s27 0)), p0:(EQ s47 1), p2:(AND (EQ s13 1) (EQ s27 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 24945 reset in 233 ms.
Product exploration explored 100000 steps with 24961 reset in 149 ms.
Knowledge obtained : [(NOT p3), p1, (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) p0 (NOT p2)), (AND (NOT p3) p0 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 25013 reset in 93 ms.
Product exploration explored 100000 steps with 24911 reset in 106 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) p0 (NOT p2)), (AND (NOT p3) p0 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0))]
Support contains 5 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 51/51 places, 45/45 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 51 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 17 place count 51 transition count 45
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 51 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 50 transition count 45
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 44 place count 36 transition count 31
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 58 place count 36 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 36 transition count 31
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 32 transition count 27
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 32 transition count 27
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 71 rules in 9 ms. Remains 32 /51 variables (removed 19) and now considering 27/45 (removed 18) transitions.
[2021-05-12 16:48:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 32 cols
[2021-05-12 16:48:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:48:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/51 places, 27/45 transitions.
Product exploration explored 100000 steps with 24973 reset in 138 ms.
Product exploration explored 100000 steps with 25008 reset in 145 ms.
[2021-05-12 16:48:22] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:48:22] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:48:22] [INFO ] Time to serialize gal into /tmp/LTL721359728097424835.gal : 1 ms
[2021-05-12 16:48:22] [INFO ] Time to serialize properties into /tmp/LTL11268435037087555681.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/LTL721359728097424835.gal, -t, CGAL, -LTL, /tmp/LTL11268435037087555681.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/LTL721359728097424835.gal -t CGAL -LTL /tmp/LTL11268435037087555681.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("(p7_3==1)")))U((G(("((PaymentAmount_p11_6==0)||(p3_5==0))")||(X("((PaymentAmount_p11_6==1)&&(p3_5==1))"))))||(F("((HowDeliver_p12_2==1)&&(p6_2==1))")))))
Formula 0 simplified : !(XG"(p7_3==1)" U (G("((PaymentAmount_p11_6==0)||(p3_5==0))" | X"((PaymentAmount_p11_6==1)&&(p3_5==1))") | F"((HowDeliver_p12_2==1)&&(p6_2==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
108 unique states visited
0 strongly connected components in search stack
161 transitions explored
35 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.069872,19848,1,0,169,8802,56,82,1086,10789,840
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C01M01P01D01-04 finished in 2106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 59 transition count 45
Applied a total of 16 rules in 2 ms. Remains 59 /75 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 59 cols
[2021-05-12 16:48:22] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-12 16:48:22] [INFO ] Implicit Places using invariants in 29 ms returned [11, 15, 22, 26, 28, 29, 30]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 30 ms to find 7 implicit places.
// Phase 1: matrix 45 rows 52 cols
[2021-05-12 16:48:22] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-12 16:48:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 52/75 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 52 cols
[2021-05-12 16:48:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-12 16:48:22] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 52/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s2 1), p0:(AND (EQ s11 1) (EQ s14 1) (EQ s19 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3355 reset in 89 ms.
Product exploration explored 100000 steps with 3354 reset in 77 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 3353 reset in 61 ms.
Product exploration explored 100000 steps with 3353 reset in 68 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 52/52 places, 45/45 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 52 transition count 45
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 20 place count 52 transition count 45
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 52 transition count 45
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 52 place count 32 transition count 25
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 72 place count 32 transition count 25
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 32 transition count 25
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 28 transition count 21
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 28 transition count 21
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 87 rules in 6 ms. Remains 28 /52 variables (removed 24) and now considering 21/45 (removed 24) transitions.
[2021-05-12 16:48:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 28 cols
[2021-05-12 16:48:23] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-12 16:48:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/52 places, 21/45 transitions.
Product exploration explored 100000 steps with 16666 reset in 300 ms.
Product exploration explored 100000 steps with 16666 reset in 161 ms.
[2021-05-12 16:48:24] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:48:24] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:48:24] [INFO ] Time to serialize gal into /tmp/LTL2679733299022904252.gal : 2 ms
[2021-05-12 16:48:24] [INFO ] Time to serialize properties into /tmp/LTL17209913319643293969.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/LTL2679733299022904252.gal, -t, CGAL, -LTL, /tmp/LTL17209913319643293969.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/LTL2679733299022904252.gal -t CGAL -LTL /tmp/LTL17209913319643293969.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("((((Organization_p21_8==1)&&(Payment_p21_7==1))&&(Status_p21_9==1))&&(p5_1==1))"))||(F("(ConsumerDelivery_p6_0==1)"))))
Formula 0 simplified : !(X"((((Organization_p21_8==1)&&(Payment_p21_7==1))&&(Status_p21_9==1))&&(p5_1==1))" | F"(ConsumerDelivery_p6_0==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
3 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.040306,17520,1,0,114,6515,25,28,1085,4939,283
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C01M01P01D01-06 finished in 1332 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(F(p0))||(p1 U p2))) U X(G(p3))))], workingDir=/home/mcc/execution]
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 62 transition count 45
Applied a total of 13 rules in 2 ms. Remains 62 /75 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:48:24] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:48:24] [INFO ] Implicit Places using invariants in 30 ms returned [11, 16, 25, 29, 31, 32, 33]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 31 ms to find 7 implicit places.
// Phase 1: matrix 45 rows 55 cols
[2021-05-12 16:48:24] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-12 16:48:24] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 55/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 55 cols
[2021-05-12 16:48:24] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-12 16:48:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-07 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p3 (NOT p0)) (AND p1 p3 (NOT p0))), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p2:(EQ s2 1), p1:(AND (EQ s11 1) (EQ s15 1) (EQ s22 1) (EQ s40 1)), p3:(OR (NEQ s13 1) (NEQ s18 1) (NEQ s21 1) (NEQ s30 1)), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40017 reset in 183 ms.
Product exploration explored 100000 steps with 40011 reset in 144 ms.
Knowledge obtained : [(NOT p2), (NOT p1), p3, p0]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 40042 reset in 104 ms.
Product exploration explored 100000 steps with 40050 reset in 99 ms.
Applying partial POR strategy [true, false, true, true, true, true]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2))]
Support contains 10 out of 55 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 55/55 places, 45/45 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 55 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 20 place count 55 transition count 45
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 31 place count 55 transition count 45
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 52 place count 34 transition count 24
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 73 place count 34 transition count 24
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 34 transition count 24
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 31 transition count 21
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 31 transition count 21
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 85 rules in 5 ms. Remains 31 /55 variables (removed 24) and now considering 21/45 (removed 24) transitions.
[2021-05-12 16:48:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2021-05-12 16:48:25] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-12 16:48:25] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/55 places, 21/45 transitions.
Product exploration explored 100000 steps with 40038 reset in 184 ms.
Product exploration explored 100000 steps with 40006 reset in 192 ms.
[2021-05-12 16:48:25] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:48:25] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:48:25] [INFO ] Time to serialize gal into /tmp/LTL6400503496499719473.gal : 1 ms
[2021-05-12 16:48:25] [INFO ] Time to serialize properties into /tmp/LTL3463952016156925353.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/LTL6400503496499719473.gal, -t, CGAL, -LTL, /tmp/LTL3463952016156925353.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/LTL6400503496499719473.gal -t CGAL -LTL /tmp/LTL3463952016156925353.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G((X(F("(ConsumerOffer_p1==1)")))||(("((((Organization_p21_8==1)&&(Payment_p21_7==1))&&(Status_p21_9==1))&&(p5_1==1))")U("(ConsumerDelivery_p6_0==1)"))))U(X(G("((((PayReceipt_p21_15==0)||(PaymentNote_p21_16==0))||(Status_p21_14==0))||(p3_10==0))")))))
Formula 0 simplified : !(G(XF"(ConsumerOffer_p1==1)" | ("((((Organization_p21_8==1)&&(Payment_p21_7==1))&&(Status_p21_9==1))&&(p5_1==1))" U "(ConsumerDelivery_p6_0==1)")) U XG"((((PayReceipt_p21_15==0)||(PaymentNote_p21_16==0))||(Status_p21_14==0))||(p3_10==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
126 unique states visited
2 strongly connected components in search stack
181 transitions explored
48 items max in DFS search stack
61 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.623295,40628,1,0,1998,96868,85,963,1311,185637,5735
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C01M01P01D01-07 finished in 2615 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X((p1||(G(!p1) U p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 12 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 59 transition count 45
Applied a total of 16 rules in 2 ms. Remains 59 /75 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 59 cols
[2021-05-12 16:48:26] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-12 16:48:26] [INFO ] Implicit Places using invariants in 41 ms returned [12, 15, 20, 26, 28, 29, 30]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 42 ms to find 7 implicit places.
// Phase 1: matrix 45 rows 52 cols
[2021-05-12 16:48:26] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-12 16:48:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 52/75 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 52 cols
[2021-05-12 16:48:26] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-12 16:48:26] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 52/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1), false]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s23 0)), p1:(AND (EQ s10 1) (EQ s11 1)), p2:(AND (EQ s6 1) (EQ s18 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1), false]
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Product exploration explored 100000 steps with 33333 reset in 99 ms.
[2021-05-12 16:48:27] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:48:27] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:48:27] [INFO ] Time to serialize gal into /tmp/LTL17908579360328783607.gal : 1 ms
[2021-05-12 16:48:27] [INFO ] Time to serialize properties into /tmp/LTL616233079404589276.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/LTL17908579360328783607.gal, -t, CGAL, -LTL, /tmp/LTL616233079404589276.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/LTL17908579360328783607.gal -t CGAL -LTL /tmp/LTL616233079404589276.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X(("((MerchantOffer_p2==1)&&(OfferRequest_p10==1))")||((G("((MerchantOffer_p2==0)||(OfferRequest_p10==0))"))U("(((DeliveryNote_p22_14==1)&&(Status_p22_13==1))&&(p6_6==1))"))))&&("((p1_2==0)||(p10_2==0))"))))
Formula 0 simplified : !F("((p1_2==0)||(p10_2==0))" & X("((MerchantOffer_p2==1)&&(OfferRequest_p10==1))" | (G"((MerchantOffer_p2==0)||(OfferRequest_p10==0))" U "(((DeliveryNote_p22_14==1)&&(Status_p22_13==1))&&(p6_6==1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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.031295,18628,1,0,8,3497,40,2,1115,1035,28
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C01M01P01D01-08 finished in 989 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((F(G(p0)) U (p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 62 transition count 45
Applied a total of 13 rules in 2 ms. Remains 62 /75 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:48:27] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:48:27] [INFO ] Implicit Places using invariants in 62 ms returned [17, 24, 30, 31, 32]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
// Phase 1: matrix 45 rows 57 cols
[2021-05-12 16:48:27] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 16:48:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 57/75 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2021-05-12 16:48:27] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 16:48:27] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2 1), p1:(AND (EQ s5 1) (EQ s12 1) (EQ s13 1) (EQ s14 1) (EQ s17 1) (EQ s22 1) (EQ s29 1)), p0:(AND (OR (NEQ s18 1) (NEQ s34 1)) (OR (NEQ s24 1) (NEQ s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-10 finished in 384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 56 transition count 45
Applied a total of 19 rules in 1 ms. Remains 56 /75 variables (removed 19) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 56 cols
[2021-05-12 16:48:28] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-12 16:48:28] [INFO ] Implicit Places using invariants in 21 ms returned [11, 19, 23, 26, 27]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 22 ms to find 5 implicit places.
// Phase 1: matrix 45 rows 51 cols
[2021-05-12 16:48:28] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:48:28] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 51/75 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 51 cols
[2021-05-12 16:48:28] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:48:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s13 1) (EQ s22 1) (EQ s37 1)), p0:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4166 reset in 63 ms.
Product exploration explored 100000 steps with 4166 reset in 70 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4166 reset in 64 ms.
Product exploration explored 100000 steps with 4166 reset in 71 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 51/51 places, 45/45 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 51 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 19 place count 51 transition count 45
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 51 transition count 45
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 50 place count 31 transition count 25
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 70 place count 31 transition count 25
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 31 transition count 25
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 29 transition count 23
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 29 transition count 23
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 80 rules in 5 ms. Remains 29 /51 variables (removed 22) and now considering 23/45 (removed 22) transitions.
[2021-05-12 16:48:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-12 16:48:28] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:48:28] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/51 places, 23/45 transitions.
Product exploration explored 100000 steps with 14285 reset in 109 ms.
Product exploration explored 100000 steps with 14285 reset in 115 ms.
[2021-05-12 16:48:29] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:48:29] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:48:29] [INFO ] Time to serialize gal into /tmp/LTL5353925288668655174.gal : 1 ms
[2021-05-12 16:48:29] [INFO ] Time to serialize properties into /tmp/LTL9289676313270804963.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/LTL5353925288668655174.gal, -t, CGAL, -LTL, /tmp/LTL9289676313270804963.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/LTL5353925288668655174.gal -t CGAL -LTL /tmp/LTL9289676313270804963.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("(p3_3==1)")))||(F("(((PaySchemeData_p21_10==1)&&(p11_11==1))&&(p5_2==1))"))))
Formula 0 simplified : !(XG"(p3_3==1)" | F"(((PaySchemeData_p21_10==1)&&(p11_11==1))&&(p5_2==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
3 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.035016,17488,1,0,88,5238,30,22,1066,3733,226
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C01M01P01D01-11 finished in 1063 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0)&&F((p1&&F(!p2))))||X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 57 transition count 45
Applied a total of 18 rules in 1 ms. Remains 57 /75 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2021-05-12 16:48:29] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 16:48:29] [INFO ] Implicit Places using invariants in 34 ms returned [11, 14, 19, 23, 25, 26, 27]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 35 ms to find 7 implicit places.
// Phase 1: matrix 45 rows 50 cols
[2021-05-12 16:48:29] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:48:29] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 50/75 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 50 cols
[2021-05-12 16:48:29] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:48:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, p2, (OR (NOT p1) p2)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s4 1), p2:(AND (EQ s8 1) (EQ s39 1)), p0:(AND (NEQ s4 1) (OR (NEQ s5 1) (NEQ s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Knowledge obtained : [p1, (NOT p2), p0]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, p2, (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, p2, (OR (NOT p1) p2)]
Support contains 5 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 50/50 places, 45/45 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 50 transition count 45
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 19 place count 50 transition count 45
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 50 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 49 transition count 45
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 45 place count 34 transition count 30
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 60 place count 34 transition count 30
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 34 transition count 30
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 30 transition count 26
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 30 transition count 26
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 73 rules in 4 ms. Remains 30 /50 variables (removed 20) and now considering 26/45 (removed 19) transitions.
[2021-05-12 16:48:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 30 cols
[2021-05-12 16:48:30] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:48:30] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/50 places, 26/45 transitions.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
[2021-05-12 16:48:30] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:48:30] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:48:30] [INFO ] Time to serialize gal into /tmp/LTL792993849834068546.gal : 1 ms
[2021-05-12 16:48:30] [INFO ] Time to serialize properties into /tmp/LTL14262663147755999473.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/LTL792993849834068546.gal, -t, CGAL, -LTL, /tmp/LTL14262663147755999473.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/LTL792993849834068546.gal -t CGAL -LTL /tmp/LTL14262663147755999473.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("((ConsumerPayment_p3==0)&&((DeliveryHandlerDelivery_p8_0==0)||(DeliveryRequest_p12_5==0)))")))||((X("((ConsumerPayment_p3==0)&&((DeliveryHandlerDelivery_p8_0==0)||(DeliveryRequest_p12_5==0)))"))&&(F(("(ConsumerPayment_p3==0)")&&(F("((HowDeliver_p12_2==0)||(p6_2==0))")))))))
Formula 0 simplified : !(XG"((ConsumerPayment_p3==0)&&((DeliveryHandlerDelivery_p8_0==0)||(DeliveryRequest_p12_5==0)))" | (X"((ConsumerPayment_p3==0)&&((DeliveryHandlerDelivery_p8_0==0)||(DeliveryRequest_p12_5==0)))" & F("(ConsumerPayment_p3==0)" & F"((HowDeliver_p12_2==0)||(p6_2==0))")))
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
2 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.026983,18116,1,0,6,2887,22,0,1046,794,11
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C01M01P01D01-13 finished in 1685 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 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 61 transition count 24
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 39 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 37 transition count 22
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 52 place count 37 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 64 place count 30 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 30 transition count 15
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 68 place count 28 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
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 86 place count 17 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 17 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 16 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 5 with 2 rules applied. Total rules applied 90 place count 15 transition count 6
Applied a total of 90 rules in 7 ms. Remains 15 /75 variables (removed 60) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 15 cols
[2021-05-12 16:48:30] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 16:48:30] [INFO ] Implicit Places using invariants in 15 ms returned [2, 4, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 17 ms to find 3 implicit places.
[2021-05-12 16:48:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 12 cols
[2021-05-12 16:48:30] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:48:30] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 12/75 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 3
Applied a total of 6 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 9 cols
[2021-05-12 16:48:30] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:48:30] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 3 rows 9 cols
[2021-05-12 16:48:30] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:48:30] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/75 places, 3/45 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-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 (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ 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 24899 reset in 68 ms.
Product exploration explored 100000 steps with 24959 reset in 77 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24843 reset in 66 ms.
Product exploration explored 100000 steps with 24953 reset in 76 ms.
[2021-05-12 16:48:31] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:48:31] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:48:31] [INFO ] Time to serialize gal into /tmp/LTL10164438329018034435.gal : 1 ms
[2021-05-12 16:48:31] [INFO ] Time to serialize properties into /tmp/LTL8278567956611103488.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/LTL10164438329018034435.gal, -t, CGAL, -LTL, /tmp/LTL8278567956611103488.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/LTL10164438329018034435.gal -t CGAL -LTL /tmp/LTL8278567956611103488.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
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.009974,16316,1,0,8,96,24,1,217,69,24
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C01M01P01D01-14 finished in 530 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 59 transition count 27
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 44 place count 40 transition count 25
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 38 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 37 transition count 24
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 48 place count 37 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 62 place count 29 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 29 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 27 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 84 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 84 place count 16 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 15 transition count 8
Applied a total of 86 rules in 4 ms. Remains 15 /75 variables (removed 60) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 15 cols
[2021-05-12 16:48:31] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-12 16:48:31] [INFO ] Implicit Places using invariants in 14 ms returned [2, 4, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 15 ms to find 3 implicit places.
[2021-05-12 16:48:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-12 16:48:31] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:48:31] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 12/75 places, 8/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 6
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 10 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 9 transition count 5
Applied a total of 6 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 9 cols
[2021-05-12 16:48:31] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:48:31] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 5 rows 9 cols
[2021-05-12 16:48:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:48:31] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/75 places, 5/45 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s6 1)) (AND (EQ s5 1) (EQ 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 24973 reset in 62 ms.
Product exploration explored 100000 steps with 25021 reset in 71 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24966 reset in 62 ms.
Product exploration explored 100000 steps with 25023 reset in 70 ms.
[2021-05-12 16:48:31] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:48:31] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:48:31] [INFO ] Time to serialize gal into /tmp/LTL13470207135708421068.gal : 0 ms
[2021-05-12 16:48:31] [INFO ] Time to serialize properties into /tmp/LTL7254256314461146092.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/LTL13470207135708421068.gal, -t, CGAL, -LTL, /tmp/LTL7254256314461146092.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/LTL13470207135708421068.gal -t CGAL -LTL /tmp/LTL7254256314461146092.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((PayReceipt_p21_15==1)&&(PaymentNote_p21_16==1))&&(Status_p21_14==1))&&(p3_10==1))||((p11_3==1)&&(p4_2==1)))"))))
Formula 0 simplified : !GF"(((((PayReceipt_p21_15==1)&&(PaymentNote_p21_16==1))&&(Status_p21_14==1))&&(p3_10==1))||((p11_3==1)&&(p4_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
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.009918,16348,1,0,9,161,24,1,215,92,24
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C01M01P01D01-15 finished in 515 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620838112913

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

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