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-162038291600220.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-N0100P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291600220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 173K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.9K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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-N0100P0-00
FORMULA_NAME ClientsAndServers-PT-N0100P0-01
FORMULA_NAME ClientsAndServers-PT-N0100P0-02
FORMULA_NAME ClientsAndServers-PT-N0100P0-03
FORMULA_NAME ClientsAndServers-PT-N0100P0-04
FORMULA_NAME ClientsAndServers-PT-N0100P0-05
FORMULA_NAME ClientsAndServers-PT-N0100P0-06
FORMULA_NAME ClientsAndServers-PT-N0100P0-07
FORMULA_NAME ClientsAndServers-PT-N0100P0-08
FORMULA_NAME ClientsAndServers-PT-N0100P0-09
FORMULA_NAME ClientsAndServers-PT-N0100P0-10
FORMULA_NAME ClientsAndServers-PT-N0100P0-11
FORMULA_NAME ClientsAndServers-PT-N0100P0-12
FORMULA_NAME ClientsAndServers-PT-N0100P0-13
FORMULA_NAME ClientsAndServers-PT-N0100P0-14
FORMULA_NAME ClientsAndServers-PT-N0100P0-15

=== Now, execution of the tool begins

BK_START 1620569797343

Running Version 0
[2021-05-09 14:16:40] [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 14:16:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:16:40] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-09 14:16:40] [INFO ] Transformed 25 places.
[2021-05-09 14:16:40] [INFO ] Transformed 18 transitions.
[2021-05-09 14:16:40] [INFO ] Parsed PT model containing 25 places and 18 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:16:40] [INFO ] Initial state test concluded for 3 properties.
FORMULA ClientsAndServers-PT-N0100P0-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 14:16:40] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-09 14:16:40] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 14:16:40] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-09 14:16:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 14:16:40] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 14:16:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 14:16:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 14:16:40] [INFO ] Flatten gal took : 17 ms
FORMULA ClientsAndServers-PT-N0100P0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:16:40] [INFO ] Flatten gal took : 3 ms
[2021-05-09 14:16:40] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100116 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=2502 ) properties (out of 26) seen :24
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 14:16:40] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-09 14:16:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 14:16:40] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned unsat
[2021-05-09 14:16:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 14:16:40] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:16:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 14:16:40] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:16:40] [INFO ] Added : 14 causal constraints over 3 iterations in 20 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-09 14:16:40] [INFO ] Initial state test concluded for 1 properties.
FORMULA ClientsAndServers-PT-N0100P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((p0&&G(p1))||(X(p0) U ((p2&&X(p0))||X(G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:16:40] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-09 14:16:40] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:16:40] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-09 14:16:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:16:40] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-09 14:16:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT 1 s3), p1:(GT s14 s10), p2:(GT s5 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 245 ms.
Product exploration explored 100000 steps with 23 reset in 279 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p1)]
Product exploration explored 100000 steps with 5 reset in 122 ms.
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-00 finished in 1479 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:16:42] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:16:42] [INFO ] Implicit Places using invariants in 19 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:16:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:16:42] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:16:42] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 14:16:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s8), p0:(LEQ s12 s11)], 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 5118 reset in 92 ms.
Product exploration explored 100000 steps with 5177 reset in 118 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 5104 reset in 80 ms.
Stack based approach found an accepted trace after 5695 steps with 286 reset with depth 21 and stack size 21 in 7 ms.
FORMULA ClientsAndServers-PT-N0100P0-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-01 finished in 732 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&X(G(p0))&&G(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:16:42] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants in 13 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:16:43] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:16:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-02 automaton TGBA [mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s10 s15), p2:(LEQ s15 s0), p1:(GT 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 102 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0100P0-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-02 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p1&&(p2 U p3)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:16:43] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants in 14 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:16:43] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:16:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (NOT p0), (OR (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GT s15 s10) (LEQ s3 s0)), p1:(LEQ s20 s1), p3:(AND (LEQ s20 s1) (LEQ s15 s16)), p2:(LEQ s15 s16)], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-04 finished in 215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 18 place count 14 transition count 10
Applied a total of 18 rules in 8 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-09 14:16:43] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants in 14 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-09 14:16:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 14:16:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 13/24 places, 10/18 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 13 transition count 9
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 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 11 transition count 8
Applied a total of 4 rules in 1 ms. Remains 11 /13 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 14:16:43] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 14:16:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s1 s8), p1:(LEQ s9 s4)], 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 3 reset in 70 ms.
Stack based approach found an accepted trace after 151 steps with 1 reset with depth 143 and stack size 143 in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-07 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 22 place count 12 transition count 8
Applied a total of 22 rules in 3 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-09 14:16:43] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants in 15 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
[2021-05-09 14:16:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 14:16:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 11/24 places, 8/18 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 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 8 transition count 6
Applied a total of 5 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:16:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:16:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s6 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-08 finished in 131 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||X(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 0 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:16:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:16:43] [INFO ] Implicit Places using invariants in 16 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:16:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:16:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p2), acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=5, aps=[p0:(AND (LEQ s15 s10) (LEQ 1 s19)), p2:(LEQ 1 s19), p1:(OR (GT s15 s10) (GT s11 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 182 ms.
Applying partial POR strategy [true, true, true, true, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2), (NOT p0)]
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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 20 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 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 11 ms. Remains 19 /20 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2021-05-09 14:16:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-09 14:16:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:16:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/20 places, 17/18 transitions.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
[2021-05-09 14:16:46] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:16:46] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:16:46] [INFO ] Time to serialize gal into /tmp/LTL16094179652260226821.gal : 0 ms
[2021-05-09 14:16:46] [INFO ] Time to serialize properties into /tmp/LTL9707506773965261262.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/LTL16094179652260226821.gal, -t, CGAL, -LTL, /tmp/LTL9707506773965261262.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/LTL16094179652260226821.gal -t CGAL -LTL /tmp/LTL9707506773965261262.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("((StR<=MtF)&&(Ci>=1))"))||(X("((StR>MtF)||(SG>Si))")))||(G("(Ci>=1)"))))))
Formula 0 simplified : !XG(G"((StR<=MtF)&&(Ci>=1))" | X"((StR>MtF)||(SG>Si))" | G"(Ci>=1)")
Detected timeout of ITS tools.
[2021-05-09 14:17:01] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:17:01] [INFO ] Applying decomposition
[2021-05-09 14:17:01] [INFO ] Flatten gal took : 77 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/graph14569566684838189962.txt, -o, /tmp/graph14569566684838189962.bin, -w, /tmp/graph14569566684838189962.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/graph14569566684838189962.bin, -l, -1, -v, -w, /tmp/graph14569566684838189962.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:17:01] [INFO ] Decomposing Gal with order
[2021-05-09 14:17:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:17:01] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:17:01] [INFO ] Flatten gal took : 41 ms
[2021-05-09 14:17:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 14:17:01] [INFO ] Time to serialize gal into /tmp/LTL2802693471141172664.gal : 1 ms
[2021-05-09 14:17:01] [INFO ] Time to serialize properties into /tmp/LTL10067789285827040731.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/LTL2802693471141172664.gal, -t, CGAL, -LTL, /tmp/LTL10067789285827040731.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/LTL2802693471141172664.gal -t CGAL -LTL /tmp/LTL10067789285827040731.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("((gu3.StR<=gu3.MtF)&&(gi4.gu7.Ci>=1))"))||(X("((gu3.StR>gu3.MtF)||(gu4.SG>gu4.Si))")))||(G("(gi4.gu7.Ci>=1)"))))))
Formula 0 simplified : !XG(G"((gu3.StR<=gu3.MtF)&&(gi4.gu7.Ci>=1))" | X"((gu3.StR>gu3.MtF)||(gu4.SG>gu4.Si))" | G"(gi4.gu7.Ci>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7884657468275140396
[2021-05-09 14:17:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7884657468275140396
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/ltsmin7884657468275140396]
Compilation finished in 494 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7884657468275140396]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X((LTLAPp1==true))||[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7884657468275140396]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0100P0-09 finished in 47726 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 15 transition count 11
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 17 place count 14 transition count 11
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 21 place count 12 transition count 9
Applied a total of 21 rules in 1 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:17:31] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:17:31] [INFO ] Implicit Places using invariants in 51 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
[2021-05-09 14:17:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 14:17:31] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:17:31] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 11/24 places, 9/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 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 2 with 2 rules applied. Total rules applied 6 place count 8 transition count 6
Applied a total of 6 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:17:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:17:31] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:17:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:17:31] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s7 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 0 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Product exploration explored 100000 steps with 0 reset in 183 ms.
[2021-05-09 14:17:32] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:17:32] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:17:32] [INFO ] Time to serialize gal into /tmp/LTL3475710456108628508.gal : 1 ms
[2021-05-09 14:17:32] [INFO ] Time to serialize properties into /tmp/LTL1773861330451274463.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/LTL3475710456108628508.gal, -t, CGAL, -LTL, /tmp/LTL1773861330451274463.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/LTL3475710456108628508.gal -t CGAL -LTL /tmp/LTL1773861330451274463.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(Ci>SpG)"))))
Formula 0 simplified : !GF"(Ci>SpG)"
Detected timeout of ITS tools.
[2021-05-09 14:17:47] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:17:47] [INFO ] Applying decomposition
[2021-05-09 14:17:47] [INFO ] Flatten gal took : 0 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/graph16582505342934151612.txt, -o, /tmp/graph16582505342934151612.bin, -w, /tmp/graph16582505342934151612.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/graph16582505342934151612.bin, -l, -1, -v, -w, /tmp/graph16582505342934151612.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:17:47] [INFO ] Decomposing Gal with order
[2021-05-09 14:17:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:17:47] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:17:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:17:47] [INFO ] Time to serialize gal into /tmp/LTL4425122645444946282.gal : 1 ms
[2021-05-09 14:17:47] [INFO ] Time to serialize properties into /tmp/LTL9732858854840239055.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/LTL4425122645444946282.gal, -t, CGAL, -LTL, /tmp/LTL9732858854840239055.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/LTL4425122645444946282.gal -t CGAL -LTL /tmp/LTL9732858854840239055.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu2.Ci>gu2.SpG)"))))
Formula 0 simplified : !GF"(gu2.Ci>gu2.SpG)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13200315051267988735
[2021-05-09 14:18:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13200315051267988735
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/ltsmin13200315051267988735]
Compilation finished in 79 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13200315051267988735]
Link finished in 37 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin13200315051267988735]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0100P0-11 finished in 46085 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 22 place count 12 transition count 8
Applied a total of 22 rules in 20 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-09 14:18:17] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:18:17] [INFO ] Implicit Places using invariants in 54 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
[2021-05-09 14:18:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 14:18:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:18:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 10/24 places, 8/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 7
Applied a total of 3 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 14:18:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:18:17] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 14:18:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:18:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-12 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT s7 s6) (LEQ s4 s7)), p1:(GT s7 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 110 in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-12 finished in 287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 17 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 17 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 14 transition count 11
Applied a total of 17 rules in 2 ms. Remains 14 /24 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 14:18:17] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:18:17] [INFO ] Implicit Places using invariants in 65 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
[2021-05-09 14:18:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-09 14:18:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:18:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 13/24 places, 11/18 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 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 14:18:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:18:18] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 14:18:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:18:18] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/24 places, 10/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (GT 3 s3) (GT s7 s10)) (GT 3 s7)), p1:(GT s6 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Stack based approach found an accepted trace after 2307 steps with 0 reset with depth 2308 and stack size 2308 in 2 ms.
FORMULA ClientsAndServers-PT-N0100P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-13 finished in 833 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:18:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:18:18] [INFO ] Implicit Places using invariants in 21 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:18:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:18:18] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:18:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:18:18] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ 1 s13) (LEQ 1 s4)), p1:(LEQ s17 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-15 finished in 233 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-09 14:18:18] [INFO ] Applying decomposition
[2021-05-09 14:18:18] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin5077653960618537608
[2021-05-09 14:18:18] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 14:18:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:18:18] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 14:18:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:18:18] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 14:18:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:18:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5077653960618537608
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/ltsmin5077653960618537608]
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/graph14270595213403300126.txt, -o, /tmp/graph14270595213403300126.bin, -w, /tmp/graph14270595213403300126.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/graph14270595213403300126.bin, -l, -1, -v, -w, /tmp/graph14270595213403300126.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:18:18] [INFO ] Decomposing Gal with order
[2021-05-09 14:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:18:18] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-09 14:18:18] [INFO ] Flatten gal took : 3 ms
[2021-05-09 14:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 14:18:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality3172189711966957874.gal : 7 ms
[2021-05-09 14:18:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality248118648111409512.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/LTLCardinality3172189711966957874.gal, -t, CGAL, -LTL, /tmp/LTLCardinality248118648111409512.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/LTLCardinality3172189711966957874.gal -t CGAL -LTL /tmp/LTLCardinality248118648111409512.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(G(((G("((gu3.StR<=gu3.MtF)&&(gu7.Ci>=1))"))||(X("((gu3.StR>gu3.MtF)||(gu4.SG>gu4.Si))")))||(G("(gu7.Ci>=1)"))))))
Formula 0 simplified : !XG(G"((gu3.StR<=gu3.MtF)&&(gu7.Ci>=1))" | X"((gu3.StR>gu3.MtF)||(gu4.SG>gu4.Si))" | G"(gu7.Ci>=1)")
Compilation finished in 213 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5077653960618537608]
Link finished in 53 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X((LTLAPp1==true))||[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5077653960618537608]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: LTL layer: formula: X([](([]((LTLAPp0==true))||X((LTLAPp1==true))||[]((LTLAPp2==true)))))
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: "X([](([]((LTLAPp0==true))||X((LTLAPp1==true))||[]((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.022: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.041: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.134: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.134: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.134: State length is 25, there are 57 groups
pins2lts-mc-linux64( 0/ 8), 0.134: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.134: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.134: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.134: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 2.849: ~1 levels ~960 states ~3256 transitions
pins2lts-mc-linux64( 5/ 8), 2.884: ~1 levels ~1920 states ~7832 transitions
pins2lts-mc-linux64( 7/ 8), 2.895: ~1 levels ~3840 states ~14608 transitions
pins2lts-mc-linux64( 5/ 8), 2.901: ~1 levels ~7680 states ~34024 transitions
pins2lts-mc-linux64( 5/ 8), 2.904: ~1 levels ~15360 states ~70608 transitions
pins2lts-mc-linux64( 7/ 8), 2.917: ~1 levels ~30720 states ~138592 transitions
pins2lts-mc-linux64( 5/ 8), 2.954: ~1 levels ~61440 states ~298384 transitions
pins2lts-mc-linux64( 0/ 8), 3.058: ~1 levels ~122880 states ~638088 transitions
pins2lts-mc-linux64( 0/ 8), 3.237: ~1 levels ~245760 states ~1311000 transitions
pins2lts-mc-linux64( 0/ 8), 3.664: ~1 levels ~491520 states ~2700248 transitions
pins2lts-mc-linux64( 4/ 8), 4.545: ~1 levels ~983040 states ~5610976 transitions
pins2lts-mc-linux64( 4/ 8), 6.478: ~1 levels ~1966080 states ~11700568 transitions
pins2lts-mc-linux64( 4/ 8), 10.768: ~1 levels ~3932160 states ~23899304 transitions
pins2lts-mc-linux64( 4/ 8), 19.313: ~1 levels ~7864320 states ~48294792 transitions
pins2lts-mc-linux64( 4/ 8), 36.653: ~1 levels ~15728640 states ~100071584 transitions
pins2lts-mc-linux64( 4/ 8), 75.670: ~1 levels ~31457280 states ~208865768 transitions
pins2lts-mc-linux64( 4/ 8), 160.458: ~1 levels ~62914560 states ~432758808 transitions
pins2lts-mc-linux64( 5/ 8), 245.519: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 245.574:
pins2lts-mc-linux64( 0/ 8), 245.574: mean standard work distribution: 5.7% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 245.574:
pins2lts-mc-linux64( 0/ 8), 245.574: Explored 86998838 states 650927218 transitions, fanout: 7.482
pins2lts-mc-linux64( 0/ 8), 245.574: Total exploration time 245.400 sec (245.340 sec minimum, 245.372 sec on average)
pins2lts-mc-linux64( 0/ 8), 245.574: States per second: 354518, Transitions per second: 2652515
pins2lts-mc-linux64( 0/ 8), 245.574:
pins2lts-mc-linux64( 0/ 8), 245.574: Progress states detected: 99733818
pins2lts-mc-linux64( 0/ 8), 245.574: Redundant explorations: -12.7690
pins2lts-mc-linux64( 0/ 8), 245.574:
pins2lts-mc-linux64( 0/ 8), 245.574: Queue width: 8B, total height: 24744716, memory: 188.79MB
pins2lts-mc-linux64( 0/ 8), 245.574: Tree memory: 1016.9MB, 10.7 B/state, compr.: 10.5%
pins2lts-mc-linux64( 0/ 8), 245.574: Tree fill ratio (roots/leafs): 74.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 245.574: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 245.574: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 245.574: Est. total memory use: 1205.7MB (~1212.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X((LTLAPp1==true))||[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5077653960618537608]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp0==true))||X((LTLAPp1==true))||[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5077653960618537608]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 14:38:51] [INFO ] Flatten gal took : 18 ms
[2021-05-09 14:38:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality10357382744589147339.gal : 0 ms
[2021-05-09 14:38:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality15215809401588734423.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/LTLCardinality10357382744589147339.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15215809401588734423.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/LTLCardinality10357382744589147339.gal -t CGAL -LTL /tmp/LTLCardinality15215809401588734423.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(G(((G("((StR<=MtF)&&(Ci>=1))"))||(X("((StR>MtF)||(SG>Si))")))||(G("(Ci>=1)"))))))
Formula 0 simplified : !XG(G"((StR<=MtF)&&(Ci>=1))" | X"((StR>MtF)||(SG>Si))" | G"(Ci>=1)")
Detected timeout of ITS tools.
[2021-05-09 14:59:23] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:59:23] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 14:59:23] [INFO ] Transformed 24 places.
[2021-05-09 14:59:23] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 14:59:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality7478768633249588654.gal : 0 ms
[2021-05-09 14:59:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality5038555283590809625.ltl : 2 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/LTLCardinality7478768633249588654.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5038555283590809625.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality7478768633249588654.gal -t CGAL -LTL /tmp/LTLCardinality5038555283590809625.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(((G("((StR<=MtF)&&(Ci>=1))"))||(X("((StR>MtF)||(SG>Si))")))||(G("(Ci>=1)"))))))
Formula 0 simplified : !XG(G"((StR<=MtF)&&(Ci>=1))" | X"((StR>MtF)||(SG>Si))" | G"(Ci>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-N0100P0"
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-N0100P0, 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-162038291600220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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