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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620838366071

Running Version 0
[2021-05-12 16:52:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:52:59] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-12 16:52:59] [INFO ] Transformed 111 places.
[2021-05-12 16:52:59] [INFO ] Transformed 45 transitions.
[2021-05-12 16:52:59] [INFO ] Parsed PT model containing 111 places and 45 transitions in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:52:59] [INFO ] Initial state test concluded for 1 properties.
FORMULA IOTPpurchase-PT-C05M04P03D02-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-00 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 28 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 77 transition count 45
Applied a total of 34 rules in 16 ms. Remains 77 /111 variables (removed 34) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 77 cols
[2021-05-12 16:53:00] [INFO ] Computed 33 place invariants in 7 ms
[2021-05-12 16:53:00] [INFO ] Implicit Places using invariants in 116 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
// Phase 1: matrix 45 rows 76 cols
[2021-05-12 16:53:00] [INFO ] Computed 32 place invariants in 4 ms
[2021-05-12 16:53:00] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 76/111 places, 45/45 transitions.
Applied a total of 0 rules in 17 ms. Remains 76 /76 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 76 cols
[2021-05-12 16:53:00] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-12 16:53:00] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/111 places, 45/45 transitions.
[2021-05-12 16:53:00] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-12 16:53:00] [INFO ] Flatten gal took : 26 ms
FORMULA IOTPpurchase-PT-C05M04P03D02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:53:00] [INFO ] Flatten gal took : 10 ms
[2021-05-12 16:53:00] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 21) seen :19
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 76 cols
[2021-05-12 16:53:00] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-12 16:53:00] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
[2021-05-12 16:53:00] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2021-05-12 16:53:00] [INFO ] Initial state test concluded for 1 properties.
FORMULA IOTPpurchase-PT-C05M04P03D02-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G((p0||X(X(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 45
Applied a total of 10 rules in 4 ms. Remains 66 /76 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:53:01] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-12 16:53:01] [INFO ] Implicit Places using invariants in 40 ms returned [5, 16, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:53:01] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-12 16:53:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 63/76 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:53:01] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:53:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s15), p1:(LEQ 2 s43)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1860 reset in 230 ms.
Product exploration explored 100000 steps with 1862 reset in 189 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1846 reset in 126 ms.
Product exploration explored 100000 steps with 1863 reset in 264 ms.
Applying partial POR strategy [true, true, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 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 1 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 15 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:53:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2021-05-12 16:53:02] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:53:02] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 44/45 transitions.
Product exploration explored 100000 steps with 6325 reset in 242 ms.
Product exploration explored 100000 steps with 6385 reset in 129 ms.
[2021-05-12 16:53:03] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:53:03] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:53:03] [INFO ] Time to serialize gal into /tmp/LTL16822182717338674823.gal : 2 ms
[2021-05-12 16:53:03] [INFO ] Time to serialize properties into /tmp/LTL7898897163912326421.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/LTL16822182717338674823.gal, -t, CGAL, -LTL, /tmp/LTL7898897163912326421.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/LTL16822182717338674823.gal -t CGAL -LTL /tmp/LTL7898897163912326421.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Payment_p21_3>=1)")||(G(("(Payment_p21_3>=1)")||(X(X("(p3_3>=2)")))))))))
Formula 0 simplified : !GF("(Payment_p21_3>=1)" | G("(Payment_p21_3>=1)" | XX"(p3_3>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-12 16:53:18] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:53:18] [INFO ] Applying decomposition
[2021-05-12 16:53:18] [INFO ] Flatten gal took : 8 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/graph15731339493719206583.txt, -o, /tmp/graph15731339493719206583.bin, -w, /tmp/graph15731339493719206583.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/graph15731339493719206583.bin, -l, -1, -v, -w, /tmp/graph15731339493719206583.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:53:18] [INFO ] Decomposing Gal with order
[2021-05-12 16:53:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:53:18] [INFO ] Flatten gal took : 34 ms
[2021-05-12 16:53:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:53:18] [INFO ] Time to serialize gal into /tmp/LTL15061850031664441756.gal : 3 ms
[2021-05-12 16:53:18] [INFO ] Time to serialize properties into /tmp/LTL6624486239789380725.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/LTL15061850031664441756.gal, -t, CGAL, -LTL, /tmp/LTL6624486239789380725.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/LTL15061850031664441756.gal -t CGAL -LTL /tmp/LTL6624486239789380725.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i6.u15.Payment_p21_3>=1)")||(G(("(i6.u15.Payment_p21_3>=1)")||(X(X("(i0.u20.p3_3>=2)")))))))))
Formula 0 simplified : !GF("(i6.u15.Payment_p21_3>=1)" | G("(i6.u15.Payment_p21_3>=1)" | XX"(i0.u20.p3_3>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15907022402880740006
[2021-05-12 16:53:35] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15907022402880740006
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/ltsmin15907022402880740006]
Compilation finished in 476 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15907022402880740006]
Link finished in 40 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, [](<>(((LTLAPp0==true)||[](((LTLAPp0==true)||X(X((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15907022402880740006]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property IOTPpurchase-PT-C05M04P03D02-01 finished in 49662 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 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 10 rules applied. Total rules applied 10 place count 66 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 32 place count 53 transition count 28
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 41 place count 44 transition count 28
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 41 place count 44 transition count 22
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 56 place count 35 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 56 place count 35 transition count 20
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 60 place count 33 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 75 place count 24 transition count 14
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 78 place count 22 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 21 transition count 13
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 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 84 place count 18 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 18 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 17 transition count 10
Applied a total of 86 rules in 148 ms. Remains 17 /76 variables (removed 59) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 17 cols
[2021-05-12 16:53:53] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-12 16:53:53] [INFO ] Implicit Places using invariants in 18 ms returned [2, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
[2021-05-12 16:53:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 15 cols
[2021-05-12 16:53:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:53:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 15/76 places, 10/45 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 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 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 2 with 2 rules applied. Total rules applied 4 place count 13 transition count 8
Applied a total of 4 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 13 cols
[2021-05-12 16:53:53] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:53:53] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2021-05-12 16:53:53] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:53:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 13/76 places, 8/45 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5 s8), p1:(GT s7 s2)], 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 2393 reset in 105 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-03 finished in 3474 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 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 9 rules applied. Total rules applied 9 place count 66 transition count 38
Reduce places removed 12 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 20 rules applied. Total rules applied 29 place count 54 transition count 30
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 46 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 45 transition count 29
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 39 place count 45 transition count 21
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 60 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 60 place count 32 transition count 20
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 62 place count 31 transition count 20
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 79 place count 21 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 20 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 20 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 19 transition count 12
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 5 with 3 rules applied. Total rules applied 85 place count 17 transition count 11
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 5 with 3 rules applied. Total rules applied 88 place count 15 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 15 transition count 9
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 92 place count 12 transition count 9
Applied a total of 92 rules in 11 ms. Remains 12 /76 variables (removed 64) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-12 16:53:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:53:54] [INFO ] Implicit Places using invariants in 14 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
[2021-05-12 16:53:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-12 16:53:54] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 16:53:54] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 11/76 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 11 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 8 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 8 place count 6 transition count 6
Applied a total of 8 rules in 2 ms. Remains 6 /11 variables (removed 5) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-12 16:53:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:53:54] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-12 16:53:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:53:54] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/76 places, 6/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-C05M04P03D02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ s2 s3)], 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 11744 reset in 79 ms.
Stack based approach found an accepted trace after 69 steps with 8 reset with depth 10 and stack size 10 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-05 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0||X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 45
Applied a total of 10 rules in 3 ms. Remains 66 /76 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:53:54] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-12 16:53:54] [INFO ] Implicit Places using invariants in 40 ms returned [5, 16, 17, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:53:54] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:53:54] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 62/76 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:53:54] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:53:54] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT s9 s19), p1:(LEQ 1 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 62/62 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 8 place count 62 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 22 place count 62 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 61 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 61 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 7 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:53:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2021-05-12 16:53:55] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:53:55] [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 25000 reset in 118 ms.
Product exploration explored 100000 steps with 25000 reset in 129 ms.
[2021-05-12 16:53:55] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:53:55] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:53:55] [INFO ] Time to serialize gal into /tmp/LTL11070363160043161770.gal : 1 ms
[2021-05-12 16:53:55] [INFO ] Time to serialize properties into /tmp/LTL11235947049831155083.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/LTL11070363160043161770.gal, -t, CGAL, -LTL, /tmp/LTL11235947049831155083.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/LTL11070363160043161770.gal -t CGAL -LTL /tmp/LTL11235947049831155083.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(MerchantOffer_p2>Status_p20)")||(X(G("(p11_7>=1)"))))))))
Formula 0 simplified : !XXX("(MerchantOffer_p2>Status_p20)" | XG"(p11_7>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
41 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.413398,25900,1,0,8,51037,14,0,1398,56108,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C05M04P03D02-06 finished in 1862 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F((p1&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 45
Applied a total of 10 rules in 2 ms. Remains 66 /76 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:53:56] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-12 16:53:56] [INFO ] Implicit Places using invariants in 34 ms returned [5, 16, 17, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:53:56] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-12 16:53:56] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 62/76 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:53:56] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:53:56] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s56), p1:(LEQ s23 s35), p2:(LEQ s4 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 148 ms.
Stack based approach found an accepted trace after 4030 steps with 0 reset with depth 4031 and stack size 4031 in 8 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-07 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 45
Applied a total of 10 rules in 2 ms. Remains 66 /76 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:53:56] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-12 16:53:56] [INFO ] Implicit Places using invariants in 41 ms returned [5, 16, 17, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:53:56] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:53:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 62/76 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:53:56] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:53:56] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s27 s50)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9162 reset in 101 ms.
Product exploration explored 100000 steps with 9161 reset in 109 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9164 reset in 97 ms.
Product exploration explored 100000 steps with 9148 reset in 110 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (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 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 8 place count 62 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 22 place count 62 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 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 10 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:53:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2021-05-12 16:53:57] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:53:57] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 19722 reset in 226 ms.
Product exploration explored 100000 steps with 19710 reset in 231 ms.
[2021-05-12 16:53:57] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:53:57] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:53:57] [INFO ] Time to serialize gal into /tmp/LTL10134523586865557725.gal : 1 ms
[2021-05-12 16:53:57] [INFO ] Time to serialize properties into /tmp/LTL15913567974216469503.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/LTL10134523586865557725.gal, -t, CGAL, -LTL, /tmp/LTL15913567974216469503.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/LTL10134523586865557725.gal -t CGAL -LTL /tmp/LTL15913567974216469503.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p10_2>p5_1)"))))
Formula 0 simplified : !XF"(p10_2>p5_1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
39 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.402147,25520,1,0,90,51037,20,19,1398,56108,186
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C05M04P03D02-11 finished in 1736 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(G((p1||X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 67 transition count 45
Applied a total of 9 rules in 2 ms. Remains 67 /76 variables (removed 9) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2021-05-12 16:53:58] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-12 16:53:58] [INFO ] Implicit Places using invariants in 38 ms returned [18, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:53:58] [INFO ] Computed 21 place invariants in 9 ms
[2021-05-12 16:53:58] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 65/76 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:53:58] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-12 16:53:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 65/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s40 s5), p1:(AND (LEQ s17 s37) (LEQ s13 s28)), p2:(LEQ 1 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 124 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-13 finished in 240 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G((p0||X(X(p0))))) U !p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 45
Applied a total of 10 rules in 2 ms. Remains 66 /76 variables (removed 10) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:53:58] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-12 16:53:58] [INFO ] Implicit Places using invariants in 30 ms returned [5, 16, 17, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:53:58] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-12 16:53:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 62/76 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:53:58] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:53:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/76 places, 45/45 transitions.
Stuttering acceptance computed with spot in 210 ms :[p0, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-14 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 625 reset in 132 ms.
Product exploration explored 100000 steps with 622 reset in 147 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 145 ms :[p0, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 624 reset in 135 ms.
Stack based approach found an accepted trace after 16896 steps with 104 reset with depth 264 and stack size 264 in 25 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-14 finished in 944 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 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 9 rules applied. Total rules applied 9 place count 66 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 28 place count 55 transition count 30
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 37 place count 47 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 45 transition count 29
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 39 place count 45 transition count 21
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 60 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 60 place count 32 transition count 20
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 62 place count 31 transition count 20
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 79 place count 21 transition count 13
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 19 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 81 place count 19 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 18 transition count 12
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 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 88 place count 15 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 15 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 14 transition count 9
Applied a total of 90 rules in 11 ms. Remains 14 /76 variables (removed 62) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 14 cols
[2021-05-12 16:53:59] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:53:59] [INFO ] Implicit Places using invariants in 12 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
[2021-05-12 16:53:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2021-05-12 16:53:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:53:59] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 13/76 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 13 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 10 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 8 place count 8 transition count 6
Applied a total of 8 rules in 1 ms. Remains 8 /13 variables (removed 5) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-12 16:53:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:53:59] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-12 16:53:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:53:59] [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 : 8/76 places, 6/45 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut10423494730076383350.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10733 ms :[false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s7), p1:(LEQ s2 s4)], 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 12150 reset in 76 ms.
Product exploration explored 100000 steps with 12063 reset in 82 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12105 reset in 83 ms.
Product exploration explored 100000 steps with 12153 reset in 88 ms.
[2021-05-12 16:54:10] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:54:10] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:54:10] [INFO ] Time to serialize gal into /tmp/LTL14132094752625768061.gal : 0 ms
[2021-05-12 16:54:10] [INFO ] Time to serialize properties into /tmp/LTL17730862470963629292.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/LTL14132094752625768061.gal, -t, CGAL, -LTL, /tmp/LTL17730862470963629292.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/LTL14132094752625768061.gal -t CGAL -LTL /tmp/LTL17730862470963629292.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p5_2>=1)")||(G(F("(Organization_p21_2<=p11_4)"))))))
Formula 0 simplified : !F("(p5_2>=1)" | GF"(Organization_p21_2<=p11_4)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
28 unique states visited
0 strongly connected components in search stack
32 transitions explored
18 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.018687,16856,1,0,107,2081,27,43,189,2505,305
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C05M04P03D02-15 finished in 11302 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3213006534321282861
[2021-05-12 16:54:10] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2021-05-12 16:54:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:54:10] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2021-05-12 16:54:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:54:10] [INFO ] Applying decomposition
[2021-05-12 16:54:10] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2021-05-12 16:54:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:54:10] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:54:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3213006534321282861
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/ltsmin3213006534321282861]
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/graph13447299144194715330.txt, -o, /tmp/graph13447299144194715330.bin, -w, /tmp/graph13447299144194715330.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/graph13447299144194715330.bin, -l, -1, -v, -w, /tmp/graph13447299144194715330.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:54:10] [INFO ] Decomposing Gal with order
[2021-05-12 16:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:54:10] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 16:54:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality13750122582477811205.gal : 1 ms
[2021-05-12 16:54:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality15460678374593027687.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/LTLCardinality13750122582477811205.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15460678374593027687.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/LTLCardinality13750122582477811205.gal -t CGAL -LTL /tmp/LTLCardinality15460678374593027687.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i5.u14.Payment_p21_3>=1)")||(G(("(i5.u14.Payment_p21_3>=1)")||(X(X("(i4.i0.u19.p3_3>=2)")))))))))
Formula 0 simplified : !GF("(i5.u14.Payment_p21_3>=1)" | G("(i5.u14.Payment_p21_3>=1)" | XX"(i4.i0.u19.p3_3>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 278 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3213006534321282861]
Link finished in 36 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, [](<>(((LTLAPp0==true)||[](((LTLAPp0==true)||X(X((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3213006534321282861]
27782 unique states visited
0 strongly connected components in search stack
53092 transitions explored
178 items max in DFS search stack
3320 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,33.2119,826704,1,0,1.88718e+06,10290,768,1.8116e+06,385,54413,2409768
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620838543062

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C05M04P03D02, examination is LTLCardinality"
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-162075406900372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;