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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K 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 3.6K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 3.7K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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-C12M10P15D17-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-15

=== Now, execution of the tool begins

BK_START 1620838676184

Running Version 0
[2021-05-12 16:57:57] [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:57:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:57:57] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2021-05-12 16:57:57] [INFO ] Transformed 111 places.
[2021-05-12 16:57:57] [INFO ] Transformed 45 transitions.
[2021-05-12 16:57:57] [INFO ] Parsed PT model containing 111 places and 45 transitions in 75 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:57:57] [INFO ] Initial state test concluded for 1 properties.
FORMULA IOTPpurchase-PT-C12M10P15D17-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 23 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 84 transition count 45
Applied a total of 27 rules in 13 ms. Remains 84 /111 variables (removed 27) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 84 cols
[2021-05-12 16:57:58] [INFO ] Computed 40 place invariants in 15 ms
[2021-05-12 16:57:58] [INFO ] Implicit Places using invariants in 121 ms returned [12, 19, 24, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 146 ms to find 4 implicit places.
// Phase 1: matrix 45 rows 80 cols
[2021-05-12 16:57:58] [INFO ] Computed 36 place invariants in 4 ms
[2021-05-12 16:57:58] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 80/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 80 cols
[2021-05-12 16:57:58] [INFO ] Computed 36 place invariants in 2 ms
[2021-05-12 16:57:58] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/111 places, 45/45 transitions.
[2021-05-12 16:57:58] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 16:57:58] [INFO ] Flatten gal took : 25 ms
FORMULA IOTPpurchase-PT-C12M10P15D17-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:57:58] [INFO ] Flatten gal took : 8 ms
[2021-05-12 16:57:58] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 217 steps, including 0 resets, run visited all 18 properties in 5 ms. (steps per millisecond=43 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 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 12 rules applied. Total rules applied 12 place count 63 transition count 37
Reduce places removed 13 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 22 rules applied. Total rules applied 34 place count 50 transition count 28
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 44 place count 41 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 40 transition count 27
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 45 place count 40 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 67 place count 27 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 67 place count 27 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 71 place count 25 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 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 88 place count 15 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 14 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 89 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 92 place count 12 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 96 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 98 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 99 place count 8 transition count 5
Applied a total of 99 rules in 19 ms. Remains 8 /80 variables (removed 72) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 16:57:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:57:58] [INFO ] Implicit Places using invariants in 14 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
[2021-05-12 16:57:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 16:57:58] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 16:57:58] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 6/80 places, 5/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 3
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 2 with 3 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 1 ms. Remains 2 /6 variables (removed 4) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 16:57:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:57:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 16:57:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:57:58] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/80 places, 2/45 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 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 182 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-00 finished in 423 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0)) U (p1||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 64 transition count 45
Applied a total of 16 rules in 3 ms. Remains 64 /80 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:57:59] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-12 16:57:59] [INFO ] Implicit Places using invariants in 32 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:57:59] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:57:59] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 63/80 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:57:59] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 16:57:59] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s52 1)), p0:(GEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2176 reset in 185 ms.
Product exploration explored 100000 steps with 2187 reset in 199 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 2152 reset in 146 ms.
Product exploration explored 100000 steps with 2143 reset in 174 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 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 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 7 place count 63 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 22 place count 63 transition count 45
Performed 7 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 7 rules applied. Total rules applied 29 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 31 rules in 11 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:58:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2021-05-12 16:58:00] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:58:00] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 44/45 transitions.
Product exploration explored 100000 steps with 8039 reset in 273 ms.
Product exploration explored 100000 steps with 8012 reset in 201 ms.
[2021-05-12 16:58:00] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:58:00] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:58:00] [INFO ] Time to serialize gal into /tmp/LTL7169575467768374605.gal : 1 ms
[2021-05-12 16:58:00] [INFO ] Time to serialize properties into /tmp/LTL11997089344279219309.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/LTL7169575467768374605.gal, -t, CGAL, -LTL, /tmp/LTL11997089344279219309.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/LTL7169575467768374605.gal -t CGAL -LTL /tmp/LTL11997089344279219309.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(p3_3>=1)")))U((X(G("((HowDeliver_p12_2>=1)&&(p6_2>=1))")))||("((HowDeliver_p12_2>=1)&&(p6_2>=1))"))))
Formula 0 simplified : !(XF"(p3_3>=1)" U ("((HowDeliver_p12_2>=1)&&(p6_2>=1))" | XG"((HowDeliver_p12_2>=1)&&(p6_2>=1))"))
Detected timeout of ITS tools.
[2021-05-12 16:58:15] [INFO ] Flatten gal took : 14 ms
[2021-05-12 16:58:15] [INFO ] Applying decomposition
[2021-05-12 16:58:15] [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/graph9533544185822645094.txt, -o, /tmp/graph9533544185822645094.bin, -w, /tmp/graph9533544185822645094.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/graph9533544185822645094.bin, -l, -1, -v, -w, /tmp/graph9533544185822645094.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:58:15] [INFO ] Decomposing Gal with order
[2021-05-12 16:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:58:16] [INFO ] Flatten gal took : 41 ms
[2021-05-12 16:58:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:58:16] [INFO ] Time to serialize gal into /tmp/LTL13399786687475532813.gal : 2 ms
[2021-05-12 16:58:16] [INFO ] Time to serialize properties into /tmp/LTL12494147343690191531.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/LTL13399786687475532813.gal, -t, CGAL, -LTL, /tmp/LTL12494147343690191531.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/LTL13399786687475532813.gal -t CGAL -LTL /tmp/LTL12494147343690191531.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i6.i1.u18.p3_3>=1)")))U((X(G("((i4.u15.HowDeliver_p12_2>=1)&&(i4.u15.p6_2>=1))")))||("((i4.u15.HowDeliver_p12_2>=1)&&(i4.u15.p6_2>=1))"))))
Formula 0 simplified : !(XF"(i6.i1.u18.p3_3>=1)" U ("((i4.u15.HowDeliver_p12_2>=1)&&(i4.u15.p6_2>=1))" | XG"((i4.u15.HowDeliver_p12_2>=1)&&(i4.u15.p6_2>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5469921374577062592
[2021-05-12 16:58:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5469921374577062592
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5469921374577062592]
Compilation finished in 283 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5469921374577062592]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(<>((LTLAPp0==true))) U (X([]((LTLAPp1==true)))||(LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5469921374577062592]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property IOTPpurchase-PT-C12M10P15D17-01 finished in 47083 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 63 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 48 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 52 place count 36 transition count 24
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 52 place count 36 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 66 place count 28 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 28 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 27 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 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 85 place count 17 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 16 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 16 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 89 place count 14 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 14 transition count 8
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 93 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 97 place count 9 transition count 6
Applied a total of 97 rules in 7 ms. Remains 9 /80 variables (removed 71) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 16:58:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants in 10 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10 ms to find 2 implicit places.
[2021-05-12 16:58:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 16:58:46] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 7/80 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4 transition count 3
Applied a total of 6 rules in 1 ms. Remains 4 /7 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 16:58:46] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 16:58:46] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/80 places, 3/45 transitions.
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-02 finished in 109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 66 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 51 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 52 place count 39 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 52 place count 39 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 71 place count 28 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 28 transition count 14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 26 transition count 14
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 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 92 place count 16 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 15 transition count 6
Applied a total of 94 rules in 5 ms. Remains 15 /80 variables (removed 65) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 15 cols
[2021-05-12 16:58:46] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants in 15 ms returned [1, 4, 8, 10]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 15 ms to find 4 implicit places.
[2021-05-12 16:58:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 11 cols
[2021-05-12 16:58:46] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-12 16:58:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 11/80 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 7 transition count 3
Applied a total of 7 rules in 1 ms. Remains 7 /11 variables (removed 4) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 7 cols
[2021-05-12 16:58:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 3 rows 7 cols
[2021-05-12 16:58:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/80 places, 3/45 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-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 s2 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 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 121 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-04 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 3 places :
Implicit places reduction removed 3 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 10 rules applied. Total rules applied 10 place count 64 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 29 place count 53 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 45 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 37 place count 45 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 60 place count 32 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 32 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 30 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 84 place count 18 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 17 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 85 place count 17 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 88 place count 15 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 15 transition count 8
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 92 place count 13 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 93 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 95 place count 11 transition count 6
Applied a total of 95 rules in 16 ms. Remains 11 /80 variables (removed 69) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2021-05-12 16:58:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants in 12 ms returned [2, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
[2021-05-12 16:58:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 16:58:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 9/80 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 5 transition count 3
Applied a total of 7 rules in 1 ms. Remains 5 /9 variables (removed 4) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 16:58:46] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 16:58:46] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/80 places, 3/45 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24886 reset in 86 ms.
Product exploration explored 100000 steps with 24950 reset in 108 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25053 reset in 74 ms.
Product exploration explored 100000 steps with 25034 reset in 70 ms.
[2021-05-12 16:58:46] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:58:46] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:58:46] [INFO ] Time to serialize gal into /tmp/LTL17983860252917569859.gal : 1 ms
[2021-05-12 16:58:46] [INFO ] Time to serialize properties into /tmp/LTL6372860579921780399.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/LTL17983860252917569859.gal, -t, CGAL, -LTL, /tmp/LTL6372860579921780399.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/LTL17983860252917569859.gal -t CGAL -LTL /tmp/LTL6372860579921780399.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((BrandList_p11_2>=1)&&(p3_2>=1))")))
Formula 0 simplified : !F"((BrandList_p11_2>=1)&&(p3_2>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.011092,15336,1,0,55,372,20,12,135,336,113
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C12M10P15D17-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C12M10P15D17-05 finished in 533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 63 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 48 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 52 place count 36 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 52 place count 36 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 71 place count 25 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 25 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 23 transition count 14
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 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 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 12 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
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 8 transition count 5
Applied a total of 99 rules in 13 ms. Remains 8 /80 variables (removed 72) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 16:58:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants in 10 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
[2021-05-12 16:58:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 16:58:46] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 6/80 places, 5/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 0 ms. Remains 2 /6 variables (removed 4) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 16:58:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:58:46] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 16:58:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:58:47] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/80 places, 2/45 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
[2021-05-12 16:58:47] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:58:47] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:58:47] [INFO ] Time to serialize gal into /tmp/LTL10923800043344269168.gal : 1 ms
[2021-05-12 16:58:47] [INFO ] Time to serialize properties into /tmp/LTL4714620163881452068.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/LTL10923800043344269168.gal, -t, CGAL, -LTL, /tmp/LTL4714620163881452068.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/LTL10923800043344269168.gal -t CGAL -LTL /tmp/LTL4714620163881452068.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(p5_4>=1)")))
Formula 0 simplified : !F"(p5_4>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.009064,15464,1,0,7,110,20,2,70,75,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C12M10P15D17-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C12M10P15D17-06 finished in 398 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 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 12 rules applied. Total rules applied 12 place count 63 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 26 rules applied. Total rules applied 38 place count 49 transition count 25
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 50 place count 37 transition count 25
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 50 place count 37 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 67 place count 27 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 67 place count 27 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 25 transition count 16
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 86 place count 16 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 15 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 15 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 13 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 13 transition count 8
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 94 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 97 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 98 place count 8 transition count 6
Applied a total of 98 rules in 4 ms. Remains 8 /80 variables (removed 72) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-12 16:58:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:58:47] [INFO ] Implicit Places using invariants in 10 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
[2021-05-12 16:58:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-12 16:58:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:58:47] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 6/80 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 4
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 3 transition count 3
Applied a total of 6 rules in 1 ms. Remains 3 /6 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 16:58:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:58:47] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 16:58:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:58:47] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/80 places, 3/45 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s0 1) (LT s2 1)), p0:(LT 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 220 reset in 74 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-07 finished in 178 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p0 U (X(X(p1))||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 63 transition count 45
Applied a total of 17 rules in 3 ms. Remains 63 /80 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:58:47] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:58:47] [INFO ] Implicit Places using invariants in 26 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:58:47] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:58:47] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 62/80 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:58:47] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:58:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null][false]]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 312 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 0 reset in 264 ms.
Applying partial POR strategy [true]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Support contains 2 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 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 62 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 62 transition count 45
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 14 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 61 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 31 rules in 7 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:58:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2021-05-12 16:58:48] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:58:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 0 reset in 188 ms.
Stack based approach found an accepted trace after 480 steps with 0 reset with depth 481 and stack size 481 in 3 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-08 finished in 1489 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 64 transition count 45
Applied a total of 16 rules in 3 ms. Remains 64 /80 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:58:49] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-12 16:58:49] [INFO ] Implicit Places using invariants in 35 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:58:49] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:58:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 63/80 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:58:49] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:58:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s44 1) (AND (GEQ s20 1) (GEQ s23 1))), p0:(OR (LT s20 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8313 reset in 116 ms.
Product exploration explored 100000 steps with 8363 reset in 129 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8270 reset in 111 ms.
Product exploration explored 100000 steps with 8315 reset in 126 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 3 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 63/63 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 7 place count 63 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 63 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 6 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:58:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2021-05-12 16:58:49] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:58:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 44/45 transitions.
Product exploration explored 100000 steps with 14848 reset in 188 ms.
Product exploration explored 100000 steps with 14879 reset in 195 ms.
[2021-05-12 16:58:50] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:58:50] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:58:50] [INFO ] Time to serialize gal into /tmp/LTL13077628911172418111.gal : 0 ms
[2021-05-12 16:58:50] [INFO ] Time to serialize properties into /tmp/LTL3261549322404227133.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/LTL13077628911172418111.gal, -t, CGAL, -LTL, /tmp/LTL3261549322404227133.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/LTL13077628911172418111.gal -t CGAL -LTL /tmp/LTL3261549322404227133.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("((p4_1>=1)||((p1_2>=1)&&(p10_2>=1)))")))&&("((p1_2<1)||(p10_2<1))")))))
Formula 0 simplified : !XF("((p1_2<1)||(p10_2<1))" & XF"((p4_1>=1)||((p1_2>=1)&&(p10_2>=1)))")
Detected timeout of ITS tools.
[2021-05-12 16:59:05] [INFO ] Flatten gal took : 17 ms
[2021-05-12 16:59:05] [INFO ] Applying decomposition
[2021-05-12 16:59:05] [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/graph1384869814262046428.txt, -o, /tmp/graph1384869814262046428.bin, -w, /tmp/graph1384869814262046428.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/graph1384869814262046428.bin, -l, -1, -v, -w, /tmp/graph1384869814262046428.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:59:05] [INFO ] Decomposing Gal with order
[2021-05-12 16:59:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:59:05] [INFO ] Flatten gal took : 17 ms
[2021-05-12 16:59:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:59:05] [INFO ] Time to serialize gal into /tmp/LTL6192752678210979204.gal : 14 ms
[2021-05-12 16:59:05] [INFO ] Time to serialize properties into /tmp/LTL18420502942458482667.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/LTL6192752678210979204.gal, -t, CGAL, -LTL, /tmp/LTL18420502942458482667.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/LTL6192752678210979204.gal -t CGAL -LTL /tmp/LTL18420502942458482667.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("((i0.u19.p4_1>=1)||((i6.u5.p1_2>=1)&&(i6.u9.p10_2>=1)))")))&&("((i6.u5.p1_2<1)||(i6.u9.p10_2<1))")))))
Formula 0 simplified : !XF("((i6.u5.p1_2<1)||(i6.u9.p10_2<1))" & XF"((i0.u19.p4_1>=1)||((i6.u5.p1_2>=1)&&(i6.u9.p10_2>=1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
50 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.520706,29324,1,0,29128,2787,549,44893,191,15184,16428
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C12M10P15D17-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C12M10P15D17-09 finished in 17068 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 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 9 rules applied. Total rules applied 9 place count 69 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 24 place count 60 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 54 transition count 33
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 54 transition count 23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 53 place count 41 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 53 place count 41 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 39 transition count 21
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 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 77 place count 27 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 26 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 26 transition count 12
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 81 place count 24 transition count 12
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 82 place count 24 transition count 11
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 85 place count 22 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 86 place count 21 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 88 place count 20 transition count 9
Applied a total of 88 rules in 5 ms. Remains 20 /80 variables (removed 60) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 20 cols
[2021-05-12 16:59:06] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-12 16:59:06] [INFO ] Implicit Places using invariants in 15 ms returned [2, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
[2021-05-12 16:59:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 18 cols
[2021-05-12 16:59:06] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 16:59:06] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 18/80 places, 9/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 16 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 14 transition count 6
Applied a total of 7 rules in 1 ms. Remains 14 /18 variables (removed 4) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 14 cols
[2021-05-12 16:59:06] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-12 16:59:06] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 14 cols
[2021-05-12 16:59:06] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-12 16:59:06] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/80 places, 6/45 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s7 1) (LT s11 1)) (OR (LT s6 1) (LT s12 1))), p0:(OR (LT s6 1) (LT s12 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 5030 reset in 157 ms.
Stack based approach found an accepted trace after 787 steps with 41 reset with depth 14 and stack size 14 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-10 finished in 275 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 64 transition count 45
Applied a total of 16 rules in 1 ms. Remains 64 /80 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2021-05-12 16:59:06] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-12 16:59:06] [INFO ] Implicit Places using invariants in 25 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:59:06] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-12 16:59:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 63/80 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:59:06] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:59:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/80 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-C12M10P15D17-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:(AND (GEQ s8 1) (GEQ s52 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-C12M10P15D17-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-12 finished in 159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 63 transition count 39
Reduce places removed 11 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 21 rules applied. Total rules applied 31 place count 52 transition count 29
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 41 place count 42 transition count 29
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 41 place count 42 transition count 20
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 62 place count 30 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 62 place count 30 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 28 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 81 place count 19 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 18 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 18 transition count 11
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 85 place count 16 transition count 11
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 86 place count 16 transition count 10
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 89 place count 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 90 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 92 place count 12 transition count 8
Applied a total of 92 rules in 3 ms. Remains 12 /80 variables (removed 68) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-12 16:59:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:59:06] [INFO ] Implicit Places using invariants in 11 ms returned [1, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
[2021-05-12 16:59:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 16:59:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:59:06] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 10/80 places, 8/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 0 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 16:59:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:59:06] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 16:59:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:59:06] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/80 places, 5/45 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s6 1) (OR (LT s3 1) (LT s4 1))), p0:(GEQ s6 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 11128 reset in 97 ms.
Product exploration explored 100000 steps with 11081 reset in 116 ms.
Knowledge obtained : [(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 11109 reset in 74 ms.
Product exploration explored 100000 steps with 11187 reset in 87 ms.
[2021-05-12 16:59:07] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:59:07] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:59:07] [INFO ] Time to serialize gal into /tmp/LTL14357888730379697838.gal : 1 ms
[2021-05-12 16:59:07] [INFO ] Time to serialize properties into /tmp/LTL8556330831570584102.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/LTL14357888730379697838.gal, -t, CGAL, -LTL, /tmp/LTL8556330831570584102.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/LTL14357888730379697838.gal -t CGAL -LTL /tmp/LTL8556330831570584102.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p6_7>=1)")||(("((p11_0<1)||(p3_1<1))")U("((p6_7>=1)&&((p11_0<1)||(p3_1<1)))"))))))
Formula 0 simplified : !GF("(p6_7>=1)" | ("((p11_0<1)||(p3_1<1))" U "((p6_7>=1)&&((p11_0<1)||(p3_1<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.022178,16932,1,0,79,2195,28,1,213,1956,199
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C12M10P15D17-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IOTPpurchase-PT-C12M10P15D17-14 finished in 638 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 3 places :
Implicit places reduction removed 3 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 11 rules applied. Total rules applied 11 place count 64 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 34 place count 51 transition count 27
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 44 place count 41 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 44 place count 41 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 65 place count 29 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 65 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 3 with 4 rules applied. Total rules applied 69 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 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 86 place count 17 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 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 4 with 3 rules applied. Total rules applied 90 place count 14 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 14 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 12 transition count 7
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 12 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 11 transition count 6
Applied a total of 95 rules in 3 ms. Remains 11 /80 variables (removed 69) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2021-05-12 16:59:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:59:07] [INFO ] Implicit Places using invariants in 25 ms returned [1, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
[2021-05-12 16:59:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 16:59:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:59:07] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 9/80 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 3
Applied a total of 6 rules in 0 ms. Remains 6 /9 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 6 cols
[2021-05-12 16:59:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:59:07] [INFO ] Implicit Places using invariants in 15 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 5/80 places, 3/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2021-05-12 16:59:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 16:59:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:59:07] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 3 iterations. Remains : 5/80 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-C12M10P15D17-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s3 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 20075 reset in 63 ms.
Product exploration explored 100000 steps with 19999 reset in 74 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20130 reset in 60 ms.
Product exploration explored 100000 steps with 20015 reset in 69 ms.
[2021-05-12 16:59:07] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:59:07] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:59:07] [INFO ] Time to serialize gal into /tmp/LTL6010995784392740879.gal : 0 ms
[2021-05-12 16:59:07] [INFO ] Time to serialize properties into /tmp/LTL6024217576518144199.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/LTL6010995784392740879.gal, -t, CGAL, -LTL, /tmp/LTL6024217576518144199.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/LTL6010995784392740879.gal -t CGAL -LTL /tmp/LTL6024217576518144199.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((HowDeliver_p12_2>=1)&&(p6_2>=1))"))))
Formula 0 simplified : !GF"((HowDeliver_p12_2>=1)&&(p6_2>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.009784,16380,1,0,27,277,24,1,139,181,69
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C12M10P15D17-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C12M10P15D17-15 finished in 503 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12273798229872388265
[2021-05-12 16:59:07] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2021-05-12 16:59:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:59:07] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2021-05-12 16:59:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:59:07] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2021-05-12 16:59:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:59:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12273798229872388265
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12273798229872388265]
[2021-05-12 16:59:07] [INFO ] Applying decomposition
[2021-05-12 16:59:07] [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/graph782385984126383167.txt, -o, /tmp/graph782385984126383167.bin, -w, /tmp/graph782385984126383167.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/graph782385984126383167.bin, -l, -1, -v, -w, /tmp/graph782385984126383167.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:59:07] [INFO ] Decomposing Gal with order
[2021-05-12 16:59:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:59:07] [INFO ] Flatten gal took : 9 ms
[2021-05-12 16:59:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:59:07] [INFO ] Time to serialize gal into /tmp/LTLFireability2432440943001889434.gal : 1 ms
[2021-05-12 16:59:07] [INFO ] Time to serialize properties into /tmp/LTLFireability16821469646357559545.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/LTLFireability2432440943001889434.gal, -t, CGAL, -LTL, /tmp/LTLFireability16821469646357559545.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/LTLFireability2432440943001889434.gal -t CGAL -LTL /tmp/LTLFireability16821469646357559545.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i4.u15.p3_3>=1)")))U(("((i1.u3.HowDeliver_p12_2>=1)&&(i1.u3.p6_2>=1))")||(X(G("((i1.u3.HowDeliver_p12_2>=1)&&(i1.u3.p6_2>=1))"))))))
Formula 0 simplified : !(XF"(i4.u15.p3_3>=1)" U ("((i1.u3.HowDeliver_p12_2>=1)&&(i1.u3.p6_2>=1))" | XG"((i1.u3.HowDeliver_p12_2>=1)&&(i1.u3.p6_2>=1))"))
Compilation finished in 273 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12273798229872388265]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(<>((LTLAPp0==true))) U ((LTLAPp1==true)||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12273798229872388265]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: (X(<>((LTLAPp0==true))) U ((LTLAPp1==true)||X([]((LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: "(X(<>((LTLAPp0==true))) U ((LTLAPp1==true)||X([]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.536: DFS-FIFO for weak LTL, using special progress label 48
pins2lts-mc-linux64( 0/ 8), 0.536: There are 49 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.536: State length is 81, there are 55 groups
pins2lts-mc-linux64( 0/ 8), 0.536: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.536: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.536: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.536: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.655: ~120 levels ~960 states ~4864 transitions
pins2lts-mc-linux64( 2/ 8), 0.658: ~230 levels ~1920 states ~10784 transitions
pins2lts-mc-linux64( 0/ 8), 0.662: ~296 levels ~3840 states ~16144 transitions
pins2lts-mc-linux64( 0/ 8), 0.665: ~296 levels ~7680 states ~23696 transitions
pins2lts-mc-linux64( 0/ 8), 0.685: ~296 levels ~15360 states ~39216 transitions
pins2lts-mc-linux64( 3/ 8), 0.710: ~337 levels ~30720 states ~86520 transitions
pins2lts-mc-linux64( 3/ 8), 0.770: ~337 levels ~61440 states ~166056 transitions
pins2lts-mc-linux64( 3/ 8), 0.906: ~337 levels ~122880 states ~345496 transitions
pins2lts-mc-linux64( 3/ 8), 1.185: ~337 levels ~245760 states ~728304 transitions
pins2lts-mc-linux64( 3/ 8), 1.772: ~337 levels ~491520 states ~1498824 transitions
pins2lts-mc-linux64( 3/ 8), 2.957: ~337 levels ~983040 states ~3062744 transitions
pins2lts-mc-linux64( 3/ 8), 5.737: ~337 levels ~1966080 states ~6586928 transitions
pins2lts-mc-linux64( 4/ 8), 12.394: ~294 levels ~3932160 states ~12383600 transitions
pins2lts-mc-linux64( 5/ 8), 25.958: ~339 levels ~7864320 states ~27627744 transitions
pins2lts-mc-linux64( 2/ 8), 53.268: ~294 levels ~15728640 states ~56415392 transitions
pins2lts-mc-linux64( 2/ 8), 111.638: ~294 levels ~31457280 states ~118028912 transitions
pins2lts-mc-linux64( 0/ 8), 163.733: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 163.754:
pins2lts-mc-linux64( 0/ 8), 163.754: mean standard work distribution: 4.1% (states) 3.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 163.754:
pins2lts-mc-linux64( 0/ 8), 163.754: Explored 42655799 states 165260029 transitions, fanout: 3.874
pins2lts-mc-linux64( 0/ 8), 163.754: Total exploration time 163.200 sec (163.180 sec minimum, 163.194 sec on average)
pins2lts-mc-linux64( 0/ 8), 163.754: States per second: 261371, Transitions per second: 1012623
pins2lts-mc-linux64( 0/ 8), 163.754:
pins2lts-mc-linux64( 0/ 8), 163.754: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 163.754: Redundant explorations: -0.0239
pins2lts-mc-linux64( 0/ 8), 163.754:
pins2lts-mc-linux64( 0/ 8), 163.754: Queue width: 8B, total height: 3164, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 163.754: Tree memory: 581.5MB, 14.3 B/state, compr.: 4.4%
pins2lts-mc-linux64( 0/ 8), 163.754: Tree fill ratio (roots/leafs): 31.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 163.754: Stored 45 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 163.754: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 163.754: Est. total memory use: 581.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(<>((LTLAPp0==true))) U ((LTLAPp1==true)||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12273798229872388265]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(<>((LTLAPp0==true))) U ((LTLAPp1==true)||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12273798229872388265]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-12 17:19:30] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:19:30] [INFO ] Time to serialize gal into /tmp/LTLFireability3161368287773538205.gal : 5 ms
[2021-05-12 17:19:30] [INFO ] Time to serialize properties into /tmp/LTLFireability3717302185228962612.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/LTLFireability3161368287773538205.gal, -t, CGAL, -LTL, /tmp/LTLFireability3717302185228962612.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/LTLFireability3161368287773538205.gal -t CGAL -LTL /tmp/LTLFireability3717302185228962612.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(p3_3>=1)")))U(("((HowDeliver_p12_2>=1)&&(p6_2>=1))")||(X(G("((HowDeliver_p12_2>=1)&&(p6_2>=1))"))))))
Formula 0 simplified : !(XF"(p3_3>=1)" U ("((HowDeliver_p12_2>=1)&&(p6_2>=1))" | XG"((HowDeliver_p12_2>=1)&&(p6_2>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-12 17:39:53] [INFO ] Flatten gal took : 6 ms
[2021-05-12 17:39:53] [INFO ] Input system was already deterministic with 45 transitions.
[2021-05-12 17:39:53] [INFO ] Transformed 80 places.
[2021-05-12 17:39:53] [INFO ] Transformed 45 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 17:39:54] [INFO ] Time to serialize gal into /tmp/LTLFireability5932802234773734031.gal : 1 ms
[2021-05-12 17:39:54] [INFO ] Time to serialize properties into /tmp/LTLFireability7274736990626906392.ltl : 5 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/LTLFireability5932802234773734031.gal, -t, CGAL, -LTL, /tmp/LTLFireability7274736990626906392.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability5932802234773734031.gal -t CGAL -LTL /tmp/LTLFireability7274736990626906392.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(F("(p3_3>=1)")))U(("((HowDeliver_p12_2>=1)&&(p6_2>=1))")||(X(G("((HowDeliver_p12_2>=1)&&(p6_2>=1))"))))))
Formula 0 simplified : !(XF"(p3_3>=1)" U ("((HowDeliver_p12_2>=1)&&(p6_2>=1))" | XG"((HowDeliver_p12_2>=1)&&(p6_2>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

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