fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r258-tall-165303545700388
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SwimmingPool-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2041.735 364163.00 1334962.00 568.40 TFFFTFTFFFFFFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545700388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SwimmingPool-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545700388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 5.9K Apr 29 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 9 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.9K May 10 09:34 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-04-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653126398327

Running Version 202205111006
[2022-05-21 09:46:39] [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]
[2022-05-21 09:46:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 09:46:39] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2022-05-21 09:46:39] [INFO ] Transformed 9 places.
[2022-05-21 09:46:39] [INFO ] Transformed 7 transitions.
[2022-05-21 09:46:39] [INFO ] Parsed PT model containing 9 places and 7 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SwimmingPool-PT-04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:46:39] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 09:46:39] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:39] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 09:46:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:39] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 09:46:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2022-05-21 09:46:40] [INFO ] Flatten gal took : 12 ms
[2022-05-21 09:46:40] [INFO ] Flatten gal took : 3 ms
[2022-05-21 09:46:40] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 246 steps, including 0 resets, run visited all 10 properties in 12 ms. (steps per millisecond=20 )
FORMULA SwimmingPool-PT-04-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:46:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:40] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s7 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-04-LTLFireability-00 finished in 645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(((F(p1) U p1)||!p0))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:46:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:41] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:46:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:46:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, 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-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-01 finished in 356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
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 12 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:46:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:41] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:46:41] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:46:41] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-21 09:46:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:46:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1)), p1:(OR (LT s0 1) (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 938 reset in 253 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 19 in 1 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-03 finished in 445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&!p1) U (!G(!X(p2))||G(p1)))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:46:41] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:46:41] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:41] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:46:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 715 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(AND (GEQ s3 1) (GEQ s7 1)), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8200 reset in 121 ms.
Product exploration explored 100000 steps with 8074 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 300 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 309 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 403 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:46:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-21 09:46:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:46:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-21 09:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:46:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-21 09:46:44] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:46:44] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:46:44] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:46:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 09:46:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:46:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:46:44] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 09:46:44] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:46:44] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:46:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:46:44] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:46:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:46:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 246 steps, including 0 resets, run visited all 5 properties in 11 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 326 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:46:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:46:45] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:46:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:46:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:46:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:46:45] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:46:45] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:46:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:46:46] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:46:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:46:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:46:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:46:46] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:46:46] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 8121 reset in 129 ms.
Product exploration explored 100000 steps with 8241 reset in 82 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 1024 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 5 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-21 09:46:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:46:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:46:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 7/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 8807 reset in 162 ms.
Product exploration explored 100000 steps with 8834 reset in 154 ms.
Built C files in :
/tmp/ltsmin3240734101857101413
[2022-05-21 09:46:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3240734101857101413
Running compilation step : cd /tmp/ltsmin3240734101857101413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin3240734101857101413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3240734101857101413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2078781416282372484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:47:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:47:03] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:47:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:47:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:47:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:47:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin728216258987175445
[2022-05-21 09:47:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin728216258987175445
Running compilation step : cd /tmp/ltsmin728216258987175445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin728216258987175445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin728216258987175445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13174723537176817362.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 09:47:18] [INFO ] Flatten gal took : 2 ms
[2022-05-21 09:47:18] [INFO ] Flatten gal took : 2 ms
[2022-05-21 09:47:18] [INFO ] Time to serialize gal into /tmp/LTL4203128866876967798.gal : 1 ms
[2022-05-21 09:47:18] [INFO ] Time to serialize properties into /tmp/LTL8877091307795818138.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4203128866876967798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8877091307795818138.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4203128...266
Read 1 LTL properties
Checking formula 0 : !((X(((F("((InBath>=1)&&(Cabins>=1))"))&&(!("((WaitBag>=1)&&(Bags>=1))")))U((!(G(!(X("(Dressed>=1)")))))||(G("((WaitBag>=1)&&(Bags>=1)...163
Formula 0 simplified : !X((!"((WaitBag>=1)&&(Bags>=1))" & F"((InBath>=1)&&(Cabins>=1))") U (!G!X"(Dressed>=1)" | G"((WaitBag>=1)&&(Bags>=1))"))
Detected timeout of ITS tools.
[2022-05-21 09:47:33] [INFO ] Flatten gal took : 2 ms
[2022-05-21 09:47:33] [INFO ] Applying decomposition
[2022-05-21 09:47:33] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5181698109911272183.txt' '-o' '/tmp/graph5181698109911272183.bin' '-w' '/tmp/graph5181698109911272183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5181698109911272183.bin' '-l' '-1' '-v' '-w' '/tmp/graph5181698109911272183.weights' '-q' '0' '-e' '0.001'
[2022-05-21 09:47:33] [INFO ] Decomposing Gal with order
[2022-05-21 09:47:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 09:47:33] [INFO ] Flatten gal took : 25 ms
[2022-05-21 09:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-21 09:47:33] [INFO ] Time to serialize gal into /tmp/LTL9694453279188051740.gal : 4 ms
[2022-05-21 09:47:33] [INFO ] Time to serialize properties into /tmp/LTL16563617537840075981.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9694453279188051740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16563617537840075981.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9694453...246
Read 1 LTL properties
Checking formula 0 : !((X(((F("((u0.InBath>=1)&&(u2.Cabins>=1))"))&&(!("((u2.WaitBag>=1)&&(u0.Bags>=1))")))U((!(G(!(X("(u1.Dressed>=1)")))))||(G("((u2.Wait...184
Formula 0 simplified : !X((!"((u2.WaitBag>=1)&&(u0.Bags>=1))" & F"((u0.InBath>=1)&&(u2.Cabins>=1))") U (!G!X"(u1.Dressed>=1)" | G"((u2.WaitBag>=1)&&(u0.Bag...164
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13980884306952697924
[2022-05-21 09:47:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13980884306952697924
Running compilation step : cd /tmp/ltsmin13980884306952697924;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin13980884306952697924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13980884306952697924;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((<>((LTLAPp0==true))&&!(LTLAPp1==true)) U (![](!X((LTLAPp2==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-04-LTLFireability-04 finished in 81884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 3 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:48:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:03] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:48:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:03] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-21 09:48:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:48:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { 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, 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 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-05 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:48:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:03] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:48:03] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 09:48:03] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:48:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:03] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s5 1), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 14 reset in 0 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-07 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0))) U p1))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:04] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:48:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s4 1) (GEQ s2 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-08 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:48:04] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:48:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-21 09:48:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:04] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-09 automaton TGBA Formula[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:(LT s3 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 4370 reset in 88 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-09 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:04] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-21 09:48:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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 83 ms.
Stack based approach found an accepted trace after 1983 steps with 0 reset with depth 1984 and stack size 1847 in 3 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-10 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X(X(p0))&&G(F(X(F(X(X(p1)))))))))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:04] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-21 09:48:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:48:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:48:04] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s6 1)), p1:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 315 reset in 112 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 0 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-11 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||G(p1)) U !(!p0 U p1)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:48:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:05] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:48:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:48:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) p1), p1, p1, p1, true]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s4 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-04-LTLFireability-12 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||F(X(G(p1)))||F(p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 09:48:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:05] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:48:05] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:48:05] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:48:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:48:05] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s5 1), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-04-LTLFireability-14 finished in 360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&!p1) U (!G(!X(p2))||G(p1)))))'
[2022-05-21 09:48:05] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11392137126174652220
[2022-05-21 09:48:05] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-21 09:48:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:48:05] [INFO ] Applying decomposition
[2022-05-21 09:48:05] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-21 09:48:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:48:05] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-21 09:48:05] [INFO ] Flatten gal took : 1 ms
[2022-05-21 09:48:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:48:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11392137126174652220
Running compilation step : cd /tmp/ltsmin11392137126174652220;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13917147992227795892.txt' '-o' '/tmp/graph13917147992227795892.bin' '-w' '/tmp/graph13917147992227795892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13917147992227795892.bin' '-l' '-1' '-v' '-w' '/tmp/graph13917147992227795892.weights' '-q' '0' '-e' '0.001'
[2022-05-21 09:48:05] [INFO ] Decomposing Gal with order
[2022-05-21 09:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 09:48:05] [INFO ] Flatten gal took : 1 ms
[2022-05-21 09:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 09:48:05] [INFO ] Time to serialize gal into /tmp/LTLFireability17212395914065201827.gal : 1 ms
[2022-05-21 09:48:05] [INFO ] Time to serialize properties into /tmp/LTLFireability7305502465313780047.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17212395914065201827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7305502465313780047.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(((F("((u2.InBath>=1)&&(u1.Cabins>=1))"))&&(!("((u0.WaitBag>=1)&&(u2.Bags>=1))")))U((!(G(!(X("(u1.Dressed>=1)")))))||(G("((u0.Wait...184
Formula 0 simplified : !X((!"((u0.WaitBag>=1)&&(u2.Bags>=1))" & F"((u2.InBath>=1)&&(u1.Cabins>=1))") U (!G!X"(u1.Dressed>=1)" | G"((u0.WaitBag>=1)&&(u2.Bag...164
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin11392137126174652220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin11392137126174652220;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((<>((LTLAPp0==true))&&!(LTLAPp1==true)) U (![](!X((LTLAPp2==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 276500 ms.
FORMULA SwimmingPool-PT-04-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 363004 ms.

BK_STOP 1653126762490

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-04"
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-04, 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 r258-tall-165303545700388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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