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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K 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.3K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621275747110

Running Version 0
[2021-05-17 18:22:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 18:22:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 18:22:28] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-17 18:22:28] [INFO ] Transformed 9 places.
[2021-05-17 18:22:28] [INFO ] Transformed 7 transitions.
[2021-05-17 18:22:28] [INFO ] Parsed PT model containing 9 places and 7 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 18:22:28] [INFO ] Initial state test concluded for 2 properties.
FORMULA SwimmingPool-PT-07-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:22:28] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-17 18:22:28] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:22:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:22:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:22:29] [INFO ] Computed 3 place invariants in 11 ms
[2021-05-17 18:22:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 18:22:29] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 18:22:29] [INFO ] Flatten gal took : 15 ms
FORMULA SwimmingPool-PT-07-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-07-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 18:22:29] [INFO ] Flatten gal took : 2 ms
[2021-05-17 18:22:29] [INFO ] Input system was already deterministic with 7 transitions.
Incomplete random walk after 100045 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=1667 ) properties (out of 12) seen :11
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:22:29] [INFO ] Computed 3 place invariants in 1 ms
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA SwimmingPool-PT-07-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:22:29] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:22:29] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:22:29] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:22:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:22:29] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:22:29] [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 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-07-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s4 1), p1:(OR (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7499 reset in 200 ms.
Product exploration explored 100000 steps with 7412 reset in 142 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7420 reset in 95 ms.
Product exploration explored 100000 steps with 7456 reset in 174 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 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 5 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 18:22:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:22:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:22:30] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 12422 reset in 217 ms.
Product exploration explored 100000 steps with 12414 reset in 141 ms.
[2021-05-17 18:22:30] [INFO ] Flatten gal took : 2 ms
[2021-05-17 18:22:30] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:22:30] [INFO ] Time to serialize gal into /tmp/LTL859132953478469635.gal : 1 ms
[2021-05-17 18:22:30] [INFO ] Time to serialize properties into /tmp/LTL12566174795564499153.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/LTL859132953478469635.gal, -t, CGAL, -LTL, /tmp/LTL12566174795564499153.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/LTL859132953478469635.gal -t CGAL -LTL /tmp/LTL12566174795564499153.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(Dress>=1)"))||(G("((InBath<1)||(Cabins<1))")))))
Formula 0 simplified : !X(F"(Dress>=1)" | G"((InBath<1)||(Cabins<1))")
Detected timeout of ITS tools.
[2021-05-17 18:22:45] [INFO ] Flatten gal took : 7 ms
[2021-05-17 18:22:45] [INFO ] Applying decomposition
[2021-05-17 18:22:45] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15189303923532584033.txt, -o, /tmp/graph15189303923532584033.bin, -w, /tmp/graph15189303923532584033.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/graph15189303923532584033.bin, -l, -1, -v, -w, /tmp/graph15189303923532584033.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:22:46] [INFO ] Decomposing Gal with order
[2021-05-17 18:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:22:46] [INFO ] Flatten gal took : 22 ms
[2021-05-17 18:22:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 18:22:46] [INFO ] Time to serialize gal into /tmp/LTL17593835385521680500.gal : 1 ms
[2021-05-17 18:22:46] [INFO ] Time to serialize properties into /tmp/LTL8956367092095174633.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/LTL17593835385521680500.gal, -t, CGAL, -LTL, /tmp/LTL8956367092095174633.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/LTL17593835385521680500.gal -t CGAL -LTL /tmp/LTL8956367092095174633.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(u1.Dress>=1)"))||(G("((u2.InBath<1)||(u1.Cabins<1))")))))
Formula 0 simplified : !X(F"(u1.Dress>=1)" | G"((u2.InBath<1)||(u1.Cabins<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17650592317770011775
[2021-05-17 18:23:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17650592317770011775
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/ltsmin17650592317770011775]
Compilation finished in 169 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17650592317770011775]
Link finished in 47 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17650592317770011775]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-07-00 finished in 46763 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:23:16] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:16] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:23:16] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:16] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:23:16] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-07-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(OR (LT s1 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 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 7 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 18:23:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:23:16] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
[2021-05-17 18:23:17] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:23:17] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:23:17] [INFO ] Time to serialize gal into /tmp/LTL10959931882750031465.gal : 1 ms
[2021-05-17 18:23:17] [INFO ] Time to serialize properties into /tmp/LTL14291614533725966169.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/LTL10959931882750031465.gal, -t, CGAL, -LTL, /tmp/LTL14291614533725966169.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/LTL10959931882750031465.gal -t CGAL -LTL /tmp/LTL14291614533725966169.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((WaitBag<1)||(Bags<1))")||(G("((WaitBag>=1)&&(Bags>=1))")))))
Formula 0 simplified : !X("((WaitBag<1)||(Bags<1))" | G"((WaitBag>=1)&&(Bags>=1))")
Detected timeout of ITS tools.
[2021-05-17 18:23:32] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:23:32] [INFO ] Applying decomposition
[2021-05-17 18:23:32] [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/graph3619606601458783379.txt, -o, /tmp/graph3619606601458783379.bin, -w, /tmp/graph3619606601458783379.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/graph3619606601458783379.bin, -l, -1, -v, -w, /tmp/graph3619606601458783379.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:23:32] [INFO ] Decomposing Gal with order
[2021-05-17 18:23:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:23:32] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:23:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 18:23:32] [INFO ] Time to serialize gal into /tmp/LTL14103487078055982283.gal : 1 ms
[2021-05-17 18:23:32] [INFO ] Time to serialize properties into /tmp/LTL4031433693775892307.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/LTL14103487078055982283.gal, -t, CGAL, -LTL, /tmp/LTL4031433693775892307.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/LTL14103487078055982283.gal -t CGAL -LTL /tmp/LTL4031433693775892307.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((u1.WaitBag<1)||(u0.Bags<1))")||(G("((u1.WaitBag>=1)&&(u0.Bags>=1))")))))
Formula 0 simplified : !X("((u1.WaitBag<1)||(u0.Bags<1))" | G"((u1.WaitBag>=1)&&(u0.Bags>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9893669391546746504
[2021-05-17 18:23:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9893669391546746504
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/ltsmin9893669391546746504]
Compilation finished in 98 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9893669391546746504]
Link finished in 35 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(([]((LTLAPp1==true))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9893669391546746504]
LTSmin run took 151 ms.
FORMULA SwimmingPool-PT-07-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-07-01 finished in 31376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
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 18:23:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:23:47] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:47] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:23:47] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:47] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 18:23:47] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : SwimmingPool-PT-07-03 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s6 1), p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-07-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-03 finished in 148 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:23:47] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:47] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-17 18:23:47] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:47] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:23:47] [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 47 ms :[p0, p0]
Running random walk in product with property : SwimmingPool-PT-07-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10237 reset in 63 ms.
Product exploration explored 100000 steps with 10234 reset in 87 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Product exploration explored 100000 steps with 10163 reset in 78 ms.
Product exploration explored 100000 steps with 10244 reset in 90 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[p0, p0]
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 18:23:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:23:48] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:23:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 19059 reset in 83 ms.
Product exploration explored 100000 steps with 19071 reset in 114 ms.
[2021-05-17 18:23:48] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:23:48] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:23:48] [INFO ] Time to serialize gal into /tmp/LTL216475653210352222.gal : 1 ms
[2021-05-17 18:23:48] [INFO ] Time to serialize properties into /tmp/LTL4682450939582492150.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/LTL216475653210352222.gal, -t, CGAL, -LTL, /tmp/LTL4682450939582492150.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/LTL216475653210352222.gal -t CGAL -LTL /tmp/LTL4682450939582492150.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((InBath>=1)&&(Cabins>=1))"))))
Formula 0 simplified : !XF"((InBath>=1)&&(Cabins>=1))"
Detected timeout of ITS tools.
[2021-05-17 18:24:03] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:24:03] [INFO ] Applying decomposition
[2021-05-17 18:24:03] [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/graph13558712347453233611.txt, -o, /tmp/graph13558712347453233611.bin, -w, /tmp/graph13558712347453233611.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/graph13558712347453233611.bin, -l, -1, -v, -w, /tmp/graph13558712347453233611.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:24:03] [INFO ] Decomposing Gal with order
[2021-05-17 18:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:24:03] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 18:24:03] [INFO ] Time to serialize gal into /tmp/LTL17603348565538066452.gal : 0 ms
[2021-05-17 18:24:03] [INFO ] Time to serialize properties into /tmp/LTL3871040475296737819.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/LTL17603348565538066452.gal, -t, CGAL, -LTL, /tmp/LTL3871040475296737819.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/LTL17603348565538066452.gal -t CGAL -LTL /tmp/LTL3871040475296737819.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((u2.InBath>=1)&&(u1.Cabins>=1))"))))
Formula 0 simplified : !XF"((u2.InBath>=1)&&(u1.Cabins>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15488627428626983301
[2021-05-17 18:24:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15488627428626983301
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/ltsmin15488627428626983301]
Compilation finished in 95 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15488627428626983301]
Link finished in 33 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/ltsmin15488627428626983301]
LTSmin run took 1259 ms.
FORMULA SwimmingPool-PT-07-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-07-04 finished in 32269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((X(F(p2))||p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:19] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:19] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:19] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-07-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s5 1) (LT s4 1)), p2:(GEQ s2 1), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Knowledge obtained : [p1, (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 18:24:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:20] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
[2021-05-17 18:24:20] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:24:20] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:24:20] [INFO ] Time to serialize gal into /tmp/LTL487478203243666896.gal : 4 ms
[2021-05-17 18:24:20] [INFO ] Time to serialize properties into /tmp/LTL359331709337625657.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/LTL487478203243666896.gal, -t, CGAL, -LTL, /tmp/LTL359331709337625657.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/LTL487478203243666896.gal -t CGAL -LTL /tmp/LTL359331709337625657.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(Dressed>=1)"))||(X(("((Dressed<1)||(Dress<1))")||(X(F("(Undress>=1)")))))))
Formula 0 simplified : !(G"(Dressed>=1)" | X("((Dressed<1)||(Dress<1))" | XF"(Undress>=1)"))
Detected timeout of ITS tools.
[2021-05-17 18:24:35] [INFO ] Flatten gal took : 5 ms
[2021-05-17 18:24:35] [INFO ] Applying decomposition
[2021-05-17 18:24:35] [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/graph8377952225952004722.txt, -o, /tmp/graph8377952225952004722.bin, -w, /tmp/graph8377952225952004722.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/graph8377952225952004722.bin, -l, -1, -v, -w, /tmp/graph8377952225952004722.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:24:35] [INFO ] Decomposing Gal with order
[2021-05-17 18:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:24:35] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 18:24:35] [INFO ] Time to serialize gal into /tmp/LTL12956512805255778222.gal : 1 ms
[2021-05-17 18:24:35] [INFO ] Time to serialize properties into /tmp/LTL1420507064975763537.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/LTL12956512805255778222.gal, -t, CGAL, -LTL, /tmp/LTL1420507064975763537.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/LTL12956512805255778222.gal -t CGAL -LTL /tmp/LTL1420507064975763537.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(u2.Dressed>=1)"))||(X(("((u2.Dressed<1)||(u2.Dress<1))")||(X(F("(u1.Undress>=1)")))))))
Formula 0 simplified : !(G"(u2.Dressed>=1)" | X("((u2.Dressed<1)||(u2.Dress<1))" | XF"(u1.Undress>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16277328833327619352
[2021-05-17 18:24:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16277328833327619352
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/ltsmin16277328833327619352]
Compilation finished in 97 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16277328833327619352]
Link finished in 35 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||X((X(<>((LTLAPp2==true)))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin16277328833327619352]
LTSmin run took 290 ms.
FORMULA SwimmingPool-PT-07-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-07-05 finished in 31524 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 6 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:51] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:51] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-17 18:24:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:51] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 26 ms :[p0]
Running random walk in product with property : SwimmingPool-PT-07-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} 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 67 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA SwimmingPool-PT-07-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-06 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 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 18:24:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:51] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:51] [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.
[2021-05-17 18:24:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:51] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-07-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SwimmingPool-PT-07-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-07 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(!p0)||(!p0&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:51] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:51] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-17 18:24:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:51] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : SwimmingPool-PT-07-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s4 1) (OR (LT s0 1) (LT s7 1))) (LT s4 1)), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2140 reset in 81 ms.
Stack based approach found an accepted trace after 406 steps with 14 reset with depth 89 and stack size 89 in 1 ms.
FORMULA SwimmingPool-PT-07-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-09 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:51] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-17 18:24:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 18:24:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:52] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-07-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1)), p1:(OR (LT s2 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 387 reset in 74 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA SwimmingPool-PT-07-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-10 finished in 208 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 18:24:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:52] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 18:24:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:52] [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.
[2021-05-17 18:24:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 18:24:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:24:52] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-07-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 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 451 reset in 73 ms.
Stack based approach found an accepted trace after 80 steps with 5 reset with depth 40 and stack size 40 in 0 ms.
FORMULA SwimmingPool-PT-07-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-11 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 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 18:24:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:52] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 18:24:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:52] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-17 18:24:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 18:24:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:52] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-07-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s6 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 0 ms.
FORMULA SwimmingPool-PT-07-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-13 finished in 205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p0)||X(!p1)) U (p2||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:52] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:24:52] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:24:52] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 18:24:52] [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 142 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1), true, (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-07-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s4 1), p0:(AND (GEQ s1 1) (GEQ s8 1)), p1:(OR (LT s3 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-07-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-14 finished in 187 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11347014687694388588
[2021-05-17 18:24:52] [INFO ] Applying decomposition
[2021-05-17 18:24:52] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2021-05-17 18:24:52] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:24:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:24:52] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2021-05-17 18:24:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:24:52] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
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/graph9453031291594628694.txt, -o, /tmp/graph9453031291594628694.bin, -w, /tmp/graph9453031291594628694.weights], workingDir=null]
[2021-05-17 18:24:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:24:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11347014687694388588
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9453031291594628694.bin, -l, -1, -v, -w, /tmp/graph9453031291594628694.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:24:52] [INFO ] Decomposing Gal with order
[2021-05-17 18:24:52] [INFO ] Rewriting arrays to variables to allow decomposition.
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/ltsmin11347014687694388588]
[2021-05-17 18:24:52] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:24:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 18:24:52] [INFO ] Time to serialize gal into /tmp/LTLFireability1777987104946124557.gal : 0 ms
[2021-05-17 18:24:52] [INFO ] Time to serialize properties into /tmp/LTLFireability16866567528509686370.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/LTLFireability1777987104946124557.gal, -t, CGAL, -LTL, /tmp/LTLFireability16866567528509686370.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/LTLFireability1777987104946124557.gal -t CGAL -LTL /tmp/LTLFireability16866567528509686370.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(u0.Dress>=1)"))||(G(!("((u0.InBath>=1)&&(u2.Cabins>=1))"))))))
Formula 0 simplified : !X(F"(u0.Dress>=1)" | G!"((u0.InBath>=1)&&(u2.Cabins>=1))")
Compilation finished in 121 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11347014687694388588]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11347014687694388588]
LTSmin run took 23962 ms.
FORMULA SwimmingPool-PT-07-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621275918089

--------------------
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-07"
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-07, 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-162106746400765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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