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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K 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.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000000100-00
FORMULA_NAME GPPP-PT-C0100N0000000100-01
FORMULA_NAME GPPP-PT-C0100N0000000100-02
FORMULA_NAME GPPP-PT-C0100N0000000100-03
FORMULA_NAME GPPP-PT-C0100N0000000100-04
FORMULA_NAME GPPP-PT-C0100N0000000100-05
FORMULA_NAME GPPP-PT-C0100N0000000100-06
FORMULA_NAME GPPP-PT-C0100N0000000100-07
FORMULA_NAME GPPP-PT-C0100N0000000100-08
FORMULA_NAME GPPP-PT-C0100N0000000100-09
FORMULA_NAME GPPP-PT-C0100N0000000100-10
FORMULA_NAME GPPP-PT-C0100N0000000100-11
FORMULA_NAME GPPP-PT-C0100N0000000100-12
FORMULA_NAME GPPP-PT-C0100N0000000100-13
FORMULA_NAME GPPP-PT-C0100N0000000100-14
FORMULA_NAME GPPP-PT-C0100N0000000100-15

=== Now, execution of the tool begins

BK_START 1621220341272

Running Version 0
[2021-05-17 02:59:04] [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-17 02:59:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 02:59:04] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-17 02:59:04] [INFO ] Transformed 33 places.
[2021-05-17 02:59:04] [INFO ] Transformed 22 transitions.
[2021-05-17 02:59:04] [INFO ] Parsed PT model containing 33 places and 22 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 02:59:04] [INFO ] Initial state test concluded for 4 properties.
FORMULA GPPP-PT-C0100N0000000100-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 14 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 02:59:04] [INFO ] Computed 12 place invariants in 11 ms
[2021-05-17 02:59:04] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 02:59:04] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-17 02:59:04] [INFO ] Implicit Places using invariants in 53 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 02:59:04] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 02:59:05] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 12 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 02:59:05] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 02:59:05] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 02:59:05] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 02:59:05] [INFO ] Flatten gal took : 44 ms
FORMULA GPPP-PT-C0100N0000000100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 02:59:05] [INFO ] Flatten gal took : 13 ms
[2021-05-17 02:59:05] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 7456 steps, including 2 resets, run visited all 15 properties in 26 ms. (steps per millisecond=286 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 02:59:05] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 02:59:05] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 02:59:05] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 02:59:05] [INFO ] Implicit Places using invariants in 56 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 02:59:05] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 02:59:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 02:59:05] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 02:59:05] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s28 s4)], 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 33333 reset in 336 ms.
Product exploration explored 100000 steps with 33333 reset in 191 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 21
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 29 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 29 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 29 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 28 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 28 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 28 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 13 rules in 21 ms. Remains 28 /31 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 02:59:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 02:59:07] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
[2021-05-17 02:59:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 02:59:07] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-17 02:59:07] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/31 places, 19/22 transitions.
Product exploration explored 100000 steps with 33333 reset in 347 ms.
Product exploration explored 100000 steps with 33333 reset in 370 ms.
[2021-05-17 02:59:08] [INFO ] Flatten gal took : 6 ms
[2021-05-17 02:59:08] [INFO ] Flatten gal took : 5 ms
[2021-05-17 02:59:08] [INFO ] Time to serialize gal into /tmp/LTL9424295954264037224.gal : 2 ms
[2021-05-17 02:59:08] [INFO ] Time to serialize properties into /tmp/LTL3218403315147415129.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/LTL9424295954264037224.gal, -t, CGAL, -LTL, /tmp/LTL3218403315147415129.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/LTL9424295954264037224.gal -t CGAL -LTL /tmp/LTL3218403315147415129.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(a2<=NADPH)")))))
Formula 0 simplified : !XXF"(a2<=NADPH)"
Detected timeout of ITS tools.
[2021-05-17 02:59:23] [INFO ] Flatten gal took : 5 ms
[2021-05-17 02:59:23] [INFO ] Applying decomposition
[2021-05-17 02:59:23] [INFO ] Flatten gal took : 4 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/graph13959442394485515799.txt, -o, /tmp/graph13959442394485515799.bin, -w, /tmp/graph13959442394485515799.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/graph13959442394485515799.bin, -l, -1, -v, -w, /tmp/graph13959442394485515799.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 02:59:23] [INFO ] Decomposing Gal with order
[2021-05-17 02:59:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 02:59:23] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 02:59:23] [INFO ] Flatten gal took : 44 ms
[2021-05-17 02:59:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 02:59:23] [INFO ] Time to serialize gal into /tmp/LTL5874845789140694030.gal : 5 ms
[2021-05-17 02:59:23] [INFO ] Time to serialize properties into /tmp/LTL2057684433877240049.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/LTL5874845789140694030.gal, -t, CGAL, -LTL, /tmp/LTL2057684433877240049.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/LTL5874845789140694030.gal -t CGAL -LTL /tmp/LTL2057684433877240049.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(gu9.a2<=gu9.NADPH)")))))
Formula 0 simplified : !XXF"(gu9.a2<=gu9.NADPH)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2136696817253792181
[2021-05-17 02:59:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2136696817253792181
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/ltsmin2136696817253792181]
Compilation finished in 417 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2136696817253792181]
Link finished in 56 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(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2136696817253792181]
LTSmin run took 201 ms.
FORMULA GPPP-PT-C0100N0000000100-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000000100-00 finished in 33799 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 02:59:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 02:59:39] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 02:59:39] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 02:59:39] [INFO ] Implicit Places using invariants in 49 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 02:59:39] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 02:59:39] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 02:59:39] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 02:59:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 2 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-02 finished in 382 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
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 5 place count 29 transition count 19
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 8 place count 27 transition count 18
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 10 place count 26 transition count 17
Applied a total of 10 rules in 13 ms. Remains 26 /32 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 02:59:39] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 02:59:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 02:59:39] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 02:59:39] [INFO ] Implicit Places using invariants in 48 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
[2021-05-17 02:59:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 02:59:39] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-17 02:59:39] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 25/32 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 16
Applied a total of 2 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 02:59:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 02:59:39] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 02:59:39] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 02:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:59:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 98 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 22/32 places, 16/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-17 02:59:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 02:59:40] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 02:59:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 3 iterations. Remains : 22/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-03 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 s0 s10), p0:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-03 finished in 377 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(F(p0))||F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 02:59:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 02:59:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 02:59:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 02:59:40] [INFO ] Implicit Places using invariants in 33 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 02:59:40] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 02:59:40] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 02:59:40] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 02:59:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s3), p0:(LEQ 1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 26826 reset in 179 ms.
Stack based approach found an accepted trace after 151 steps with 41 reset with depth 7 and stack size 7 in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-07 finished in 405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 place count 31 transition count 19
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 6 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 28 transition count 18
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 3 with 3 rules applied. Total rules applied 10 place count 26 transition count 17
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 3 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
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 15 place count 23 transition count 15
Applied a total of 15 rules in 12 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 02:59:40] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 02:59:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 02:59:40] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 02:59:40] [INFO ] Implicit Places using invariants in 48 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
[2021-05-17 02:59:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 02:59:40] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 02:59:40] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 15/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 14
Applied a total of 2 rules in 6 ms. Remains 21 /22 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 21 cols
[2021-05-17 02:59:40] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-17 02:59:40] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2021-05-17 02:59:40] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 02:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:59:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 86 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 02:59:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 02:59:40] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 02:59:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s13 s10)], 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 24982 reset in 99 ms.
Product exploration explored 100000 steps with 24897 reset in 146 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24937 reset in 164 ms.
Product exploration explored 100000 steps with 25017 reset in 317 ms.
[2021-05-17 02:59:41] [INFO ] Flatten gal took : 4 ms
[2021-05-17 02:59:41] [INFO ] Flatten gal took : 4 ms
[2021-05-17 02:59:41] [INFO ] Time to serialize gal into /tmp/LTL10706058658901897654.gal : 1 ms
[2021-05-17 02:59:41] [INFO ] Time to serialize properties into /tmp/LTL949701896605769107.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/LTL10706058658901897654.gal, -t, CGAL, -LTL, /tmp/LTL949701896605769107.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/LTL10706058658901897654.gal -t CGAL -LTL /tmp/LTL949701896605769107.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(b1<=_3PG)")))
Formula 0 simplified : !F"(b1<=_3PG)"
Detected timeout of ITS tools.
[2021-05-17 02:59:56] [INFO ] Flatten gal took : 8 ms
[2021-05-17 02:59:56] [INFO ] Applying decomposition
[2021-05-17 02:59:56] [INFO ] Flatten gal took : 2 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/graph5982012280486153851.txt, -o, /tmp/graph5982012280486153851.bin, -w, /tmp/graph5982012280486153851.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/graph5982012280486153851.bin, -l, -1, -v, -w, /tmp/graph5982012280486153851.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 02:59:56] [INFO ] Decomposing Gal with order
[2021-05-17 02:59:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 02:59:56] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-17 02:59:56] [INFO ] Flatten gal took : 4 ms
[2021-05-17 02:59:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 02:59:56] [INFO ] Time to serialize gal into /tmp/LTL18214904277478198.gal : 1 ms
[2021-05-17 02:59:56] [INFO ] Time to serialize properties into /tmp/LTL4782980903906160291.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/LTL18214904277478198.gal, -t, CGAL, -LTL, /tmp/LTL4782980903906160291.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/LTL18214904277478198.gal -t CGAL -LTL /tmp/LTL4782980903906160291.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(gu2.b1<=gu2._3PG)")))
Formula 0 simplified : !F"(gu2.b1<=gu2._3PG)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14223177646115655733
[2021-05-17 03:00:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14223177646115655733
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/ltsmin14223177646115655733]
Compilation finished in 183 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14223177646115655733]
Link finished in 31 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)), --buchi-type=spotba], workingDir=/tmp/ltsmin14223177646115655733]
LTSmin run took 990 ms.
FORMULA GPPP-PT-C0100N0000000100-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000000100-09 finished in 32486 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0)) U (p1&&G(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:13] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:13] [INFO ] Implicit Places using invariants in 32 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:13] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-17 03:00:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:13] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 03:00:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s29 s22), p2:(LEQ s11 s13), p0:(LEQ s13 s7)], 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 31229 reset in 169 ms.
Stack based approach found an accepted trace after 7504 steps with 2376 reset with depth 9 and stack size 9 in 15 ms.
FORMULA GPPP-PT-C0100N0000000100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-10 finished in 579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:13] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 03:00:13] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:13] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-17 03:00:13] [INFO ] Implicit Places using invariants in 44 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:13] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 03:00:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:13] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 03:00:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GPPP-PT-C0100N0000000100-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s16 s27)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-11 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:13] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 03:00:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:13] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 03:00:13] [INFO ] Implicit Places using invariants in 56 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:14] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 03:00:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:14] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 03:00:14] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-12 finished in 391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(p1 U X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:14] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:14] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 03:00:14] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 03:00:14] [INFO ] Implicit Places using invariants in 42 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:14] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 03:00:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 03:00:14] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 03:00:14] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s20), p1:(LEQ 2 s8), p2:(LEQ 3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2895 steps with 0 reset in 7 ms.
FORMULA GPPP-PT-C0100N0000000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-15 finished in 440 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621220415635

--------------------
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="GPPP-PT-C0100N0000000100"
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 GPPP-PT-C0100N0000000100, 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 r102-smll-162075331300244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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