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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 6.5K Apr 29 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 12:51 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.8K May 9 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:14 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-09-LTLCardinality-00
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-01
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-02
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-03
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-04
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-05
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-06
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-07
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-08
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-09
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-10
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-11
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-12
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-13
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-14
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653133277849

Running Version 202205111006
[2022-05-21 11:41:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 11:41:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 11:41:19] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2022-05-21 11:41:19] [INFO ] Transformed 9 places.
[2022-05-21 11:41:19] [INFO ] Transformed 7 transitions.
[2022-05-21 11:41:19] [INFO ] Parsed PT model containing 9 places and 7 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA SwimmingPool-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLCardinality-09 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 11:41:19] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 11:41:19] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 11:41:19] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:19] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 11:41:19] [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.
Support contains 9 out of 9 places after structural reductions.
[2022-05-21 11:41:19] [INFO ] Flatten gal took : 13 ms
[2022-05-21 11:41:19] [INFO ] Flatten gal took : 3 ms
[2022-05-21 11:41:19] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 1275 steps, including 0 resets, run visited all 14 properties in 25 ms. (steps per millisecond=51 )
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' '!(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.
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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 11 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 11:41:19] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 11:41:19] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:41:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 11:41:19] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-21 11:41:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:41:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 11:41:19] [INFO ] Dead Transitions using invariants and state equation in 27 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 141 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s4)], 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 184 ms.
Stack based approach found an accepted trace after 14231 steps with 0 reset with depth 14232 and stack size 13126 in 20 ms.
FORMULA SwimmingPool-PT-09-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLCardinality-00 finished in 519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0)) U X(!p0)))'
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 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 11:41:20] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 11:41:20] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:20] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 11:41:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:20] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 11:41:20] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : SwimmingPool-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5 s3)], 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 97 ms.
Product exploration explored 100000 steps with 50000 reset in 97 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-09-LTLCardinality-01 finished in 475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(X(p0)))||p1) U (X(p2)&&G(p3))))'
Support contains 6 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 11:41:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:20] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:20] [INFO ] Implicit Places using invariants and state equation in 29 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 11:41:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:20] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
Running random walk in product with property : SwimmingPool-PT-09-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p3, acceptance={0} source=0 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=p3, acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=5 dest: 2}, { cond=(AND p3 p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(LEQ 3 s8), p1:(LEQ s3 s6), p0:(LEQ s7 s4), p2:(GT s2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12 reset in 169 ms.
Product exploration explored 100000 steps with 10 reset in 130 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 p3 p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND p3 (NOT p2))), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND p3 p1)), (X (AND p3 (NOT p0) (NOT p2))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X p3), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p3 p1))), (X (X (AND p3 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 1892 ms. Reduced automaton from 7 states, 27 edges and 4 AP to 7 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
Finished random walk after 3018 steps, including 0 resets, run visited all 14 properties in 17 ms. (steps per millisecond=177 )
Knowledge obtained : [(AND p3 p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND p3 (NOT p2))), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND p3 p1)), (X (AND p3 (NOT p0) (NOT p2))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X p3), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p3 p1))), (X (X (AND p3 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F p0), (F (AND (NOT p1) p3)), (F (NOT (AND p1 p3))), (F (NOT (AND (NOT p2) p3))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p0) p3))), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p0) (NOT p3))), (F (AND p1 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) p3))]
Knowledge based reduction with 30 factoid took 1836 ms. Reduced automaton from 7 states, 27 edges and 4 AP to 7 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 11:41:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 11:41:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 11:41:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 11:41:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-21 11:41:26] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 11:41:26] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 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 11:41:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:26] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:26] [INFO ] Dead Transitions using invariants and state equation in 30 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 p3 p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (AND p1 p3)), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p2) (NOT p0) p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p3), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p2) p3))), true, (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 1559 ms. Reduced automaton from 7 states, 27 edges and 4 AP to 7 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
Incomplete random walk after 10065 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=592 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:28] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 11:41:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:41:28] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 11:41:28] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-21 11:41:28] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 443 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=147 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p3 p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (AND p1 p3)), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p2) (NOT p0) p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p3), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p2) p3))), true, (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p3))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F p0), (F (AND (NOT p1) p3)), (F (NOT (AND p1 p3))), (F (NOT (AND p3 (NOT p2)))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p0) p3 (NOT p2)))), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p0) (NOT p3))), (F (AND p1 (NOT p0) (NOT p3))), (F (AND (NOT p1) p3 (NOT p2)))]
Knowledge based reduction with 30 factoid took 1771 ms. Reduced automaton from 7 states, 27 edges and 4 AP to 7 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 11:41:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-21 11:41:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 11:41:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 11:41:30] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-21 11:41:30] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 11:41:30] [INFO ] Added : 3 causal constraints over 1 iterations in 23 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
Product exploration explored 100000 steps with 10 reset in 104 ms.
Product exploration explored 100000 steps with 9 reset in 176 ms.
Applying partial POR strategy [false, true, true, true, false, true, false]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3)]
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_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.
[2022-05-21 11:41:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 9 reset in 120 ms.
Product exploration explored 100000 steps with 13 reset in 133 ms.
Built C files in :
/tmp/ltsmin14562209061964139590
[2022-05-21 11:41:32] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14562209061964139590
Running compilation step : cd /tmp/ltsmin14562209061964139590;'/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 155 ms.
Running link step : cd /tmp/ltsmin14562209061964139590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14562209061964139590;'/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/stateBased765824824817438700.hoa' '--buchi-type=spotba'
LTSmin run took 581 ms.
FORMULA SwimmingPool-PT-09-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-09-LTLCardinality-07 finished in 12419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 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
[2022-05-21 11:41:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:33] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:41:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:33] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-21 11:41:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:41:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:33] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLCardinality-08 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:(OR (LEQ 2 s7) (LEQ s2 s6))], 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 5 reset in 92 ms.
Product exploration explored 100000 steps with 4 reset in 119 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 : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 410 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=410 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:41:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:34] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:41:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-21 11:41:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:41:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:34] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 410 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=205 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 82 ms.
Product exploration explored 100000 steps with 2 reset in 96 ms.
Built C files in :
/tmp/ltsmin7524796279699428960
[2022-05-21 11:41:34] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 11:41:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:41:34] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 11:41:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:41:34] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 11:41:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:41:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7524796279699428960
Running compilation step : cd /tmp/ltsmin7524796279699428960;'/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 81 ms.
Running link step : cd /tmp/ltsmin7524796279699428960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin7524796279699428960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15269839054274440797.hoa' '--buchi-type=spotba'
LTSmin run took 262 ms.
FORMULA SwimmingPool-PT-09-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-09-LTLCardinality-08 finished in 1993 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)&&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 11:41:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:35] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:41:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-21 11:41:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:41:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:35] [INFO ] Dead Transitions using invariants and state equation in 25 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 38 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s4), p1:(LEQ s2 s4)], 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 71 ms.
Stack based approach found an accepted trace after 15325 steps with 0 reset with depth 15326 and stack size 14261 in 13 ms.
FORMULA SwimmingPool-PT-09-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLCardinality-10 finished in 220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
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 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 11:41:35] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 11:41:35] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:35] [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 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s4 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-09-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLCardinality-11 finished in 194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(!(p1 U (p2 U p3))&&!p1))))'
Support contains 6 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 11:41:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:35] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:35] [INFO ] Implicit Places using invariants and state equation in 18 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
[2022-05-21 11:41:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p3)), (OR (AND (NOT p0) p1) (AND (NOT p0) p3)), (AND (NOT p0) p3)]
Running random walk in product with property : SwimmingPool-PT-09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s5 s1), p1:(LEQ s7 s2), p3:(LEQ 2 s0), p2:(LEQ 3 s3)], 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]]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 62 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 p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3))))
Knowledge based reduction with 6 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-09-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-09-LTLCardinality-12 finished in 473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 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 11:41:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:36] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:36] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:36] [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.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLCardinality-13 finished in 169 ms.
All properties solved by simple procedures.
Total runtime 17303 ms.

BK_STOP 1653133296420

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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