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.r254-tall-162106746400732.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 SwimmingPool-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746400732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-03-00
FORMULA_NAME SwimmingPool-PT-03-01
FORMULA_NAME SwimmingPool-PT-03-02
FORMULA_NAME SwimmingPool-PT-03-03
FORMULA_NAME SwimmingPool-PT-03-04
FORMULA_NAME SwimmingPool-PT-03-05
FORMULA_NAME SwimmingPool-PT-03-06
FORMULA_NAME SwimmingPool-PT-03-07
FORMULA_NAME SwimmingPool-PT-03-08
FORMULA_NAME SwimmingPool-PT-03-09
FORMULA_NAME SwimmingPool-PT-03-10
FORMULA_NAME SwimmingPool-PT-03-11
FORMULA_NAME SwimmingPool-PT-03-12
FORMULA_NAME SwimmingPool-PT-03-13
FORMULA_NAME SwimmingPool-PT-03-14
FORMULA_NAME SwimmingPool-PT-03-15

=== Now, execution of the tool begins

BK_START 1621269419170

Running Version 0
[2021-05-17 16:37:00] [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 16:37:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:37:00] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-17 16:37:00] [INFO ] Transformed 9 places.
[2021-05-17 16:37:00] [INFO ] Transformed 7 transitions.
[2021-05-17 16:37:00] [INFO ] Parsed PT model containing 9 places and 7 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 16:37:00] [INFO ] Initial state test concluded for 3 properties.
FORMULA SwimmingPool-PT-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:00] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 16:37:01] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:01] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:37:01] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:01] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 16:37:01] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 16:37:01] [INFO ] Flatten gal took : 17 ms
FORMULA SwimmingPool-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:37:01] [INFO ] Flatten gal took : 3 ms
[2021-05-17 16:37:01] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 249 steps, including 0 resets, run visited all 23 properties in 2 ms. (steps per millisecond=124 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 10 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 16:37:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:01] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 16:37:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:01] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-17 16:37:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 16:37:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:37:01] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT s6 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1408 steps with 0 reset in 15 ms.
FORMULA SwimmingPool-PT-03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-00 finished in 340 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G((p1&&X(p2)))||(p2&&X(X(X(p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:01] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:37:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:37:01] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (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)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 9}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}]], initial=0, aps=[p0:(LEQ 1 s8), p1:(LEQ 3 s8), p2:(LEQ 2 s8)], 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (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)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Applying partial POR strategy [false, false, true, false, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (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)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:37:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:03] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-17 16:37:03] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
[2021-05-17 16:37:03] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:37:03] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:37:03] [INFO ] Time to serialize gal into /tmp/LTL5794553023513142023.gal : 0 ms
[2021-05-17 16:37:03] [INFO ] Time to serialize properties into /tmp/LTL15610696650508075766.ltl : 13 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/LTL5794553023513142023.gal, -t, CGAL, -LTL, /tmp/LTL15610696650508075766.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/LTL5794553023513142023.gal -t CGAL -LTL /tmp/LTL15610696650508075766.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(Bags>=1)")||(G(("(Bags>=3)")&&(X("(Bags>=2)")))))||(("(Bags>=2)")&&(X(X(X("(Bags>=1)"))))))))
Formula 0 simplified : !X("(Bags>=1)" | G("(Bags>=3)" & X"(Bags>=2)") | ("(Bags>=2)" & XXX"(Bags>=1)"))
Detected timeout of ITS tools.
[2021-05-17 16:37:18] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:37:18] [INFO ] Applying decomposition
[2021-05-17 16:37:18] [INFO ] Flatten gal took : 1 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/graph10273415951460801110.txt, -o, /tmp/graph10273415951460801110.bin, -w, /tmp/graph10273415951460801110.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/graph10273415951460801110.bin, -l, -1, -v, -w, /tmp/graph10273415951460801110.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:37:18] [INFO ] Decomposing Gal with order
[2021-05-17 16:37:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:37:18] [INFO ] Flatten gal took : 61 ms
[2021-05-17 16:37:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 16:37:18] [INFO ] Time to serialize gal into /tmp/LTL5863355021793222173.gal : 10 ms
[2021-05-17 16:37:18] [INFO ] Time to serialize properties into /tmp/LTL14394134868432761200.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/LTL5863355021793222173.gal, -t, CGAL, -LTL, /tmp/LTL14394134868432761200.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/LTL5863355021793222173.gal -t CGAL -LTL /tmp/LTL14394134868432761200.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("(u1.Bags>=1)")||(G(("(u1.Bags>=3)")&&(X("(u1.Bags>=2)")))))||(("(u1.Bags>=2)")&&(X(X(X("(u1.Bags>=1)"))))))))
Formula 0 simplified : !X("(u1.Bags>=1)" | G("(u1.Bags>=3)" & X"(u1.Bags>=2)") | ("(u1.Bags>=2)" & XXX"(u1.Bags>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15132647410649192699
[2021-05-17 16:37:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15132647410649192699
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/ltsmin15132647410649192699]
Compilation finished in 166 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15132647410649192699]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[](((LTLAPp1==true)&&X((LTLAPp2==true))))||((LTLAPp2==true)&&X(X(X((LTLAPp0==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15132647410649192699]
LTSmin run took 167 ms.
FORMULA SwimmingPool-PT-03-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-01 finished in 32514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||X(F((p0&&X(F(p1))))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:34] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:34] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:34] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-03 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 s1 s3)], 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 17103 reset in 78 ms.
Stack based approach found an accepted trace after 659 steps with 161 reset with depth 11 and stack size 11 in 1 ms.
FORMULA SwimmingPool-PT-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-03 finished in 205 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 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:34] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:37:34] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:37:34] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6 s1)], 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 93 reset in 85 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 0 ms.
FORMULA SwimmingPool-PT-03-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-04 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:34] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:34] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:34] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s5 s6), p1:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9781 reset in 73 ms.
Product exploration explored 100000 steps with 9888 reset in 206 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 9840 reset in 67 ms.
Product exploration explored 100000 steps with 9749 reset in 84 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:37:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:37:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:37:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 12034 reset in 221 ms.
Product exploration explored 100000 steps with 12343 reset in 263 ms.
[2021-05-17 16:37:36] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:37:36] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:37:36] [INFO ] Time to serialize gal into /tmp/LTL227484140334966541.gal : 0 ms
[2021-05-17 16:37:36] [INFO ] Time to serialize properties into /tmp/LTL15341786874025865281.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/LTL227484140334966541.gal, -t, CGAL, -LTL, /tmp/LTL15341786874025865281.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/LTL227484140334966541.gal -t CGAL -LTL /tmp/LTL15341786874025865281.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(Dressed<=Out)")&&(G(F("(InBath>=1)"))))))
Formula 0 simplified : !X("(Dressed<=Out)" & GF"(InBath>=1)")
Detected timeout of ITS tools.
[2021-05-17 16:37:51] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:37:51] [INFO ] Applying decomposition
[2021-05-17 16:37:51] [INFO ] Flatten gal took : 1 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/graph12402129826452716467.txt, -o, /tmp/graph12402129826452716467.bin, -w, /tmp/graph12402129826452716467.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/graph12402129826452716467.bin, -l, -1, -v, -w, /tmp/graph12402129826452716467.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:37:51] [INFO ] Decomposing Gal with order
[2021-05-17 16:37:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:37:51] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:37:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 16:37:51] [INFO ] Time to serialize gal into /tmp/LTL758052275474561487.gal : 0 ms
[2021-05-17 16:37:51] [INFO ] Time to serialize properties into /tmp/LTL15756757496668582293.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/LTL758052275474561487.gal, -t, CGAL, -LTL, /tmp/LTL15756757496668582293.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/LTL758052275474561487.gal -t CGAL -LTL /tmp/LTL15756757496668582293.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(gu1.Dressed<=gu1.Out)")&&(G(F("(gu0.InBath>=1)"))))))
Formula 0 simplified : !X("(gu1.Dressed<=gu1.Out)" & GF"(gu0.InBath>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4177611050269155610
[2021-05-17 16:38:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4177611050269155610
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/ltsmin4177611050269155610]
Compilation finished in 96 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4177611050269155610]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)&&[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4177611050269155610]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-03-06 finished in 46576 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
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 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:38:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:38:21] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:38:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:38:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-17 16:38:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:38:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:38:21] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-03-08 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 s6), p0:(LEQ 3 s7)], 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 33 reset in 107 ms.
Stack based approach found an accepted trace after 16383 steps with 3 reset with depth 7547 and stack size 2055 in 22 ms.
FORMULA SwimmingPool-PT-03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-08 finished in 256 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 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:38:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:38:21] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:38:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:38:21] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-17 16:38:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:38:21] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-17 16:38:21] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-09 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 2 s1), p1:(GT s5 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 7176 reset in 76 ms.
Product exploration explored 100000 steps with 7131 reset in 86 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7176 reset in 76 ms.
Product exploration explored 100000 steps with 7019 reset in 86 ms.
[2021-05-17 16:38:21] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:38:21] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:38:21] [INFO ] Time to serialize gal into /tmp/LTL9102766103437894740.gal : 0 ms
[2021-05-17 16:38:21] [INFO ] Time to serialize properties into /tmp/LTL8341490718697010015.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/LTL9102766103437894740.gal, -t, CGAL, -LTL, /tmp/LTL8341490718697010015.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/LTL9102766103437894740.gal -t CGAL -LTL /tmp/LTL8341490718697010015.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(WaitBag>=2)")||(G(F("(Out>InBath)"))))))
Formula 0 simplified : !F("(WaitBag>=2)" | GF"(Out>InBath)")
Detected timeout of ITS tools.
[2021-05-17 16:38:36] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:38:36] [INFO ] Applying decomposition
[2021-05-17 16:38:36] [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/graph4349561463336563596.txt, -o, /tmp/graph4349561463336563596.bin, -w, /tmp/graph4349561463336563596.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/graph4349561463336563596.bin, -l, -1, -v, -w, /tmp/graph4349561463336563596.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:38:36] [INFO ] Decomposing Gal with order
[2021-05-17 16:38:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:38:36] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:38:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 16:38:36] [INFO ] Time to serialize gal into /tmp/LTL5529593781053205196.gal : 1 ms
[2021-05-17 16:38:36] [INFO ] Time to serialize properties into /tmp/LTL15743447195274902133.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/LTL5529593781053205196.gal, -t, CGAL, -LTL, /tmp/LTL15743447195274902133.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/LTL5529593781053205196.gal -t CGAL -LTL /tmp/LTL15743447195274902133.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(gi0.gu0.WaitBag>=2)")||(G(F("(gu3.Out>gu3.InBath)"))))))
Formula 0 simplified : !F("(gi0.gu0.WaitBag>=2)" | GF"(gu3.Out>gu3.InBath)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9730505538857940435
[2021-05-17 16:38:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9730505538857940435
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/ltsmin9730505538857940435]
Compilation finished in 96 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9730505538857940435]
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)||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9730505538857940435]
LTSmin run took 978 ms.
FORMULA SwimmingPool-PT-03-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-09 finished in 31741 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:38:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:38:53] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:38:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:38:53] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:38:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:38:53] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-03-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (LEQ 1 s6) (LEQ s1 s7)), p0:(LEQ 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:38:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:38:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:38:53] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
[2021-05-17 16:38:54] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:38:54] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:38:54] [INFO ] Time to serialize gal into /tmp/LTL372096313531983526.gal : 1 ms
[2021-05-17 16:38:54] [INFO ] Time to serialize properties into /tmp/LTL6918363722658164882.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/LTL372096313531983526.gal, -t, CGAL, -LTL, /tmp/LTL6918363722658164882.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/LTL372096313531983526.gal -t CGAL -LTL /tmp/LTL6918363722658164882.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Out>=2)")||(G("((Out>=1)&&(WaitBag<=Cabins))"))))))
Formula 0 simplified : !XF("(Out>=2)" | G"((Out>=1)&&(WaitBag<=Cabins))")
Detected timeout of ITS tools.
[2021-05-17 16:39:09] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:39:09] [INFO ] Applying decomposition
[2021-05-17 16:39:09] [INFO ] Flatten gal took : 1 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/graph4951711280771414048.txt, -o, /tmp/graph4951711280771414048.bin, -w, /tmp/graph4951711280771414048.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/graph4951711280771414048.bin, -l, -1, -v, -w, /tmp/graph4951711280771414048.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:39:09] [INFO ] Decomposing Gal with order
[2021-05-17 16:39:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:39:09] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-17 16:39:09] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 16:39:09] [INFO ] Time to serialize gal into /tmp/LTL15578187472491355103.gal : 0 ms
[2021-05-17 16:39:09] [INFO ] Time to serialize properties into /tmp/LTL5885677119282020987.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/LTL15578187472491355103.gal, -t, CGAL, -LTL, /tmp/LTL5885677119282020987.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/LTL15578187472491355103.gal -t CGAL -LTL /tmp/LTL5885677119282020987.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gi1.gu3.Out>=2)")||(G("((gi1.gu3.Out>=1)&&(gu0.WaitBag<=gu0.Cabins))"))))))
Formula 0 simplified : !XF("(gi1.gu3.Out>=2)" | G"((gi1.gu3.Out>=1)&&(gu0.WaitBag<=gu0.Cabins))")
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
781 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,7.81866,133144,1,0,6,744008,30,0,561,696676,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-03-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property SwimmingPool-PT-03-10 finished in 24440 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:39:17] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:39:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-17 16:39:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:39:17] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 1589 steps with 0 reset with depth 1590 and stack size 650 in 6 ms.
FORMULA SwimmingPool-PT-03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-12 finished in 161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F((p1 U ((p1&&G(p2))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:39:17] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:39:17] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 16:39:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:39:17] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GT s5 s0), p1:(GT 1 s0), p0:(GT s6 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Stack based approach found an accepted trace after 204 steps with 0 reset with depth 205 and stack size 203 in 0 ms.
FORMULA SwimmingPool-PT-03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-13 finished in 244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&X(X(p1))) U G(!p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:39:17] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:39:17] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:39:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:39:17] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, (NOT p1), p0, (NOT p1), true]
Running random walk in product with property : SwimmingPool-PT-03-14 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s2 s6), p1:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 SwimmingPool-PT-03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-14 finished in 159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((X(F(p1))&&(p2 U ((p2&&(!p0 U ((!p0&&G(p3))||G(!p0))))||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:39:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:39:18] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:39:18] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-17 16:39:18] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:39:18] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-17 16:39:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p2), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p3), p0, (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0)]
Running random walk in product with property : SwimmingPool-PT-03-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND p0 p2), acceptance={} source=2 dest: 9}, { cond=(AND p0 p2), acceptance={} source=2 dest: 10}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 7}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 12}, { cond=(AND p0 p3 p2), acceptance={} source=6 dest: 13}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=6 dest: 14}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=7 dest: 14}], [{ cond=(NOT p0), acceptance={} source=8 dest: 3}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p2), acceptance={} source=10 dest: 10}], [{ cond=(NOT p3), acceptance={} source=11 dest: 3}, { cond=p3, acceptance={} source=11 dest: 11}], [{ cond=p0, acceptance={} source=12 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p0) p3), acceptance={} source=12 dest: 14}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=13 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=13 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=13 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=13 dest: 11}, { cond=(AND p0 p3 p2), acceptance={} source=13 dest: 13}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=14 dest: 3}, { cond=(AND p0 p3), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p0) p3), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(LEQ 3 s4), p2:(GT s5 s2), p3:(GT s1 s5), p1:(GT 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-15 finished in 465 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4989682812649233923
[2021-05-17 16:39:18] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2021-05-17 16:39:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:39:18] [INFO ] Applying decomposition
[2021-05-17 16:39:18] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2021-05-17 16:39:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:39:18] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2021-05-17 16:39:18] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:39:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:39:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4989682812649233923
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/ltsmin4989682812649233923]
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/graph11808318472402810834.txt, -o, /tmp/graph11808318472402810834.bin, -w, /tmp/graph11808318472402810834.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/graph11808318472402810834.bin, -l, -1, -v, -w, /tmp/graph11808318472402810834.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:39:18] [INFO ] Decomposing Gal with order
[2021-05-17 16:39:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:39:18] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:39:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 16:39:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality12715362678930480690.gal : 0 ms
[2021-05-17 16:39:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality15427839017608541668.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/LTLCardinality12715362678930480690.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15427839017608541668.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/LTLCardinality12715362678930480690.gal -t CGAL -LTL /tmp/LTLCardinality15427839017608541668.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(gu0.Dressed<=gu0.Out)")&&(G(F("(gu1.InBath>=1)"))))))
Formula 0 simplified : !X("(gu0.Dressed<=gu0.Out)" & GF"(gu1.InBath>=1)")
Compilation finished in 119 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4989682812649233923]
Link finished in 43 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)&&[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4989682812649233923]
LTSmin run took 38465 ms.
FORMULA SwimmingPool-PT-03-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621269598389

--------------------
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="SwimmingPool-PT-03"
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 SwimmingPool-PT-03, 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 r254-tall-162106746400732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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