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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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 2.1K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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-09-00
FORMULA_NAME SwimmingPool-PT-09-01
FORMULA_NAME SwimmingPool-PT-09-02
FORMULA_NAME SwimmingPool-PT-09-03
FORMULA_NAME SwimmingPool-PT-09-04
FORMULA_NAME SwimmingPool-PT-09-05
FORMULA_NAME SwimmingPool-PT-09-06
FORMULA_NAME SwimmingPool-PT-09-07
FORMULA_NAME SwimmingPool-PT-09-08
FORMULA_NAME SwimmingPool-PT-09-09
FORMULA_NAME SwimmingPool-PT-09-10
FORMULA_NAME SwimmingPool-PT-09-11
FORMULA_NAME SwimmingPool-PT-09-12
FORMULA_NAME SwimmingPool-PT-09-13
FORMULA_NAME SwimmingPool-PT-09-14
FORMULA_NAME SwimmingPool-PT-09-15

=== Now, execution of the tool begins

BK_START 1621280246197

Running Version 0
[2021-05-17 19:37:27] [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 19:37:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:37:27] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 19:37:27] [INFO ] Transformed 9 places.
[2021-05-17 19:37:27] [INFO ] Transformed 7 transitions.
[2021-05-17 19:37:27] [INFO ] Parsed PT model containing 9 places and 7 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 19:37:27] [INFO ] Initial state test concluded for 2 properties.
FORMULA SwimmingPool-PT-09-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 7 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 19:37:28] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-17 19:37:28] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:37:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:37:28] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:37:28] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 19:37:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 19:37:28] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 19:37:28] [INFO ] Flatten gal took : 19 ms
FORMULA SwimmingPool-PT-09-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 19:37:28] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:37:28] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 3093 steps, including 0 resets, run visited all 14 properties in 10 ms. (steps per millisecond=309 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p1)||p0))))], 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.
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 19:37:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:37:28] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:37:28] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 19:37:28] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:37:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:37:28] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : SwimmingPool-PT-09-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(OR (LT s0 1) (LT s7 1) (LT 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 2 ms.
FORMULA SwimmingPool-PT-09-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-01 finished in 277 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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.
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 8 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 19:37:28] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 19:37:28] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 19:37:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:37:28] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-17 19:37:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 19:37:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:37:28] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 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 25019 reset in 197 ms.
Product exploration explored 100000 steps with 24985 reset in 144 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24962 reset in 82 ms.
Product exploration explored 100000 steps with 25017 reset in 104 ms.
[2021-05-17 19:37:29] [INFO ] Flatten gal took : 2 ms
[2021-05-17 19:37:29] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:37:29] [INFO ] Time to serialize gal into /tmp/LTL337866120548523175.gal : 0 ms
[2021-05-17 19:37:29] [INFO ] Time to serialize properties into /tmp/LTL7752471075890272164.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/LTL337866120548523175.gal, -t, CGAL, -LTL, /tmp/LTL7752471075890272164.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/LTL337866120548523175.gal -t CGAL -LTL /tmp/LTL7752471075890272164.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((InBath>=1)&&(Cabins>=1))")))
Formula 0 simplified : !F"((InBath>=1)&&(Cabins>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
991 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.92785,122300,1,0,456,623566,20,92,852,646701,913
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-09-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-09-02 finished in 11280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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.
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 19:37:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:37:39] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:37:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:37:39] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:37:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:37:39] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[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][false, false]]
Product exploration explored 100000 steps with 7439 reset in 135 ms.
Product exploration explored 100000 steps with 7463 reset in 156 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7487 reset in 66 ms.
Product exploration explored 100000 steps with 7470 reset in 83 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 19:37:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:37:40] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:37:40] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 12330 reset in 161 ms.
Product exploration explored 100000 steps with 12371 reset in 133 ms.
[2021-05-17 19:37:41] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:37:41] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:37:41] [INFO ] Time to serialize gal into /tmp/LTL8761338796889250215.gal : 0 ms
[2021-05-17 19:37:41] [INFO ] Time to serialize properties into /tmp/LTL7583676997419863826.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/LTL8761338796889250215.gal, -t, CGAL, -LTL, /tmp/LTL7583676997419863826.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/LTL8761338796889250215.gal -t CGAL -LTL /tmp/LTL7583676997419863826.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Dress>=1)"))))
Formula 0 simplified : !XF"(Dress>=1)"
Detected timeout of ITS tools.
[2021-05-17 19:37:56] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:37:56] [INFO ] Applying decomposition
[2021-05-17 19:37:56] [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/graph9642172977667420766.txt, -o, /tmp/graph9642172977667420766.bin, -w, /tmp/graph9642172977667420766.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/graph9642172977667420766.bin, -l, -1, -v, -w, /tmp/graph9642172977667420766.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:37:56] [INFO ] Decomposing Gal with order
[2021-05-17 19:37:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:37:56] [INFO ] Flatten gal took : 20 ms
[2021-05-17 19:37:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 19:37:56] [INFO ] Time to serialize gal into /tmp/LTL15636151535218712668.gal : 1 ms
[2021-05-17 19:37:56] [INFO ] Time to serialize properties into /tmp/LTL14124706670417476051.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/LTL15636151535218712668.gal, -t, CGAL, -LTL, /tmp/LTL14124706670417476051.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/LTL15636151535218712668.gal -t CGAL -LTL /tmp/LTL14124706670417476051.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(u2.Dress>=1)"))))
Formula 0 simplified : !XF"(u2.Dress>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14357687683415257002
[2021-05-17 19:38:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14357687683415257002
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/ltsmin14357687683415257002]
Compilation finished in 183 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14357687683415257002]
Link finished in 53 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/ltsmin14357687683415257002]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-09-04 finished in 46294 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 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 19:38:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s2 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-09-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-05 finished in 106 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 2 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 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 19:38:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [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 26 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-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 s2 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 94 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 33 in 1 ms.
FORMULA SwimmingPool-PT-09-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-06 finished in 171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||(F(!p0) U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 19:38:26] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-09-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7 reset in 101 ms.
Stack based approach found an accepted trace after 112 steps with 0 reset with depth 113 and stack size 113 in 0 ms.
FORMULA SwimmingPool-PT-09-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-07 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||X(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.
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 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (NOT p1), true]
Running random walk in product with property : SwimmingPool-PT-09-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s4 1), p1:(OR (GEQ s6 1) (AND (GEQ s0 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 41042 steps with 0 reset in 49 ms.
FORMULA SwimmingPool-PT-09-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-08 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||F((p1&&X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 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 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:26] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-17 19:38:26] [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 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-09-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 90 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA SwimmingPool-PT-09-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-09 finished in 275 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 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 2 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 19:38:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:27] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 19:38:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:38:27] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 19:38:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 19:38:27] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 19:38:27] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Running random walk in product with property : SwimmingPool-PT-09-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3030 reset in 91 ms.
Stack based approach found an accepted trace after 111 steps with 8 reset with depth 29 and stack size 29 in 0 ms.
FORMULA SwimmingPool-PT-09-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-10 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(!p0)||(F(!p0) U 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.
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 19:38:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:38:27] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:27] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:27] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : SwimmingPool-PT-09-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (OR (LT s3 1) (LT s7 1)) (OR (LT s0 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9 reset in 98 ms.
Product exploration explored 100000 steps with 8 reset in 139 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 7 reset in 78 ms.
Product exploration explored 100000 steps with 6 reset in 129 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 4 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 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 19:38:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:38:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:38:28] [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 6 reset in 133 ms.
Product exploration explored 100000 steps with 7 reset in 236 ms.
[2021-05-17 19:38:28] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:38:28] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:38:28] [INFO ] Time to serialize gal into /tmp/LTL14757236842125463012.gal : 1 ms
[2021-05-17 19:38:28] [INFO ] Time to serialize properties into /tmp/LTL2712529886993056987.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/LTL14757236842125463012.gal, -t, CGAL, -LTL, /tmp/LTL2712529886993056987.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/LTL14757236842125463012.gal -t CGAL -LTL /tmp/LTL2712529886993056987.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(Out>=1)"))||((F("(Out>=1)"))U("(((InBath<1)||(Cabins<1))&&((Entered<1)||(Cabins<1)))"))))))
Formula 0 simplified : !XG(F"(Out>=1)" | (F"(Out>=1)" U "(((InBath<1)||(Cabins<1))&&((Entered<1)||(Cabins<1)))"))
Detected timeout of ITS tools.
[2021-05-17 19:38:43] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:38:43] [INFO ] Applying decomposition
[2021-05-17 19:38:43] [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/graph4914388343451915447.txt, -o, /tmp/graph4914388343451915447.bin, -w, /tmp/graph4914388343451915447.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/graph4914388343451915447.bin, -l, -1, -v, -w, /tmp/graph4914388343451915447.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:38:43] [INFO ] Decomposing Gal with order
[2021-05-17 19:38:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:38:43] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:38:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 19:38:43] [INFO ] Time to serialize gal into /tmp/LTL6584461756632783214.gal : 1 ms
[2021-05-17 19:38:43] [INFO ] Time to serialize properties into /tmp/LTL7086914092464292215.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/LTL6584461756632783214.gal, -t, CGAL, -LTL, /tmp/LTL7086914092464292215.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/LTL6584461756632783214.gal -t CGAL -LTL /tmp/LTL7086914092464292215.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(u0.Out>=1)"))||((F("(u0.Out>=1)"))U("(((u1.InBath<1)||(u2.Cabins<1))&&((u0.Entered<1)||(u2.Cabins<1)))"))))))
Formula 0 simplified : !XG(F"(u0.Out>=1)" | (F"(u0.Out>=1)" U "(((u1.InBath<1)||(u2.Cabins<1))&&((u0.Entered<1)||(u2.Cabins<1)))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6897420136006010007
[2021-05-17 19:38:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6897420136006010007
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/ltsmin6897420136006010007]
Compilation finished in 120 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6897420136006010007]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((<>((LTLAPp0==true))||(<>((LTLAPp0==true)) U (LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6897420136006010007]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-09-11 finished in 46333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1 U 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 19:39:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:39:13] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 19:39:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:39:13] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 19:39:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 19:39:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:39:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-09-12 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s3 1), p1:(OR (AND (GEQ s0 1) (GEQ s6 1)) (GEQ s3 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 2 reset in 97 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA SwimmingPool-PT-09-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-12 finished in 225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:39:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:39:13] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:39:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:39:13] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:39:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:39:13] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-09-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s5 1) (OR (LT s0 1) (LT s7 1))), p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 140 reset in 96 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA SwimmingPool-PT-09-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-13 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&((X(p2)||p1) U (((X(p2)||p4)&&p3)||G((X(p2)||p5))))))], 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.
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 19:39:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:39:14] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:39:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 19:39:14] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 19:39:14] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 19:39:14] [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.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p4) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p5))), (NOT p0), (NOT p2), (OR (AND (NOT p2) (NOT p4) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p5))), (OR (AND (NOT p2) (NOT p4) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p5))), (AND (NOT p5) (NOT p2)), true, (AND (NOT p5) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-09-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p5) (NOT p1)) (AND (NOT p4) (NOT p5) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p5) p1) (AND p3 (NOT p4) p1)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) p5 (NOT p1)) (AND (NOT p4) p5 (NOT p1))), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p3) (NOT p5) (NOT p1)) (AND (NOT p4) (NOT p5) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p5) p1) (AND (NOT p4) (NOT p5) p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p3 (NOT p4) p5 p1), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p3) p5 (NOT p1)) (AND (NOT p4) p5 (NOT p1))), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p5) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p5) (NOT p1) (NOT p2))), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p5) p1 (NOT p2)) (AND (NOT p4) (NOT p5) p1 (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p3 (NOT p4) p5 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p3) p5 (NOT p1) (NOT p2)) (AND (NOT p4) p5 (NOT p1) (NOT p2))), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p5) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p5), acceptance={} source=7 dest: 2}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s8 1) (LT s3 1) (LT s7 1)), p3:(AND (GEQ s3 1) (GEQ s7 1)), p5:(OR (LT s1 1) (LT s8 1)), p1:(OR (LT s1 1) (LT s8 1)), p4:(OR (LT s1 1) (LT s8 1)), p2:(OR (LT s1 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 1 reset in 0 ms.
FORMULA SwimmingPool-PT-09-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-14 finished in 365 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4025589028289353740
[2021-05-17 19:39:14] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2021-05-17 19:39:14] [INFO ] Applying decomposition
[2021-05-17 19:39:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 19:39:14] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2021-05-17 19:39:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 19:39:14] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:39:14] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2021-05-17 19:39:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 19:39:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4025589028289353740
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/ltsmin4025589028289353740]
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/graph15532871439798692543.txt, -o, /tmp/graph15532871439798692543.bin, -w, /tmp/graph15532871439798692543.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/graph15532871439798692543.bin, -l, -1, -v, -w, /tmp/graph15532871439798692543.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:39:14] [INFO ] Decomposing Gal with order
[2021-05-17 19:39:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:39:14] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:39:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 19:39:14] [INFO ] Time to serialize gal into /tmp/LTLFireability2814715873810761650.gal : 1 ms
[2021-05-17 19:39:14] [INFO ] Time to serialize properties into /tmp/LTLFireability17731368453159240709.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/LTLFireability2814715873810761650.gal, -t, CGAL, -LTL, /tmp/LTLFireability17731368453159240709.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/LTLFireability2814715873810761650.gal -t CGAL -LTL /tmp/LTLFireability17731368453159240709.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(F("(u1.Dress>=1)"))))
Formula 0 simplified : !XF"(u1.Dress>=1)"
Compilation finished in 130 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4025589028289353740]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4025589028289353740]
LTSmin run took 76196 ms.
FORMULA SwimmingPool-PT-09-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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([]((<>(!(LTLAPp1==true))||(<>(!(LTLAPp1==true)) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4025589028289353740]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.053: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.053: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.054: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.054: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.188: LTL layer: formula: X([]((<>(!(LTLAPp1==true))||(<>(!(LTLAPp1==true)) U (LTLAPp2==true)))))
pins2lts-mc-linux64( 2/ 8), 0.188: "X([]((<>(!(LTLAPp1==true))||(<>(!(LTLAPp1==true)) U (LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.188: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.183: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.198: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.187: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.187: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.198: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.273: DFS-FIFO for weak LTL, using special progress label 11
pins2lts-mc-linux64( 0/ 8), 0.274: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.274: State length is 10, there are 11 groups
pins2lts-mc-linux64( 0/ 8), 0.274: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.274: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.274: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.274: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.475: ~1 levels ~960 states ~3416 transitions
pins2lts-mc-linux64( 4/ 8), 0.475: ~1 levels ~1920 states ~7280 transitions
pins2lts-mc-linux64( 5/ 8), 0.482: ~1 levels ~3840 states ~16328 transitions
pins2lts-mc-linux64( 3/ 8), 0.485: ~1 levels ~7680 states ~36648 transitions
pins2lts-mc-linux64( 7/ 8), 0.487: ~1 levels ~15360 states ~74344 transitions
pins2lts-mc-linux64( 2/ 8), 0.503: ~1 levels ~30720 states ~151888 transitions
pins2lts-mc-linux64( 3/ 8), 0.517: ~1 levels ~61440 states ~323600 transitions
pins2lts-mc-linux64( 7/ 8), 0.560: ~1 levels ~122880 states ~650056 transitions
pins2lts-mc-linux64( 1/ 8), 0.654: ~1 levels ~245760 states ~1248336 transitions
pins2lts-mc-linux64( 1/ 8), 0.845: ~1 levels ~491520 states ~2527240 transitions
pins2lts-mc-linux64( 6/ 8), 1.148: ~1 levels ~983040 states ~5821504 transitions
pins2lts-mc-linux64( 6/ 8), 2.056: ~1 levels ~1966080 states ~11618792 transitions
pins2lts-mc-linux64( 7/ 8), 3.914: ~1 levels ~3932160 states ~23836536 transitions
pins2lts-mc-linux64( 7/ 8), 7.391: ~1 levels ~7864320 states ~48410248 transitions
pins2lts-mc-linux64( 7/ 8), 14.504: ~1 levels ~15728640 states ~98171448 transitions
pins2lts-mc-linux64( 7/ 8), 31.261: ~1 levels ~31457280 states ~198778664 transitions
pins2lts-mc-linux64( 7/ 8), 66.153: ~1 levels ~62914560 states ~401697968 transitions
pins2lts-mc-linux64( 1/ 8), 124.493: ~722 levels ~125829120 states ~659851736 transitions
pins2lts-mc-linux64( 1/ 8), 166.810: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 166.834:
pins2lts-mc-linux64( 0/ 8), 166.834: mean standard work distribution: 9.4% (states) 3.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 166.834:
pins2lts-mc-linux64( 0/ 8), 166.834: Explored 129944128 states 802363105 transitions, fanout: 6.175
pins2lts-mc-linux64( 0/ 8), 166.834: Total exploration time 166.540 sec (166.510 sec minimum, 166.527 sec on average)
pins2lts-mc-linux64( 0/ 8), 166.834: States per second: 780258, Transitions per second: 4817840
pins2lts-mc-linux64( 0/ 8), 166.834:
pins2lts-mc-linux64( 0/ 8), 166.834: Progress states detected: 125937922
pins2lts-mc-linux64( 0/ 8), 166.834: Redundant explorations: -3.1838
pins2lts-mc-linux64( 0/ 8), 166.834:
pins2lts-mc-linux64( 0/ 8), 166.834: Queue width: 8B, total height: 9474957, memory: 72.29MB
pins2lts-mc-linux64( 0/ 8), 166.834: Tree memory: 1191.1MB, 9.3 B/state, compr.: 22.2%
pins2lts-mc-linux64( 0/ 8), 166.834: Tree fill ratio (roots/leafs): 99.0%/65.0%
pins2lts-mc-linux64( 0/ 8), 166.834: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 166.834: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 166.835: Est. total memory use: 1263.4MB (~1096.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((<>(!(LTLAPp1==true))||(<>(!(LTLAPp1==true)) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4025589028289353740]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((<>(!(LTLAPp1==true))||(<>(!(LTLAPp1==true)) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4025589028289353740]
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 19:59:49] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:59:49] [INFO ] Time to serialize gal into /tmp/LTLFireability12876249122942637407.gal : 0 ms
[2021-05-17 19:59:49] [INFO ] Time to serialize properties into /tmp/LTLFireability13401797821644656882.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/LTLFireability12876249122942637407.gal, -t, CGAL, -LTL, /tmp/LTLFireability13401797821644656882.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/LTLFireability12876249122942637407.gal -t CGAL -LTL /tmp/LTLFireability13401797821644656882.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(Out>=1)"))||((F("(Out>=1)"))U("(((InBath<1)||(Cabins<1))&&((Entered<1)||(Cabins<1)))"))))))
Formula 0 simplified : !XG(F"(Out>=1)" | (F"(Out>=1)" U "(((InBath<1)||(Cabins<1))&&((Entered<1)||(Cabins<1)))"))
Detected timeout of ITS tools.
[2021-05-17 20:20:24] [INFO ] Flatten gal took : 1 ms
[2021-05-17 20:20:24] [INFO ] Input system was already deterministic with 7 transitions.
[2021-05-17 20:20:24] [INFO ] Transformed 9 places.
[2021-05-17 20:20:24] [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:20:24] [INFO ] Time to serialize gal into /tmp/LTLFireability8586843307848465363.gal : 0 ms
[2021-05-17 20:20:24] [INFO ] Time to serialize properties into /tmp/LTLFireability11018689434087262714.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/LTLFireability8586843307848465363.gal, -t, CGAL, -LTL, /tmp/LTLFireability11018689434087262714.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/LTLFireability8586843307848465363.gal -t CGAL -LTL /tmp/LTLFireability11018689434087262714.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G((F("(Out>=1)"))||((F("(Out>=1)"))U("(((InBath<1)||(Cabins<1))&&((Entered<1)||(Cabins<1)))"))))))
Formula 0 simplified : !XG(F"(Out>=1)" | (F"(Out>=1)" U "(((InBath<1)||(Cabins<1))&&((Entered<1)||(Cabins<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-09"
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-09, 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-162106746500781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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