Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291600212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 ClientsAndServers-PT-N0050P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291600212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 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 ClientsAndServers-PT-N0050P0-00
FORMULA_NAME ClientsAndServers-PT-N0050P0-01
FORMULA_NAME ClientsAndServers-PT-N0050P0-02
FORMULA_NAME ClientsAndServers-PT-N0050P0-03
FORMULA_NAME ClientsAndServers-PT-N0050P0-04
FORMULA_NAME ClientsAndServers-PT-N0050P0-05
FORMULA_NAME ClientsAndServers-PT-N0050P0-06
FORMULA_NAME ClientsAndServers-PT-N0050P0-07
FORMULA_NAME ClientsAndServers-PT-N0050P0-08
FORMULA_NAME ClientsAndServers-PT-N0050P0-09
FORMULA_NAME ClientsAndServers-PT-N0050P0-10
FORMULA_NAME ClientsAndServers-PT-N0050P0-11
FORMULA_NAME ClientsAndServers-PT-N0050P0-12
FORMULA_NAME ClientsAndServers-PT-N0050P0-13
FORMULA_NAME ClientsAndServers-PT-N0050P0-14
FORMULA_NAME ClientsAndServers-PT-N0050P0-15

=== Now, execution of the tool begins

BK_START 1620567855402

Running Version 0
[2021-05-09 13:44:17] [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]
[2021-05-09 13:44:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:44:17] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-09 13:44:17] [INFO ] Transformed 25 places.
[2021-05-09 13:44:17] [INFO ] Transformed 18 transitions.
[2021-05-09 13:44:17] [INFO ] Parsed PT model containing 25 places and 18 transitions in 48 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 13:44:17] [INFO ] Initial state test concluded for 2 properties.
FORMULA ClientsAndServers-PT-N0050P0-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 9 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:44:17] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-09 13:44:17] [INFO ] Implicit Places using invariants in 121 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 13:44:17] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 13:44:17] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 13:44:17] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-09 13:44:17] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
[2021-05-09 13:44:17] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 13:44:17] [INFO ] Flatten gal took : 15 ms
FORMULA ClientsAndServers-PT-N0050P0-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 13:44:17] [INFO ] Flatten gal took : 3 ms
[2021-05-09 13:44:17] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 4037 steps, including 0 resets, run visited all 17 properties in 9 ms. (steps per millisecond=448 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:17] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-09 13:44:17] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:44:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:17] [INFO ] Computed 3 place invariants in 10 ms
[2021-05-09 13:44:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT s5 s16), p0:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0050P0-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-00 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 20 transition count 8
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 10 transition count 7
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 25 place count 9 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 29 place count 7 transition count 5
Applied a total of 29 rules in 10 ms. Remains 7 /23 variables (removed 16) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-09 13:44:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:44:18] [INFO ] Implicit Places using invariants in 16 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-09 13:44:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:44:18] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 13:44:18] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 6/23 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-09 13:44:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:44:18] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 13:44:18] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s5)], 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 2 reset in 145 ms.
Stack based approach found an accepted trace after 145 steps with 0 reset with depth 146 and stack size 137 in 1 ms.
FORMULA ClientsAndServers-PT-N0050P0-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-01 finished in 259 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&X(p1)))&&X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 1 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:44:18] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:44:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:44:18] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s15 s0), p1:(LEQ s8 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 49973 steps with 0 reset in 74 ms.
FORMULA ClientsAndServers-PT-N0050P0-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-02 finished in 270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:44:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:44:18] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:44:18] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-09 13:44:18] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:44:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:44:18] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT s15 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1407 reset in 127 ms.
Product exploration explored 100000 steps with 1740 reset in 206 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1345 reset in 166 ms.
Product exploration explored 100000 steps with 1982 reset in 151 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 18 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 18 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 18 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 16 transition count 13
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 16 transition count 13
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 24 rules in 6 ms. Remains 16 /21 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 13:44:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2021-05-09 13:44:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:44:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 13/18 transitions.
Product exploration explored 100000 steps with 15202 reset in 177 ms.
Stack based approach found an accepted trace after 82 steps with 10 reset with depth 11 and stack size 7 in 0 ms.
FORMULA ClientsAndServers-PT-N0050P0-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-04 finished in 1504 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:44:20] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:20] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-09 13:44:20] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:44:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:44:20] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, true, p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=p0, acceptance={} source=5 dest: 0}], [{ cond=p0, acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(GT s4 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 76 ms.
Product exploration explored 100000 steps with 33333 reset in 78 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, true, p0, p0, p0]
Product exploration explored 100000 steps with 33333 reset in 54 ms.
Product exploration explored 100000 steps with 33333 reset in 59 ms.
Applying partial POR strategy [true, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 170 ms :[p0, p0, p0, true, p0, p0, p0]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 8 place count 20 transition count 18
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 20 transition count 18
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 15 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 14 transition count 12
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 14 transition count 12
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 25 rules in 3 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2021-05-09 13:44:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2021-05-09 13:44:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:44:21] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/20 places, 12/18 transitions.
Product exploration explored 100000 steps with 33333 reset in 81 ms.
Product exploration explored 100000 steps with 33333 reset in 85 ms.
[2021-05-09 13:44:21] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:44:21] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:44:21] [INFO ] Time to serialize gal into /tmp/LTL17718243891049043393.gal : 1 ms
[2021-05-09 13:44:21] [INFO ] Time to serialize properties into /tmp/LTL16855306983770726548.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17718243891049043393.gal, -t, CGAL, -LTL, /tmp/LTL16855306983770726548.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17718243891049043393.gal -t CGAL -LTL /tmp/LTL16855306983770726548.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(CA>Si)")U(X(X("(CA<=Si)")))))
Formula 0 simplified : !("(CA>Si)" U XX"(CA<=Si)")
Detected timeout of ITS tools.
[2021-05-09 13:44:36] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:44:36] [INFO ] Applying decomposition
[2021-05-09 13:44:36] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7665956849924606913.txt, -o, /tmp/graph7665956849924606913.bin, -w, /tmp/graph7665956849924606913.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7665956849924606913.bin, -l, -1, -v, -w, /tmp/graph7665956849924606913.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:44:36] [INFO ] Decomposing Gal with order
[2021-05-09 13:44:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:44:36] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 13:44:36] [INFO ] Flatten gal took : 44 ms
[2021-05-09 13:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 13:44:36] [INFO ] Time to serialize gal into /tmp/LTL15736551233185931704.gal : 1 ms
[2021-05-09 13:44:36] [INFO ] Time to serialize properties into /tmp/LTL2667070962693297313.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15736551233185931704.gal, -t, CGAL, -LTL, /tmp/LTL2667070962693297313.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15736551233185931704.gal -t CGAL -LTL /tmp/LTL2667070962693297313.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(gu1.CA>gu1.Si)")U(X(X("(gu1.CA<=gu1.Si)")))))
Formula 0 simplified : !("(gu1.CA>gu1.Si)" U XX"(gu1.CA<=gu1.Si)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9467068027725400574
[2021-05-09 13:44:51] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9467068027725400574
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9467068027725400574]
Compilation finished in 215 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9467068027725400574]
Link finished in 56 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp0==true) U X(X(!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9467068027725400574]
LTSmin run took 679 ms.
FORMULA ClientsAndServers-PT-N0050P0-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0050P0-05 finished in 32325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F((p0&&F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 11 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 21 place count 11 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 8 transition count 6
Applied a total of 27 rules in 2 ms. Remains 8 /23 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:44:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:44:52] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:44:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:44:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-09 13:44:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:44:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:44:52] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s1 s6), p0:(LEQ 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 65 ms.
Product exploration explored 100000 steps with 1 reset in 112 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 57 ms.
Product exploration explored 100000 steps with 1 reset in 67 ms.
[2021-05-09 13:44:52] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:44:53] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:44:53] [INFO ] Time to serialize gal into /tmp/LTL1750786869053229253.gal : 3 ms
[2021-05-09 13:44:53] [INFO ] Time to serialize properties into /tmp/LTL8975970332263910809.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1750786869053229253.gal, -t, CGAL, -LTL, /tmp/LTL8975970332263910809.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1750786869053229253.gal -t CGAL -LTL /tmp/LTL8975970332263910809.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Ci>=2)")||(F(("(Ci>=2)")&&(F("(CA>Si)"))))))))
Formula 0 simplified : !FG("(Ci>=2)" | F("(Ci>=2)" & F"(CA>Si)"))
Detected timeout of ITS tools.
[2021-05-09 13:45:08] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:45:08] [INFO ] Applying decomposition
[2021-05-09 13:45:08] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7310176972421577199.txt, -o, /tmp/graph7310176972421577199.bin, -w, /tmp/graph7310176972421577199.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7310176972421577199.bin, -l, -1, -v, -w, /tmp/graph7310176972421577199.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:45:08] [INFO ] Decomposing Gal with order
[2021-05-09 13:45:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:45:08] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 13:45:08] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:45:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-09 13:45:08] [INFO ] Time to serialize gal into /tmp/LTL15331236828322593775.gal : 1 ms
[2021-05-09 13:45:08] [INFO ] Time to serialize properties into /tmp/LTL3812233861084766822.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15331236828322593775.gal, -t, CGAL, -LTL, /tmp/LTL3812233861084766822.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15331236828322593775.gal -t CGAL -LTL /tmp/LTL3812233861084766822.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gi1.gu2.Ci>=2)")||(F(("(gi1.gu2.Ci>=2)")&&(F("(gu0.CA>gu0.Si)"))))))))
Formula 0 simplified : !FG("(gi1.gu2.Ci>=2)" | F("(gi1.gu2.Ci>=2)" & F"(gu0.CA>gu0.Si)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14538375282571643401
[2021-05-09 13:45:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14538375282571643401
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14538375282571643401]
Compilation finished in 92 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14538375282571643401]
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([](((LTLAPp0==true)||<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14538375282571643401]
LTSmin run took 215 ms.
FORMULA ClientsAndServers-PT-N0050P0-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0050P0-07 finished in 31055 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(F(p1))&&(p1||F(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:45:23] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-09 13:45:23] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:45:23] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:45:23] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:45:23] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:45:23] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s19), p1:(GT s18 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 332 reset in 95 ms.
Stack based approach found an accepted trace after 40391 steps with 224 reset with depth 212 and stack size 212 in 48 ms.
FORMULA ClientsAndServers-PT-N0050P0-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-12 finished in 316 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 23 place count 10 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 8 transition count 6
Applied a total of 27 rules in 1 ms. Remains 8 /23 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:45:23] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:45:23] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:45:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:45:23] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-09 13:45:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:45:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:45:23] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT s3 s7), p0:(LEQ 3 s1)], 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 1252 reset in 67 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA ClientsAndServers-PT-N0050P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-13 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0&&X(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 1 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:45:23] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:45:23] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:45:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:45:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:45:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:45:24] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-14 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 s16), p1:(GT s0 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 579 reset in 87 ms.
Stack based approach found an accepted trace after 78364 steps with 438 reset with depth 80 and stack size 80 in 76 ms.
FORMULA ClientsAndServers-PT-N0050P0-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-14 finished in 424 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F(p1)||X(G((p0||X((X(p2) U (p0&&X(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 1 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:45:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:45:24] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:45:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:45:24] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:45:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:45:24] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-15 automaton TGBA [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={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s12 s13), p1:(LEQ s7 s2), p2:(AND (LEQ s12 s13) (LEQ 1 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1071 reset in 83 ms.
Product exploration explored 100000 steps with 971 reset in 91 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 1084 reset in 83 ms.
Product exploration explored 100000 steps with 1055 reset in 92 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 5 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 20 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 19 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 19 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 6 ms. Remains 19 /20 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2021-05-09 13:45:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-09 13:45:25] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 13:45:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/20 places, 17/18 transitions.
Product exploration explored 100000 steps with 1015 reset in 107 ms.
Stack based approach found an accepted trace after 19914 steps with 196 reset with depth 70 and stack size 16 in 23 ms.
FORMULA ClientsAndServers-PT-N0050P0-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-15 finished in 1240 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620567925874

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination 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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0050P0"
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 ClientsAndServers-PT-N0050P0, 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 r045-oct2-162038291600212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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