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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.4K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 20:11 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-10-00
FORMULA_NAME SwimmingPool-PT-10-01
FORMULA_NAME SwimmingPool-PT-10-02
FORMULA_NAME SwimmingPool-PT-10-03
FORMULA_NAME SwimmingPool-PT-10-04
FORMULA_NAME SwimmingPool-PT-10-05
FORMULA_NAME SwimmingPool-PT-10-06
FORMULA_NAME SwimmingPool-PT-10-07
FORMULA_NAME SwimmingPool-PT-10-08
FORMULA_NAME SwimmingPool-PT-10-09
FORMULA_NAME SwimmingPool-PT-10-10
FORMULA_NAME SwimmingPool-PT-10-11
FORMULA_NAME SwimmingPool-PT-10-12
FORMULA_NAME SwimmingPool-PT-10-13
FORMULA_NAME SwimmingPool-PT-10-14
FORMULA_NAME SwimmingPool-PT-10-15

=== Now, execution of the tool begins

BK_START 1621281746949

Running Version 0
[2021-05-17 20:02:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:02:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:02:28] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2021-05-17 20:02:28] [INFO ] Transformed 9 places.
[2021-05-17 20:02:28] [INFO ] Transformed 7 transitions.
[2021-05-17 20:02:28] [INFO ] Parsed PT model containing 9 places and 7 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
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 13 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 20:02:28] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 20:02:28] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:02:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:02:28] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:02:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:02:28] [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 20:02:28] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 20:02:28] [INFO ] Flatten gal took : 15 ms
FORMULA SwimmingPool-PT-10-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-10-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-10-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-10-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:02:28] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:02:29] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 1567 steps, including 0 resets, run visited all 8 properties in 5 ms. (steps per millisecond=313 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0&&X((p1&&F(p2))))||(p1 U (!p0||G(p1))))))], 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 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 20:02:29] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:02:29] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:02:29] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:02:29] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:02:29] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:02:29] [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.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : SwimmingPool-PT-10-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(OR (LT s3 1) (LT s7 1)), p1:(OR (LT s1 1) (LT s8 1)), p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Applying partial POR strategy [true, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 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 3 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 20:02:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:02:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:02:30] [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.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
[2021-05-17 20:02:30] [INFO ] Flatten gal took : 2 ms
[2021-05-17 20:02:30] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:02:30] [INFO ] Time to serialize gal into /tmp/LTL6226967076798314245.gal : 0 ms
[2021-05-17 20:02:30] [INFO ] Time to serialize properties into /tmp/LTL6962034824041515607.ltl : 2 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/LTL6226967076798314245.gal, -t, CGAL, -LTL, /tmp/LTL6962034824041515607.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/LTL6226967076798314245.gal -t CGAL -LTL /tmp/LTL6962034824041515607.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((WaitBag<1)||(Bags<1))")U(("(Dress<1)")||(G("((WaitBag<1)||(Bags<1))"))))||(("(Dress>=1)")&&(X(("((WaitBag<1)||(Bags<1))")&&(F("((InBath<1)||(Cabins<1))"))))))))
Formula 0 simplified : !X(("((WaitBag<1)||(Bags<1))" U ("(Dress<1)" | G"((WaitBag<1)||(Bags<1))")) | ("(Dress>=1)" & X("((WaitBag<1)||(Bags<1))" & F"((InBath<1)||(Cabins<1))")))
Detected timeout of ITS tools.
[2021-05-17 20:02:45] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:02:45] [INFO ] Applying decomposition
[2021-05-17 20:02:45] [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/graph8285775079742825378.txt, -o, /tmp/graph8285775079742825378.bin, -w, /tmp/graph8285775079742825378.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/graph8285775079742825378.bin, -l, -1, -v, -w, /tmp/graph8285775079742825378.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:02:45] [INFO ] Decomposing Gal with order
[2021-05-17 20:02:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:02:45] [INFO ] Flatten gal took : 77 ms
[2021-05-17 20:02:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 20:02:45] [INFO ] Time to serialize gal into /tmp/LTL15837756801497271288.gal : 1 ms
[2021-05-17 20:02:45] [INFO ] Time to serialize properties into /tmp/LTL17868630310947842108.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/LTL15837756801497271288.gal, -t, CGAL, -LTL, /tmp/LTL17868630310947842108.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/LTL15837756801497271288.gal -t CGAL -LTL /tmp/LTL17868630310947842108.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("((u0.WaitBag<1)||(u1.Bags<1))")U(("(u2.Dress<1)")||(G("((u0.WaitBag<1)||(u1.Bags<1))"))))||(("(u2.Dress>=1)")&&(X(("((u0.WaitBag<1)||(u1.Bags<1))")&&(F("((u1.InBath<1)||(u2.Cabins<1))"))))))))
Formula 0 simplified : !X(("((u0.WaitBag<1)||(u1.Bags<1))" U ("(u2.Dress<1)" | G"((u0.WaitBag<1)||(u1.Bags<1))")) | ("(u2.Dress>=1)" & X("((u0.WaitBag<1)||(u1.Bags<1))" & F"((u1.InBath<1)||(u2.Cabins<1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3696346122515413655
[2021-05-17 20:03:01] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3696346122515413655
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/ltsmin3696346122515413655]
Compilation finished in 166 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3696346122515413655]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))||(!(LTLAPp1==true)&&X(((LTLAPp0==true)&&<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3696346122515413655]
LTSmin run took 358 ms.
FORMULA SwimmingPool-PT-10-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-10-00 finished in 32554 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(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 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 20:03:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:03:01] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:03:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:03:01] [INFO ] Implicit Places using invariants and state equation in 18 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 20:03:01] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 20:03:01] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-10-02 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:(OR (LT s6 1) (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Product exploration explored 100000 steps with 33333 reset in 71 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 50 ms.
Product exploration explored 100000 steps with 33333 reset in 58 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), (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
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
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 20:03:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:03:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:03:02] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Product exploration explored 100000 steps with 33333 reset in 116 ms.
[2021-05-17 20:03:02] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:03:02] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:03:02] [INFO ] Time to serialize gal into /tmp/LTL4813064211011899898.gal : 0 ms
[2021-05-17 20:03:02] [INFO ] Time to serialize properties into /tmp/LTL14352791351714097877.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/LTL4813064211011899898.gal, -t, CGAL, -LTL, /tmp/LTL14352791351714097877.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/LTL4813064211011899898.gal -t CGAL -LTL /tmp/LTL14352791351714097877.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((Out<1)||(InBath<1))||(Cabins<1))")))))
Formula 0 simplified : !XXF"(((Out<1)||(InBath<1))||(Cabins<1))"
Detected timeout of ITS tools.
[2021-05-17 20:03:17] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:03:17] [INFO ] Applying decomposition
[2021-05-17 20:03:17] [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/graph16158563843784301137.txt, -o, /tmp/graph16158563843784301137.bin, -w, /tmp/graph16158563843784301137.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/graph16158563843784301137.bin, -l, -1, -v, -w, /tmp/graph16158563843784301137.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:03:17] [INFO ] Decomposing Gal with order
[2021-05-17 20:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:03:17] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:03:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 20:03:17] [INFO ] Time to serialize gal into /tmp/LTL4691356887058952464.gal : 1 ms
[2021-05-17 20:03:17] [INFO ] Time to serialize properties into /tmp/LTL1755185947094637865.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/LTL4691356887058952464.gal, -t, CGAL, -LTL, /tmp/LTL1755185947094637865.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/LTL4691356887058952464.gal -t CGAL -LTL /tmp/LTL1755185947094637865.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((u0.Out<1)||(u1.InBath<1))||(u2.Cabins<1))")))))
Formula 0 simplified : !XXF"(((u0.Out<1)||(u1.InBath<1))||(u2.Cabins<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6220604355031632172
[2021-05-17 20:03:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6220604355031632172
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/ltsmin6220604355031632172]
Compilation finished in 93 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6220604355031632172]
Link finished in 30 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/ltsmin6220604355031632172]
LTSmin run took 270 ms.
FORMULA SwimmingPool-PT-10-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-10-02 finished in 31379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 6 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:03:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:03:33] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:03:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:03:33] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 20:03:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:03:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:03:33] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-10-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15141 reset in 163 ms.
Product exploration explored 100000 steps with 15065 reset in 104 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15111 reset in 55 ms.
Product exploration explored 100000 steps with 15010 reset in 130 ms.
[2021-05-17 20:03:33] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:03:33] [INFO ] Flatten gal took : 0 ms
[2021-05-17 20:03:33] [INFO ] Time to serialize gal into /tmp/LTL909710853553610886.gal : 0 ms
[2021-05-17 20:03:33] [INFO ] Time to serialize properties into /tmp/LTL14160062495988917794.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/LTL909710853553610886.gal, -t, CGAL, -LTL, /tmp/LTL14160062495988917794.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/LTL909710853553610886.gal -t CGAL -LTL /tmp/LTL14160062495988917794.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(Dress>=1)")))
Formula 0 simplified : !F"(Dress>=1)"
Detected timeout of ITS tools.
[2021-05-17 20:03:48] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:03:48] [INFO ] Applying decomposition
[2021-05-17 20:03:48] [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/graph10871519165648813743.txt, -o, /tmp/graph10871519165648813743.bin, -w, /tmp/graph10871519165648813743.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/graph10871519165648813743.bin, -l, -1, -v, -w, /tmp/graph10871519165648813743.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:03:48] [INFO ] Decomposing Gal with order
[2021-05-17 20:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:03:48] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 20:03:48] [INFO ] Time to serialize gal into /tmp/LTL17451470024560684580.gal : 1 ms
[2021-05-17 20:03:48] [INFO ] Time to serialize properties into /tmp/LTL15218173941932845105.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/LTL17451470024560684580.gal, -t, CGAL, -LTL, /tmp/LTL15218173941932845105.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/LTL17451470024560684580.gal -t CGAL -LTL /tmp/LTL15218173941932845105.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("(u0.Dress>=1)")))
Formula 0 simplified : !F"(u0.Dress>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4330529345319600708
[2021-05-17 20:04:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4330529345319600708
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/ltsmin4330529345319600708]
Compilation finished in 86 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4330529345319600708]
Link finished in 30 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/ltsmin4330529345319600708]
LTSmin run took 461 ms.
FORMULA SwimmingPool-PT-10-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-10-03 finished in 31235 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 20:04:04] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:04] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:04:04] [INFO ] Computed 3 place invariants in 10 ms
[2021-05-17 20:04:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:04:04] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 46 ms :[p0, p0]
Running random walk in product with property : SwimmingPool-PT-10-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10273 reset in 103 ms.
Product exploration explored 100000 steps with 10235 reset in 201 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 51 ms :[p0, p0]
Product exploration explored 100000 steps with 10258 reset in 63 ms.
Product exploration explored 100000 steps with 10209 reset in 71 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[p0, p0]
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.
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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 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 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 20:04:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:04:04] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:04:04] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 19143 reset in 171 ms.
Product exploration explored 100000 steps with 19038 reset in 80 ms.
[2021-05-17 20:04:05] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:04:05] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:04:05] [INFO ] Time to serialize gal into /tmp/LTL16730935310876548721.gal : 0 ms
[2021-05-17 20:04:05] [INFO ] Time to serialize properties into /tmp/LTL12416576216340132769.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/LTL16730935310876548721.gal, -t, CGAL, -LTL, /tmp/LTL12416576216340132769.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/LTL16730935310876548721.gal -t CGAL -LTL /tmp/LTL12416576216340132769.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((InBath>=1)&&(Cabins>=1))"))))
Formula 0 simplified : !XF"((InBath>=1)&&(Cabins>=1))"
Detected timeout of ITS tools.
[2021-05-17 20:04:20] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:04:20] [INFO ] Applying decomposition
[2021-05-17 20:04:20] [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/graph12442369636509095041.txt, -o, /tmp/graph12442369636509095041.bin, -w, /tmp/graph12442369636509095041.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/graph12442369636509095041.bin, -l, -1, -v, -w, /tmp/graph12442369636509095041.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:04:20] [INFO ] Decomposing Gal with order
[2021-05-17 20:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:04:20] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:04:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 20:04:20] [INFO ] Time to serialize gal into /tmp/LTL191494842776073546.gal : 1 ms
[2021-05-17 20:04:20] [INFO ] Time to serialize properties into /tmp/LTL3408642169498399453.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/LTL191494842776073546.gal, -t, CGAL, -LTL, /tmp/LTL3408642169498399453.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/LTL191494842776073546.gal -t CGAL -LTL /tmp/LTL3408642169498399453.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((u0.InBath>=1)&&(u2.Cabins>=1))"))))
Formula 0 simplified : !XF"((u0.InBath>=1)&&(u2.Cabins>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4371263595084941892
[2021-05-17 20:04:35] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4371263595084941892
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/ltsmin4371263595084941892]
Compilation finished in 92 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4371263595084941892]
Link finished in 32 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin4371263595084941892]
LTSmin run took 1968 ms.
FORMULA SwimmingPool-PT-10-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-10-04 finished in 33144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((!p0 U (G((!p0||(p1 U G(!p1))))||((!p0||(p1 U G(!p1)))&&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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 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 1 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 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-17 20:04:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:04:37] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND p1 p0), p1, false, false, true, p1]
Running random walk in product with property : SwimmingPool-PT-10-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 1}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-10-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-05 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-17 20:04:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-10-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 19 in 0 ms.
FORMULA SwimmingPool-PT-10-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-06 finished in 160 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-17 20:04:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 24 ms :[p0]
Running random walk in product with property : SwimmingPool-PT-10-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA SwimmingPool-PT-10-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-07 finished in 152 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 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 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants and state equation in 11 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 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [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 56 ms :[true, p0, p0]
Running random walk in product with property : SwimmingPool-PT-10-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-10-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-08 finished in 110 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1)||G(F(p2)))))], 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 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 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:37] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 20:04:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 20:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:04:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-10-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 1), p1:(AND (GEQ s0 1) (GEQ s6 1)), p2:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 164 reset in 85 ms.
Product exploration explored 100000 steps with 223 reset in 151 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 147 reset in 87 ms.
Product exploration explored 100000 steps with 171 reset in 109 ms.
[2021-05-17 20:04:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:04:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:04:38] [INFO ] Time to serialize gal into /tmp/LTL5495404565183170156.gal : 0 ms
[2021-05-17 20:04:38] [INFO ] Time to serialize properties into /tmp/LTL5284884106576109280.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/LTL5495404565183170156.gal, -t, CGAL, -LTL, /tmp/LTL5284884106576109280.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/LTL5495404565183170156.gal -t CGAL -LTL /tmp/LTL5284884106576109280.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("(Out<1)")||(G("((Entered>=1)&&(Cabins>=1))")))||(G(F("(Dress>=1)"))))))
Formula 0 simplified : !F("(Out<1)" | G"((Entered>=1)&&(Cabins>=1))" | GF"(Dress>=1)")
Detected timeout of ITS tools.
[2021-05-17 20:04:53] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:04:53] [INFO ] Applying decomposition
[2021-05-17 20:04:53] [INFO ] Flatten gal took : 0 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/graph12248007876955336159.txt, -o, /tmp/graph12248007876955336159.bin, -w, /tmp/graph12248007876955336159.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/graph12248007876955336159.bin, -l, -1, -v, -w, /tmp/graph12248007876955336159.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:04:53] [INFO ] Decomposing Gal with order
[2021-05-17 20:04:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:04:53] [INFO ] Flatten gal took : 2 ms
[2021-05-17 20:04:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 20:04:53] [INFO ] Time to serialize gal into /tmp/LTL5745011496898344479.gal : 1 ms
[2021-05-17 20:04:53] [INFO ] Time to serialize properties into /tmp/LTL3920078756568808889.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/LTL5745011496898344479.gal, -t, CGAL, -LTL, /tmp/LTL3920078756568808889.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/LTL5745011496898344479.gal -t CGAL -LTL /tmp/LTL3920078756568808889.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((("(u2.Out<1)")||(G("((u2.Entered>=1)&&(u0.Cabins>=1))")))||(G(F("(u1.Dress>=1)"))))))
Formula 0 simplified : !F("(u2.Out<1)" | G"((u2.Entered>=1)&&(u0.Cabins>=1))" | GF"(u1.Dress>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15557177121779999187
[2021-05-17 20:05:08] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15557177121779999187
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/ltsmin15557177121779999187]
Compilation finished in 91 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15557177121779999187]
Link finished in 30 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))||[](<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15557177121779999187]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-10-09 finished in 45853 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 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 20:05:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:23] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 20:05:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 20:05:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 20:05:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:23] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-10-12 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:(OR (LT s1 1) (LT s7 1)), p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5 reset in 92 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA SwimmingPool-PT-10-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-12 finished in 189 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 20:05:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:24] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 20:05:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:24] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-17 20:05:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 20:05:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:24] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 22 ms :[p0]
Running random walk in product with property : SwimmingPool-PT-10-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA SwimmingPool-PT-10-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-13 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)||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 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 20:05:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:24] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 20:05:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:24] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-17 20:05:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 20:05:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 20:05:24] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 50 ms :[p0, (AND p0 p1)]
Running random walk in product with property : SwimmingPool-PT-10-14 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s6 1)), p1:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15088 reset in 59 ms.
Product exploration explored 100000 steps with 15118 reset in 69 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 43 ms :[p0, (AND p0 p1)]
Product exploration explored 100000 steps with 15151 reset in 57 ms.
Product exploration explored 100000 steps with 15057 reset in 67 ms.
[2021-05-17 20:05:24] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:05:24] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:05:24] [INFO ] Time to serialize gal into /tmp/LTL11536192826352948767.gal : 1 ms
[2021-05-17 20:05:24] [INFO ] Time to serialize properties into /tmp/LTL9739361717650146765.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/LTL11536192826352948767.gal, -t, CGAL, -LTL, /tmp/LTL9739361717650146765.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/LTL11536192826352948767.gal -t CGAL -LTL /tmp/LTL9739361717650146765.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((InBath>=1)&&(Cabins>=1))"))||(G("((WaitBag>=1)&&(Bags>=1))"))))
Formula 0 simplified : !(F"((InBath>=1)&&(Cabins>=1))" | G"((WaitBag>=1)&&(Bags>=1))")
Detected timeout of ITS tools.
[2021-05-17 20:05:39] [INFO ] Flatten gal took : 0 ms
[2021-05-17 20:05:39] [INFO ] Applying decomposition
[2021-05-17 20:05:39] [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/graph7883274346709290882.txt, -o, /tmp/graph7883274346709290882.bin, -w, /tmp/graph7883274346709290882.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/graph7883274346709290882.bin, -l, -1, -v, -w, /tmp/graph7883274346709290882.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:05:39] [INFO ] Decomposing Gal with order
[2021-05-17 20:05:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:05:39] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:05:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 20:05:39] [INFO ] Time to serialize gal into /tmp/LTL527565547532302644.gal : 0 ms
[2021-05-17 20:05:39] [INFO ] Time to serialize properties into /tmp/LTL12639882216665870166.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/LTL527565547532302644.gal, -t, CGAL, -LTL, /tmp/LTL12639882216665870166.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/LTL527565547532302644.gal -t CGAL -LTL /tmp/LTL12639882216665870166.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((u0.InBath>=1)&&(u2.Cabins>=1))"))||(G("((u2.WaitBag>=1)&&(u0.Bags>=1))"))))
Formula 0 simplified : !(F"((u0.InBath>=1)&&(u2.Cabins>=1))" | G"((u2.WaitBag>=1)&&(u0.Bags>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5661733975967993238
[2021-05-17 20:05:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5661733975967993238
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/ltsmin5661733975967993238]
Compilation finished in 93 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5661733975967993238]
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))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5661733975967993238]
LTSmin run took 368 ms.
FORMULA SwimmingPool-PT-10-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-10-14 finished in 31015 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15519111221727425526
[2021-05-17 20:05:55] [INFO ] Applying decomposition
[2021-05-17 20:05:55] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2021-05-17 20:05:55] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:05:55] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:05:55] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2021-05-17 20:05:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:05:55] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2021-05-17 20:05:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:05:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15519111221727425526
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/ltsmin15519111221727425526]
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/graph1777304416073796796.txt, -o, /tmp/graph1777304416073796796.bin, -w, /tmp/graph1777304416073796796.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/graph1777304416073796796.bin, -l, -1, -v, -w, /tmp/graph1777304416073796796.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:05:55] [INFO ] Decomposing Gal with order
[2021-05-17 20:05:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:05:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:05:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 20:05:55] [INFO ] Time to serialize gal into /tmp/LTLFireability5555789651020647050.gal : 0 ms
[2021-05-17 20:05:55] [INFO ] Time to serialize properties into /tmp/LTLFireability14238307468266289018.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/LTLFireability5555789651020647050.gal, -t, CGAL, -LTL, /tmp/LTLFireability14238307468266289018.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/LTLFireability5555789651020647050.gal -t CGAL -LTL /tmp/LTLFireability14238307468266289018.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((("(u2.Out<1)")||(G("((u2.Entered>=1)&&(u0.Cabins>=1))")))||(G(F("(u1.Dress>=1)"))))))
Formula 0 simplified : !F("(u2.Out<1)" | G"((u2.Entered>=1)&&(u0.Cabins>=1))" | GF"(u1.Dress>=1)")
Compilation finished in 119 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15519111221727425526]
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, -p, --pins-guards, --when, --ltl, <>(((LTLAPp0==true)||[]((LTLAPp1==true))||[](<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15519111221727425526]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: LTL layer: formula: <>(((LTLAPp0==true)||[]((LTLAPp1==true))||[](<>((LTLAPp2==true)))))
pins2lts-mc-linux64( 6/ 8), 0.004: "<>(((LTLAPp0==true)||[]((LTLAPp1==true))||[](<>((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Initializing POR dependencies: labels 10, guards 7
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.080: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.080: State length is 10, there are 13 groups
pins2lts-mc-linux64( 0/ 8), 0.080: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.080: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.080: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.080: Visible groups: 6 / 13, labels: 3 / 11
pins2lts-mc-linux64( 0/ 8), 0.080: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.080: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.267: [Blue] ~120 levels ~960 states ~2824 transitions
pins2lts-mc-linux64( 0/ 8), 0.274: [Blue] ~225 levels ~1920 states ~5344 transitions
pins2lts-mc-linux64( 3/ 8), 0.281: [Blue] ~353 levels ~3840 states ~8440 transitions
pins2lts-mc-linux64( 6/ 8), 0.283: [Blue] ~614 levels ~7680 states ~17720 transitions
pins2lts-mc-linux64( 6/ 8), 0.286: [Blue] ~700 levels ~15360 states ~29232 transitions
pins2lts-mc-linux64( 2/ 8), 0.291: [Blue] ~698 levels ~30720 states ~52056 transitions
pins2lts-mc-linux64( 2/ 8), 0.312: [Blue] ~698 levels ~61440 states ~113456 transitions
pins2lts-mc-linux64( 2/ 8), 0.360: [Blue] ~698 levels ~122880 states ~248872 transitions
pins2lts-mc-linux64( 2/ 8), 0.432: [Blue] ~698 levels ~245760 states ~549368 transitions
pins2lts-mc-linux64( 2/ 8), 0.624: [Blue] ~698 levels ~491520 states ~1137272 transitions
pins2lts-mc-linux64( 2/ 8), 1.016: [Blue] ~698 levels ~983040 states ~2346192 transitions
pins2lts-mc-linux64( 7/ 8), 1.679: [Blue] ~696 levels ~1966080 states ~3921392 transitions
pins2lts-mc-linux64( 6/ 8), 3.568: [Blue] ~700 levels ~3932160 states ~8006384 transitions
pins2lts-mc-linux64( 6/ 8), 6.895: [Blue] ~700 levels ~7864320 states ~18493168 transitions
pins2lts-mc-linux64( 6/ 8), 13.470: [Blue] ~700 levels ~15728640 states ~40268560 transitions
pins2lts-mc-linux64( 5/ 8), 27.543: [Blue] ~694 levels ~31457280 states ~80190584 transitions
pins2lts-mc-linux64( 5/ 8), 55.625: [Blue] ~694 levels ~62914560 states ~161921672 transitions
pins2lts-mc-linux64( 4/ 8), 82.432: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 82.446:
pins2lts-mc-linux64( 0/ 8), 82.446: Explored 79021238 states 233405923 transitions, fanout: 2.954
pins2lts-mc-linux64( 0/ 8), 82.446: Total exploration time 82.360 sec (82.320 sec minimum, 82.341 sec on average)
pins2lts-mc-linux64( 0/ 8), 82.446: States per second: 959461, Transitions per second: 2833972
pins2lts-mc-linux64( 0/ 8), 82.446:
pins2lts-mc-linux64( 0/ 8), 82.446: State space has 66319017 states, 366085 are accepting
pins2lts-mc-linux64( 0/ 8), 82.446: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 82.446: blue states: 79021238 (119.15%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 82.446: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 82.446: all-red states: 28243622 (42.59%), bogus 4885155 (7.37%)
pins2lts-mc-linux64( 0/ 8), 82.446:
pins2lts-mc-linux64( 0/ 8), 82.446: Total memory used for local state coloring: 89.4MB
pins2lts-mc-linux64( 0/ 8), 82.446:
pins2lts-mc-linux64( 0/ 8), 82.446: Queue width: 8B, total height: 5856108, memory: 44.68MB
pins2lts-mc-linux64( 0/ 8), 82.446: Tree memory: 762.0MB, 12.0 B/state, compr.: 28.7%
pins2lts-mc-linux64( 0/ 8), 82.446: Tree fill ratio (roots/leafs): 49.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 82.446: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 82.446: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 82.446: Est. total memory use: 806.7MB (~1068.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp0==true)||[]((LTLAPp1==true))||[](<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15519111221727425526]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAPp0==true)||[]((LTLAPp1==true))||[](<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15519111221727425526]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 20:27:03] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:27:03] [INFO ] Time to serialize gal into /tmp/LTLFireability4498356577567032376.gal : 0 ms
[2021-05-17 20:27:03] [INFO ] Time to serialize properties into /tmp/LTLFireability728646285147010606.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/LTLFireability4498356577567032376.gal, -t, CGAL, -LTL, /tmp/LTLFireability728646285147010606.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/LTLFireability4498356577567032376.gal -t CGAL -LTL /tmp/LTLFireability728646285147010606.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("(Out<1)")||(G("((Entered>=1)&&(Cabins>=1))")))||(G(F("(Dress>=1)"))))))
Formula 0 simplified : !F("(Out<1)" | G"((Entered>=1)&&(Cabins>=1))" | GF"(Dress>=1)")
Detected timeout of ITS tools.
[2021-05-17 20:48:11] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:48:11] [INFO ] Input system was already deterministic with 7 transitions.
[2021-05-17 20:48:11] [INFO ] Transformed 9 places.
[2021-05-17 20:48:11] [INFO ] Transformed 7 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 20:48:11] [INFO ] Time to serialize gal into /tmp/LTLFireability8244665469833256959.gal : 1 ms
[2021-05-17 20:48:11] [INFO ] Time to serialize properties into /tmp/LTLFireability13257208934792504627.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/LTLFireability8244665469833256959.gal, -t, CGAL, -LTL, /tmp/LTLFireability13257208934792504627.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8244665469833256959.gal -t CGAL -LTL /tmp/LTLFireability13257208934792504627.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((("(Out<1)")||(G("((Entered>=1)&&(Cabins>=1))")))||(G(F("(Dress>=1)"))))))
Formula 0 simplified : !F("(Out<1)" | G"((Entered>=1)&&(Cabins>=1))" | GF"(Dress>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SwimmingPool-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106746500789"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-10.tgz
mv SwimmingPool-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;