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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 60K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-15

=== Now, execution of the tool begins

BK_START 1620838545887

Running Version 0
[2021-05-12 16:55:55] [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:55:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:55:55] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-12 16:55:55] [INFO ] Transformed 111 places.
[2021-05-12 16:55:55] [INFO ] Transformed 45 transitions.
[2021-05-12 16:55:55] [INFO ] Parsed PT model containing 111 places and 45 transitions in 75 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:55:55] [INFO ] Initial state test concluded for 5 properties.
FORMULA IOTPpurchase-PT-C05M04P03D02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 88 transition count 45
Applied a total of 23 rules in 13 ms. Remains 88 /111 variables (removed 23) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 88 cols
[2021-05-12 16:55:55] [INFO ] Computed 44 place invariants in 15 ms
[2021-05-12 16:55:56] [INFO ] Implicit Places using invariants in 139 ms returned [10, 18, 23, 26, 38]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 164 ms to find 5 implicit places.
// Phase 1: matrix 45 rows 83 cols
[2021-05-12 16:55:56] [INFO ] Computed 39 place invariants in 5 ms
[2021-05-12 16:55:56] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 83/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 83 cols
[2021-05-12 16:55:56] [INFO ] Computed 39 place invariants in 1 ms
[2021-05-12 16:55:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 83/111 places, 45/45 transitions.
[2021-05-12 16:55:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-12 16:55:56] [INFO ] Flatten gal took : 25 ms
FORMULA IOTPpurchase-PT-C05M04P03D02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:55:56] [INFO ] Flatten gal took : 9 ms
[2021-05-12 16:55:56] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 137 steps, including 0 resets, run visited all 20 properties in 5 ms. (steps per millisecond=27 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U p1)) U G((X(p3)||p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 65 transition count 45
Applied a total of 18 rules in 3 ms. Remains 65 /83 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:55:56] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:55:56] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:55:56] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:55:56] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:55:56] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-12 16:55:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p2) (NOT p3)), false, (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), true, (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=5 dest: 4}, { cond=(OR p1 p0), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (LT s8 1) (LT s53 1)), p1:(OR (LT s7 1) (LT s56 1)), p0:(AND (GEQ s20 1) (GEQ s23 1)), p3:(OR (LT s8 1) (LT s53 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 33539 reset in 288 ms.
Product exploration explored 100000 steps with 33271 reset in 156 ms.
Knowledge obtained : [p2, p1, (NOT p0), p3]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p2) (NOT p3)), false, (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), true, (NOT p1)]
Product exploration explored 100000 steps with 33353 reset in 122 ms.
Product exploration explored 100000 steps with 33219 reset in 163 ms.
Applying partial POR strategy [false, false, true, false, true, false, true, true]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p2) (NOT p3)), false, (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), true, (NOT p1)]
Support contains 6 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 65/65 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 7 place count 65 transition count 45
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 20 place count 65 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 65 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 64 transition count 44
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 64 transition count 44
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 28 rules in 14 ms. Remains 64 /65 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:55:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 64 cols
[2021-05-12 16:55:58] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:55:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/65 places, 44/45 transitions.
Product exploration explored 100000 steps with 33378 reset in 131 ms.
Product exploration explored 100000 steps with 33259 reset in 150 ms.
[2021-05-12 16:55:58] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:55:58] [INFO ] Flatten gal took : 5 ms
[2021-05-12 16:55:58] [INFO ] Time to serialize gal into /tmp/LTL3372945792592561898.gal : 2 ms
[2021-05-12 16:55:58] [INFO ] Time to serialize properties into /tmp/LTL8168552375350276015.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/LTL3372945792592561898.gal, -t, CGAL, -LTL, /tmp/LTL8168552375350276015.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/LTL3372945792592561898.gal -t CGAL -LTL /tmp/LTL8168552375350276015.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(("((p1_2>=1)&&(p10_2>=1))")U("((DeliveryResponse_p12_6<1)||(p6_5<1))")))U(G(("((HowDeliver_p12_2<1)||(p6_2<1))")||(X("((HowDeliver_p12_2<1)||(p6_2<1))"))))))
Formula 0 simplified : !(X("((p1_2>=1)&&(p10_2>=1))" U "((DeliveryResponse_p12_6<1)||(p6_5<1))") U G("((HowDeliver_p12_2<1)||(p6_2<1))" | X"((HowDeliver_p12_2<1)||(p6_2<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
81 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.829397,40428,1,0,13,129090,34,1,1580,97456,35
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C05M04P03D02-00 finished in 3243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 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 64 transition count 45
Applied a total of 19 rules in 2 ms. Remains 64 /83 variables (removed 19) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:55:59] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-12 16:55:59] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:55:59] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-12 16:55:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:55:59] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-12 16:55:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s12 1) (GEQ s15 1) (GEQ s30 1) (GEQ s48 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 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-02 finished in 181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 63 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 30 place count 52 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 44 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 38 place count 44 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 63 place count 30 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 63 place count 30 transition count 16
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 27 transition count 16
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 90 place count 14 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 91 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 11 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 98 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 99 place count 8 transition count 5
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 104 place count 5 transition count 3
Applied a total of 104 rules in 10 ms. Remains 5 /83 variables (removed 78) and now considering 3/45 (removed 42) transitions.
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 16:55:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:55:59] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 16:55:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:55:59] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-12 16:55:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 16:55:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:55:59] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/83 places, 3/45 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-04 finished in 161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 62 transition count 45
Applied a total of 21 rules in 2 ms. Remains 62 /83 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:55:59] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:56:00] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:00] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:56:00] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:00] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:56:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 688 reset in 121 ms.
Product exploration explored 100000 steps with 696 reset in 193 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 687 reset in 129 ms.
Product exploration explored 100000 steps with 693 reset in 222 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 62/62 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 8 place count 62 transition count 45
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 23 place count 62 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 62 transition count 45
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 29 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2021-05-12 16:56:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:01] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:56:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 45/45 transitions.
Product exploration explored 100000 steps with 2196 reset in 219 ms.
Product exploration explored 100000 steps with 2206 reset in 192 ms.
[2021-05-12 16:56:01] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:56:01] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:56:01] [INFO ] Time to serialize gal into /tmp/LTL8205003262012071003.gal : 1 ms
[2021-05-12 16:56:01] [INFO ] Time to serialize properties into /tmp/LTL1601670544009672967.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/LTL8205003262012071003.gal, -t, CGAL, -LTL, /tmp/LTL1601670544009672967.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/LTL8205003262012071003.gal -t CGAL -LTL /tmp/LTL1601670544009672967.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p6_7>=1)"))))
Formula 0 simplified : !XF"(p6_7>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
972 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.73472,269392,1,0,1039,1.52963e+06,20,216,1398,1.71781e+06,2156
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C05M04P03D02-05 finished in 13314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 65 transition count 45
Applied a total of 18 rules in 3 ms. Remains 65 /83 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:56:13] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-12 16:56:13] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:56:13] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:56:13] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:56:13] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-12 16:56:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (GEQ s12 1) (GEQ s15 1) (GEQ s20 1) (GEQ s50 1)), p0:(LT s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1530 reset in 141 ms.
Product exploration explored 100000 steps with 1533 reset in 154 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 1535 reset in 132 ms.
Product exploration explored 100000 steps with 1536 reset in 144 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 5 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 65/65 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 9 place count 65 transition count 45
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 23 place count 65 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 65 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 64 transition count 44
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 64 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 31 rules in 8 ms. Remains 64 /65 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:56:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 64 cols
[2021-05-12 16:56:14] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:56:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/65 places, 44/45 transitions.
Product exploration explored 100000 steps with 5130 reset in 218 ms.
Product exploration explored 100000 steps with 5170 reset in 168 ms.
[2021-05-12 16:56:14] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:56:14] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:56:14] [INFO ] Time to serialize gal into /tmp/LTL16920769015443356873.gal : 3 ms
[2021-05-12 16:56:14] [INFO ] Time to serialize properties into /tmp/LTL10345635787007646222.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/LTL16920769015443356873.gal, -t, CGAL, -LTL, /tmp/LTL10345635787007646222.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/LTL16920769015443356873.gal -t CGAL -LTL /tmp/LTL10345635787007646222.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p5_4<1)")U("((((Organization_p21_8>=1)&&(Payment_p21_7>=1))&&(Status_p21_9>=1))&&(p5_1>=1))")))))
Formula 0 simplified : !XX("(p5_4<1)" U "((((Organization_p21_8>=1)&&(Payment_p21_7>=1))&&(Status_p21_9>=1))&&(p5_1>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
85 unique states visited
0 strongly connected components in search stack
84 transitions explored
85 items max in DFS search stack
85 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.863792,40452,1,0,392,144264,23,162,1481,140514,1070
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C05M04P03D02-06 finished in 2567 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(p1&&(p0 U G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 25 rules applied. Total rules applied 38 place count 51 transition count 26
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 50 place count 40 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 39 transition count 25
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 51 place count 39 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 68 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 68 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 72 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
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 90 place count 16 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 93 place count 15 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 95 place count 13 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 101 place count 9 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 102 place count 9 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 103 place count 8 transition count 4
Applied a total of 103 rules in 6 ms. Remains 8 /83 variables (removed 75) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 8 cols
[2021-05-12 16:56:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:56:15] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 8 cols
[2021-05-12 16:56:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:56:15] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-12 16:56:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 8 cols
[2021-05-12 16:56:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:56:15] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/83 places, 4/45 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8578 reset in 79 ms.
Product exploration explored 100000 steps with 8670 reset in 90 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8420 reset in 103 ms.
Product exploration explored 100000 steps with 8602 reset in 93 ms.
[2021-05-12 16:56:16] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:56:16] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:56:16] [INFO ] Time to serialize gal into /tmp/LTL16590922892380629411.gal : 1 ms
[2021-05-12 16:56:16] [INFO ] Time to serialize properties into /tmp/LTL1759618167828176806.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/LTL16590922892380629411.gal, -t, CGAL, -LTL, /tmp/LTL1759618167828176806.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/LTL16590922892380629411.gal -t CGAL -LTL /tmp/LTL1759618167828176806.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((((Organization_p21_8>=1)&&(Payment_p21_7>=1))&&(Status_p21_9>=1))&&(p5_1>=1))")))||(("(ConsumerDelivery_p6_0>=1)")&&(("((((Organization_p21_8>=1)&&(Payment_p21_7>=1))&&(Status_p21_9>=1))&&(p5_1>=1))")U(G("(ConsumerDelivery_p6_0>=1)")))))))
Formula 0 simplified : !F(GF"((((Organization_p21_8>=1)&&(Payment_p21_7>=1))&&(Status_p21_9>=1))&&(p5_1>=1))" | ("(ConsumerDelivery_p6_0>=1)" & ("((((Organization_p21_8>=1)&&(Payment_p21_7>=1))&&(Status_p21_9>=1))&&(p5_1>=1))" U G"(ConsumerDelivery_p6_0>=1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.017922,17168,1,0,43,1046,34,12,207,1368,111
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C05M04P03D02-07 finished in 626 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 63 transition count 45
Applied a total of 20 rules in 2 ms. Remains 63 /83 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:56:16] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:56:16] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:56:16] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:56:16] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:56:16] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:56:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s20 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-08 finished in 187 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0) U X((F(G(p2))&&p1))))))], workingDir=/home/mcc/execution]
Support contains 14 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 71 transition count 45
Applied a total of 12 rules in 2 ms. Remains 71 /83 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 71 cols
[2021-05-12 16:56:16] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-12 16:56:16] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 45 rows 71 cols
[2021-05-12 16:56:16] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-12 16:56:16] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 71 cols
[2021-05-12 16:56:16] [INFO ] Computed 27 place invariants in 9 ms
[2021-05-12 16:56:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s48 1)), p1:(AND (GEQ s5 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s18 1) (GEQ s24 1) (GEQ s43 1)), p2:(OR (AND (GEQ s16 1) (GEQ s21 1) (GEQ s25 1) (GEQ s33 1) (GEQ s58 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s18 1) (GEQ s24 1) (GEQ s43 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-10 finished in 317 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(G(p1)||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 62 transition count 45
Applied a total of 21 rules in 3 ms. Remains 62 /83 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:16] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:56:17] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:17] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:56:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:17] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:56:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}]], initial=2, aps=[p2:(GEQ s2 1), p1:(GEQ s38 1), p0:(OR (GEQ s2 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-11 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 62 transition count 45
Applied a total of 21 rules in 2 ms. Remains 62 /83 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:17] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:56:17] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:17] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:56:17] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:56:17] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:56:17] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-12 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:(LT s4 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 21 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-12 finished in 167 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (p1||G(p0))) U (X(p2)||F(!p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 63 transition count 45
Applied a total of 20 rules in 1 ms. Remains 63 /83 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:56:17] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:56:17] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:56:17] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:56:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:56:17] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:56:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/83 places, 45/45 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND p3 (NOT p1) (NOT p0) (NOT p2)), (AND p3 (NOT p2)), p3, (AND p3 (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-13 automaton TGBA [mat=[[{ cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p3 p1 (NOT p2)) (AND p3 p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p3, acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (LT s8 1) (LT s52 1)), p1:(AND (LT s4 1) (OR (AND (GEQ s8 1) (GEQ s52 1)) (AND (GEQ s5 1) (GEQ s6 1)))), p0:(LT s4 1), p2:(OR (LT s19 1) (LT s21 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1381 reset in 126 ms.
Product exploration explored 100000 steps with 1403 reset in 142 ms.
Knowledge obtained : [p3, (NOT p1), p0, p2]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND p3 (NOT p1) (NOT p0) (NOT p2)), (AND p3 (NOT p2)), p3, (AND p3 (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1418 reset in 126 ms.
Product exploration explored 100000 steps with 1435 reset in 140 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND p3 (NOT p1) (NOT p0) (NOT p2)), (AND p3 (NOT p2)), p3, (AND p3 (NOT p1) (NOT p0))]
Support contains 7 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 63/63 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 7 place count 63 transition count 45
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 18 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 62 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 62 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 26 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:56:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2021-05-12 16:56:22] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:56:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 44/45 transitions.
Product exploration explored 100000 steps with 3157 reset in 147 ms.
Product exploration explored 100000 steps with 3113 reset in 160 ms.
[2021-05-12 16:56:23] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:56:23] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:56:23] [INFO ] Time to serialize gal into /tmp/LTL13025903237320756632.gal : 1 ms
[2021-05-12 16:56:23] [INFO ] Time to serialize properties into /tmp/LTL18366030287327181207.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/LTL13025903237320756632.gal, -t, CGAL, -LTL, /tmp/LTL18366030287327181207.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/LTL13025903237320756632.gal -t CGAL -LTL /tmp/LTL18366030287327181207.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(ConsumerPayment_p3<1)")U((G("(ConsumerPayment_p3<1)"))||("((ConsumerPayment_p3<1)&&(((HowDeliver_p12_2>=1)&&(p6_2>=1))||((DeliveryHandlerDelivery_p8_0>=1)&&(DeliveryRequest_p12_5>=1))))")))U((X("((p1_1<1)||(p10_0<1))"))||(F("((HowDeliver_p12_2>=1)&&(p6_2>=1))")))))
Formula 0 simplified : !(("(ConsumerPayment_p3<1)" U ("((ConsumerPayment_p3<1)&&(((HowDeliver_p12_2>=1)&&(p6_2>=1))||((DeliveryHandlerDelivery_p8_0>=1)&&(DeliveryRequest_p12_5>=1))))" | G"(ConsumerPayment_p3<1)")) U (X"((p1_1<1)||(p10_0<1))" | F"((HowDeliver_p12_2>=1)&&(p6_2>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-12 16:56:38] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:56:38] [INFO ] Applying decomposition
[2021-05-12 16:56:38] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7982468943189264374.txt, -o, /tmp/graph7982468943189264374.bin, -w, /tmp/graph7982468943189264374.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7982468943189264374.bin, -l, -1, -v, -w, /tmp/graph7982468943189264374.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:56:38] [INFO ] Decomposing Gal with order
[2021-05-12 16:56:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:56:38] [INFO ] Flatten gal took : 31 ms
[2021-05-12 16:56:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:56:38] [INFO ] Time to serialize gal into /tmp/LTL8582329727339903603.gal : 6 ms
[2021-05-12 16:56:38] [INFO ] Time to serialize properties into /tmp/LTL6947548708656593842.ltl : 11 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/LTL8582329727339903603.gal, -t, CGAL, -LTL, /tmp/LTL6947548708656593842.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8582329727339903603.gal -t CGAL -LTL /tmp/LTL6947548708656593842.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((("(i6.u15.ConsumerPayment_p3<1)")U((G("(i6.u15.ConsumerPayment_p3<1)"))||("((i6.u15.ConsumerPayment_p3<1)&&(((i8.u6.HowDeliver_p12_2>=1)&&(i8.u6.p6_2>=1))||((i0.u3.DeliveryHandlerDelivery_p8_0>=1)&&(i7.u4.DeliveryRequest_p12_5>=1))))")))U((X("((i3.u14.p1_1<1)||(i3.u8.p10_0<1))"))||(F("((i8.u6.HowDeliver_p12_2>=1)&&(i8.u6.p6_2>=1))")))))
Formula 0 simplified : !(("(i6.u15.ConsumerPayment_p3<1)" U ("((i6.u15.ConsumerPayment_p3<1)&&(((i8.u6.HowDeliver_p12_2>=1)&&(i8.u6.p6_2>=1))||((i0.u3.DeliveryHandlerDelivery_p8_0>=1)&&(i7.u4.DeliveryRequest_p12_5>=1))))" | G"(i6.u15.ConsumerPayment_p3<1)")) U (X"((i3.u14.p1_1<1)||(i3.u8.p10_0<1))" | F"((i8.u6.HowDeliver_p12_2>=1)&&(i8.u6.p6_2>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
140 unique states visited
0 strongly connected components in search stack
168 transitions explored
29 items max in DFS search stack
332 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.33169,132528,1,0,258114,950,664,176260,167,7061,263701
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property IOTPpurchase-PT-C05M04P03D02-13 finished in 24615 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 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 23 rules applied. Total rules applied 36 place count 54 transition count 27
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 46 place count 44 transition count 27
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 46 place count 44 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 67 place count 32 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 67 place count 32 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 29 transition count 15
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 91 place count 18 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 17 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 92 place count 17 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 95 place count 15 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 15 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 99 place count 13 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 100 place count 12 transition count 5
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 105 place count 9 transition count 3
Applied a total of 105 rules in 5 ms. Remains 9 /83 variables (removed 74) and now considering 3/45 (removed 42) transitions.
// Phase 1: matrix 3 rows 9 cols
[2021-05-12 16:56:41] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:56:42] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 9 cols
[2021-05-12 16:56:42] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 16:56:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-12 16:56:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 9 cols
[2021-05-12 16:56:42] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:56:42] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/83 places, 3/45 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21439 reset in 76 ms.
Product exploration explored 100000 steps with 21574 reset in 86 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21252 reset in 75 ms.
Product exploration explored 100000 steps with 21306 reset in 82 ms.
[2021-05-12 16:56:42] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:56:42] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:56:42] [INFO ] Time to serialize gal into /tmp/LTL10746929038565664012.gal : 0 ms
[2021-05-12 16:56:42] [INFO ] Time to serialize properties into /tmp/LTL5936045485223493013.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/LTL10746929038565664012.gal, -t, CGAL, -LTL, /tmp/LTL5936045485223493013.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/LTL10746929038565664012.gal -t CGAL -LTL /tmp/LTL5936045485223493013.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((Delivery_p20>=1)&&(OfferResponce_p10>=1))&&(Order_p20>=1))&&(Organization_p20_2>=1))&&(Payment_p20>=1))&&(Status_p20>=1))&&(p2_2>=1))"))))
Formula 0 simplified : !GF"(((((((Delivery_p20>=1)&&(OfferResponce_p10>=1))&&(Order_p20>=1))&&(Organization_p20_2>=1))&&(Payment_p20>=1))&&(Status_p20>=1))&&(p2_2>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.01237,16288,1,0,13,298,24,1,231,236,34
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C05M04P03D02-14 finished in 555 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (!p1||G(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 65 transition count 39
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 20 rules applied. Total rules applied 31 place count 54 transition count 30
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 41 place count 45 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 44 transition count 29
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 42 place count 44 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 63 place count 32 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 63 place count 32 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 29 transition count 17
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 87 place count 18 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 89 place count 17 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 90 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 90 place count 16 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 93 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 14 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 96 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 99 place count 10 transition count 6
Applied a total of 99 rules in 5 ms. Remains 10 /83 variables (removed 73) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 10 cols
[2021-05-12 16:56:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:56:42] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2021-05-12 16:56:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:56:42] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-12 16:56:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2021-05-12 16:56:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:56:42] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/83 places, 6/45 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-15 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s0 1), p2:(AND (GEQ s6 1) (GEQ s7 1)), p0:(OR (LT s3 1) (LT s4 1) (LT s5 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Knowledge obtained : [p1, (NOT p2), p0]
Stuttering acceptance computed with spot in 97 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 79 ms.
[2021-05-12 16:56:43] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:56:43] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:56:43] [INFO ] Time to serialize gal into /tmp/LTL14234946978238270282.gal : 0 ms
[2021-05-12 16:56:43] [INFO ] Time to serialize properties into /tmp/LTL6827352165699865733.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/LTL14234946978238270282.gal, -t, CGAL, -LTL, /tmp/LTL6827352165699865733.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/LTL14234946978238270282.gal -t CGAL -LTL /tmp/LTL6827352165699865733.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((PayReceipt_p21_15<1)||(PaymentNote_p21_16<1))||(Status_p21_14<1))||(p3_10<1))"))U(("(ConsumerPayment_p3>=1)")||(G(F("((p11_0>=1)&&(p3_1>=1))"))))))
Formula 0 simplified : !(F"((((PayReceipt_p21_15<1)||(PaymentNote_p21_16<1))||(Status_p21_14<1))||(p3_10<1))" U ("(ConsumerPayment_p3>=1)" | GF"((p11_0>=1)&&(p3_1>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.013765,17284,1,0,7,477,29,2,254,292,25
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C05M04P03D02-15 finished in 711 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620838604300

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

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