Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.0K Apr 29 12:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 12:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 12:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.2K May 10 09:33 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-N2000P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652718311544

Running Version 202205111006
[2022-05-16 16:25:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 16:25:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:25:12] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2022-05-16 16:25:12] [INFO ] Transformed 25 places.
[2022-05-16 16:25:12] [INFO ] Transformed 18 transitions.
[2022-05-16 16:25:12] [INFO ] Parsed PT model containing 25 places and 18 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 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 23 transition count 18
Applied a total of 2 rules in 9 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:12] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-16 16:25:13] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:13] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 16:25:13] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 16:25:13] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/25 places, 18/18 transitions.
Support contains 17 out of 23 places after structural reductions.
[2022-05-16 16:25:13] [INFO ] Flatten gal took : 15 ms
[2022-05-16 16:25:13] [INFO ] Flatten gal took : 4 ms
[2022-05-16 16:25:13] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=500 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:13] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 16:25:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 16:25:13] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 16:25:13] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:25:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 16:25:13] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:25:13] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:25:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 4 ms to minimize.
[2022-05-16 16:25:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-16 16:25:13] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 16:25:13] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 74480 steps, including 0 resets, run visited all 1 properties in 228 ms. (steps per millisecond=326 )
Parikh walk visited 1 properties in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((G(p0)||F(p1)||p1)))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:25:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 16:25:14] [INFO ] Implicit Places using invariants in 30 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(GEQ s6 1), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1696 reset in 216 ms.
Product exploration explored 100000 steps with 1713 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2285 ) properties (out of 2) seen :0
Finished Best-First random walk after 63 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:25:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:25:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 16:25:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:25:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 16:25:15] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:25:15] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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
[2022-05-16 16:25:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:25:15] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:25:15] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 16:25:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:25:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:25:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=2666 ) properties (out of 2) seen :0
Finished Best-First random walk after 144 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:25:16] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 16:25:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 16:25:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:25:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 16:25:16] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:25:16] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1724 reset in 108 ms.
Product exploration explored 100000 steps with 1700 reset in 104 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 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 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 6 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 16 transition count 14
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 16 transition count 14
Performed 2 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 2 rules applied. Total rules applied 20 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 12 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2022-05-16 16:25:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2022-05-16 16:25:16] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 13/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 6548 reset in 135 ms.
Product exploration explored 100000 steps with 6559 reset in 116 ms.
Built C files in :
/tmp/ltsmin8466423287029096982
[2022-05-16 16:25:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8466423287029096982
Running compilation step : cd /tmp/ltsmin8466423287029096982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin8466423287029096982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8466423287029096982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8786296014508152640.hoa' '--buchi-type=spotba'
LTSmin run took 1931 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-00 finished in 5113 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(!(!p0 U p1))&&F(p1))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:25:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:25:19] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:25:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:25:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:25:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, true, true, p1, (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s14 1)), p1:(AND (GEQ s7 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 156 steps with 5 reset in 2 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-01 finished in 328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||(G((X(X(p0))||p2))&&p3))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:19] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 16:25:19] [INFO ] Implicit Places using invariants in 24 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 2}]], initial=0, aps=[p1:(GEQ s10 1), p0:(AND (GEQ s1 1) (GEQ s18 1)), p3:(GEQ s16 1), p2:(OR (AND (GEQ s3 1) (GEQ s14 1)) (AND (GEQ s1 1) (GEQ s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, 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-N2000P0-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-02 finished in 407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:25:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 16:25:20] [INFO ] Implicit Places using invariants in 30 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s15 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-03 finished in 293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(X(X(p1))||X(G(p2))))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:20] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-16 16:25:20] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:20] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 16:25:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:20] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 16:25:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 7}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 5}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s18 1)), p1:(AND (GEQ s7 1) (GEQ s21 1)), p2:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, 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-N2000P0-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-04 finished in 397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:25:20] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 16:25:20] [INFO ] Implicit Places using invariants in 27 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 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.
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (OR (LT s1 1) (LT s17 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2200 reset in 83 ms.
Product exploration explored 100000 steps with 2248 reset in 96 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished Best-First random walk after 167 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:25:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-05 finished in 700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(F(F((F(p0)&&X(p1))))))&&G(p2))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 4 rules applied. Total rules applied 4 place count 22 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 8 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 18 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 9 place count 18 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 11 place count 17 transition count 13
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 3 with 4 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 14 transition count 10
Applied a total of 17 rules in 3626 ms. Remains 14 /23 variables (removed 9) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 16:25:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 16:25:25] [INFO ] Implicit Places using invariants in 28 ms returned [4, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 10/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/23 places, 10/18 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s6 1), p0:(AND (GEQ s2 1) (GEQ s8 1)), p1:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5178 reset in 83 ms.
Stack based approach found an accepted trace after 1748 steps with 80 reset with depth 10 and stack size 10 in 2 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-06 finished in 3925 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((p1 U p2))&&G(p1)&&p0))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:25:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:25:25] [INFO ] Implicit Places using invariants in 29 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s16 1), p0:(AND (GEQ s10 1) (GEQ s15 1)), p2:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-07 finished in 179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 5 rules applied. Total rules applied 5 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 10 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 11 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 11 place count 17 transition count 11
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 15 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 21 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 11 transition count 7
Applied a total of 23 rules in 3609 ms. Remains 11 /23 variables (removed 12) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-16 16:25:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:25:29] [INFO ] Implicit Places using invariants in 23 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-09 finished in 3773 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:25:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:25:29] [INFO ] Implicit Places using invariants in 26 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2250 reset in 79 ms.
Product exploration explored 100000 steps with 2231 reset in 83 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished Best-First random walk after 423 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=211 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:25:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:25:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-10 finished in 733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 rules applied. Total rules applied 3 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 18 transition count 11
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 15 place count 15 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 3 with 4 rules applied. Total rules applied 19 place count 13 transition count 9
Applied a total of 19 rules in 7 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-16 16:25:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:25:30] [INFO ] Implicit Places using invariants in 20 ms returned [9, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 9/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 8
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 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 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 4 place count 9 transition count 7
Applied a total of 4 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 16:25:30] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-16 16:25:30] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 16:25:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:25:30] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/23 places, 7/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s5 1), p0:(OR (LT s4 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 69 reset in 79 ms.
Stack based approach found an accepted trace after 158 steps with 4 reset with depth 23 and stack size 23 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-11 finished in 344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((X(p0) U (p1 U p2)))||X(G(p3))))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:25:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:25:30] [INFO ] Implicit Places using invariants in 21 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 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.
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 540 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p3), (NOT p2), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(NOT p3), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 11}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 11}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 9}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s19 1)), p1:(LT s10 1), p3:(GEQ s9 1), p0:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23534 reset in 75 ms.
Product exploration explored 100000 steps with 23516 reset in 81 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p3) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (AND (NOT p2) p1 (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 797 ms. Reduced automaton from 13 states, 36 edges and 4 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 348 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1600 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:25:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:32] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 16:25:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:32] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 16:25:32] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-16 16:25:32] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 134495 steps, including 0 resets, run visited all 1 properties in 184 ms. (steps per millisecond=730 )
Parikh walk visited 4 properties in 1860 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p3) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (AND (NOT p2) p1 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 15 factoid took 880 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 304 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 332 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:25:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 16:25:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:25:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:36] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:25:36] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:25:36] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 4 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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
[2022-05-16 16:25:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:25:36] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:25:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:25:36] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 313 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1777 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:25:36] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 16:25:36] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 16:25:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:25:36] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 16:25:36] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 16:25:36] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 134943 steps, including 0 resets, run visited all 1 properties in 179 ms. (steps per millisecond=753 )
Parikh walk visited 4 properties in 1941 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:25:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 16:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 16:25:39] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:25:39] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 18174 reset in 61 ms.
Product exploration explored 100000 steps with 18158 reset in 63 ms.
Applying partial POR strategy [false, false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 345 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 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 7 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 17 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 17 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 20 rules in 9 ms. Remains 16 /21 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2022-05-16 16:25:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-16 16:25:40] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:25:40] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/21 places, 13/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 13/18 transitions.
Product exploration explored 100000 steps with 18550 reset in 111 ms.
Product exploration explored 100000 steps with 18561 reset in 121 ms.
Built C files in :
/tmp/ltsmin6280750669453951521
[2022-05-16 16:25:41] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6280750669453951521
Running compilation step : cd /tmp/ltsmin6280750669453951521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin6280750669453951521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6280750669453951521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16971302139564018087.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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
[2022-05-16 16:25:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:25:56] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:25:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:25:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:25:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin8533062465896316018
[2022-05-16 16:25:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8533062465896316018
Running compilation step : cd /tmp/ltsmin8533062465896316018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin8533062465896316018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8533062465896316018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4546319420050282368.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:26:11] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:26:11] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:26:11] [INFO ] Time to serialize gal into /tmp/LTL1300231817451266000.gal : 1 ms
[2022-05-16 16:26:11] [INFO ] Time to serialize properties into /tmp/LTL14212457587182723868.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1300231817451266000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14212457587182723868.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1300231...267
Read 1 LTL properties
Checking formula 0 : !((X(G((G((X("(Ci>=1)"))U(("(MtF<1)")U("((CG>=1)&&(CwG>=1))"))))||(X(G("(MpA>=1)")))))))
Formula 0 simplified : !XG(G(X"(Ci>=1)" U ("(MtF<1)" U "((CG>=1)&&(CwG>=1))")) | XG"(MpA>=1)")
Detected timeout of ITS tools.
[2022-05-16 16:26:26] [INFO ] Flatten gal took : 7 ms
[2022-05-16 16:26:26] [INFO ] Applying decomposition
[2022-05-16 16:26:26] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1516587326529528874.txt' '-o' '/tmp/graph1516587326529528874.bin' '-w' '/tmp/graph1516587326529528874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1516587326529528874.bin' '-l' '-1' '-v' '-w' '/tmp/graph1516587326529528874.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:26:26] [INFO ] Decomposing Gal with order
[2022-05-16 16:26:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:26:26] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 16:26:26] [INFO ] Flatten gal took : 26 ms
[2022-05-16 16:26:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 16:26:26] [INFO ] Time to serialize gal into /tmp/LTL2675876035455841663.gal : 1 ms
[2022-05-16 16:26:26] [INFO ] Time to serialize properties into /tmp/LTL453365949057052175.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2675876035455841663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL453365949057052175.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2675876...244
Read 1 LTL properties
Checking formula 0 : !((X(G((G((X("(u1.Ci>=1)"))U(("(u0.MtF<1)")U("((u5.CG>=1)&&(u5.CwG>=1))"))))||(X(G("(u2.MpA>=1)")))))))
Formula 0 simplified : !XG(G(X"(u1.Ci>=1)" U ("(u0.MtF<1)" U "((u5.CG>=1)&&(u5.CwG>=1))")) | XG"(u2.MpA>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8501701627100624005
[2022-05-16 16:26:41] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8501701627100624005
Running compilation step : cd /tmp/ltsmin8501701627100624005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin8501701627100624005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8501701627100624005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))||X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-12 finished in 86288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:26:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants in 31 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Product exploration explored 100000 steps with 50000 reset in 53 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-13 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 7 rules applied. Total rules applied 7 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 16 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 13 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 2 with 2 rules applied. Total rules applied 15 place count 15 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 19 place count 13 transition count 9
Applied a total of 19 rules in 4 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-16 16:26:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants in 22 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 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
[2022-05-16 16:26:56] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:26:56] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/23 places, 6/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s7 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15206 reset in 60 ms.
Product exploration explored 100000 steps with 15137 reset in 60 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:26:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:26:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:26:57] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:26:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:26:57] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:26:57] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 16:26:57] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20000 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=1666 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:26:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:26:57] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:26:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:26:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 16:26:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:26:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:26:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:26:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:26:58] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 16:26:58] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:26:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:26:58] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:26:58] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-16 16:26:58] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20000 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=1538 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15135 reset in 57 ms.
Product exploration explored 100000 steps with 15181 reset in 59 ms.
Built C files in :
/tmp/ltsmin9990753536291458657
[2022-05-16 16:26:58] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-16 16:26:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:26:58] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-16 16:26:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:26:58] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-16 16:26:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:26:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9990753536291458657
Running compilation step : cd /tmp/ltsmin9990753536291458657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin9990753536291458657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9990753536291458657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18291922191649832198.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:27:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:27:13] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:27:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:27:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-16 16:27:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 16:27:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:27:13] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin13128212375572894254
[2022-05-16 16:27:13] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-16 16:27:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:13] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-16 16:27:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:13] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-16 16:27:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13128212375572894254
Running compilation step : cd /tmp/ltsmin13128212375572894254;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin13128212375572894254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13128212375572894254;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9278967840830761264.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:27:28] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:27:28] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:27:28] [INFO ] Time to serialize gal into /tmp/LTL16570917618761701110.gal : 0 ms
[2022-05-16 16:27:28] [INFO ] Time to serialize properties into /tmp/LTL6396621439909595099.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16570917618761701110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6396621439909595099.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1657091...267
Read 1 LTL properties
Checking formula 0 : !((F((G("(Ci>=1)"))||("(SpG>=1)"))))
Formula 0 simplified : !F("(SpG>=1)" | G"(Ci>=1)")
Detected timeout of ITS tools.
[2022-05-16 16:27:43] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:27:43] [INFO ] Applying decomposition
[2022-05-16 16:27:43] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7443289856644165222.txt' '-o' '/tmp/graph7443289856644165222.bin' '-w' '/tmp/graph7443289856644165222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7443289856644165222.bin' '-l' '-1' '-v' '-w' '/tmp/graph7443289856644165222.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:27:43] [INFO ] Decomposing Gal with order
[2022-05-16 16:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:27:43] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 16:27:43] [INFO ] Time to serialize gal into /tmp/LTL16317139446151466118.gal : 0 ms
[2022-05-16 16:27:43] [INFO ] Time to serialize properties into /tmp/LTL6286003039150344596.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16317139446151466118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6286003039150344596.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1631713...246
Read 1 LTL properties
Checking formula 0 : !((F((G("(u2.Ci>=1)"))||("(i0.u1.SpG>=1)"))))
Formula 0 simplified : !F("(i0.u1.SpG>=1)" | G"(u2.Ci>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11573190342457333523
[2022-05-16 16:27:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11573190342457333523
Running compilation step : cd /tmp/ltsmin11573190342457333523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin11573190342457333523;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11573190342457333523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-15 finished in 77139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((X(p0) U (p1 U p2)))||X(G(p3))))))'
Found a SL insensitive property : ClientsAndServers-PT-N2000P0-LTLFireability-12
Stuttering acceptance computed with spot in 497 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p3), (NOT p2), (AND p0 (NOT p2) (NOT p3))]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 5 rules applied. Total rules applied 5 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 10 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 11 place count 17 transition count 13
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 12
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 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 15 transition count 11
Applied a total of 15 rules in 7 ms. Remains 15 /23 variables (removed 8) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 16:28:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:28:14] [INFO ] Implicit Places using invariants in 31 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 14/23 places, 11/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 14 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 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Applied a total of 4 rules in 5 ms. Remains 12 /14 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:28:14] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:28:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 12/23 places, 9/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/23 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(NOT p3), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 11}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 11}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 9}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s10 1)), p1:(LT s7 1), p3:(GEQ s6 1), p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21659 reset in 89 ms.
Product exploration explored 100000 steps with 22412 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p3) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (AND (NOT p2) p1 (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 737 ms. Reduced automaton from 13 states, 36 edges and 4 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 306 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:28:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:28:16] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 16:28:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 16:28:16] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 16:28:16] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 16:28:16] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 68609 steps, including 0 resets, run visited all 1 properties in 61 ms. (steps per millisecond=1124 )
Parikh walk visited 4 properties in 835 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p3) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (AND (NOT p2) p1 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 15 factoid took 872 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 320 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 417 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:28:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:28:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:28:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 16:28:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:28:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:28:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:28:18] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 16:28:18] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:28:18] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:18] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:28:18] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:28:18] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:28:18] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:28:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:28:19] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 16:28:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 16:28:19] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 16:28:19] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 16:28:19] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 68711 steps, including 0 resets, run visited all 1 properties in 61 ms. (steps per millisecond=1126 )
Parikh walk visited 4 properties in 811 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:28:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:28:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 16:28:21] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 16:28:21] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 16907 reset in 87 ms.
Product exploration explored 100000 steps with 17267 reset in 103 ms.
Applying partial POR strategy [false, false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2022-05-16 16:28:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:28:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 9/9 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 9/9 transitions.
Product exploration explored 100000 steps with 17206 reset in 93 ms.
Product exploration explored 100000 steps with 16617 reset in 149 ms.
Built C files in :
/tmp/ltsmin16660807585681818259
[2022-05-16 16:28:22] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16660807585681818259
Running compilation step : cd /tmp/ltsmin16660807585681818259;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin16660807585681818259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16660807585681818259;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1747793634941624586.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:28:37] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:28:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 16:28:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:28:37] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin14238022132726029084
[2022-05-16 16:28:37] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14238022132726029084
Running compilation step : cd /tmp/ltsmin14238022132726029084;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin14238022132726029084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14238022132726029084;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6721267923475923583.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:28:52] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:28:52] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:28:52] [INFO ] Time to serialize gal into /tmp/LTL9813417533028027906.gal : 0 ms
[2022-05-16 16:28:52] [INFO ] Time to serialize properties into /tmp/LTL1370918541952733239.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9813417533028027906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1370918541952733239.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9813417...266
Read 1 LTL properties
Checking formula 0 : !((X(G((G((X("(Ci>=1)"))U(("(MtF<1)")U("((CG>=1)&&(CwG>=1))"))))||(X(G("(MpA>=1)")))))))
Formula 0 simplified : !XG(G(X"(Ci>=1)" U ("(MtF<1)" U "((CG>=1)&&(CwG>=1))")) | XG"(MpA>=1)")
Detected timeout of ITS tools.
[2022-05-16 16:29:07] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:29:07] [INFO ] Applying decomposition
[2022-05-16 16:29:07] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11904836865704071990.txt' '-o' '/tmp/graph11904836865704071990.bin' '-w' '/tmp/graph11904836865704071990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11904836865704071990.bin' '-l' '-1' '-v' '-w' '/tmp/graph11904836865704071990.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:29:07] [INFO ] Decomposing Gal with order
[2022-05-16 16:29:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:29:07] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:29:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 16:29:07] [INFO ] Time to serialize gal into /tmp/LTL5752953243871233364.gal : 1 ms
[2022-05-16 16:29:07] [INFO ] Time to serialize properties into /tmp/LTL11603450047184355444.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5752953243871233364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11603450047184355444.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5752953...246
Read 1 LTL properties
Checking formula 0 : !((X(G((G((X("(u1.Ci>=1)"))U(("(u0.MtF<1)")U("((u2.CG>=1)&&(u2.CwG>=1))"))))||(X(G("(u1.MpA>=1)")))))))
Formula 0 simplified : !XG(G(X"(u1.Ci>=1)" U ("(u0.MtF<1)" U "((u2.CG>=1)&&(u2.CwG>=1))")) | XG"(u1.MpA>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16842998506469843300
[2022-05-16 16:29:22] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16842998506469843300
Running compilation step : cd /tmp/ltsmin16842998506469843300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin16842998506469843300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16842998506469843300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))||X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-12 finished in 83904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
[2022-05-16 16:29:38] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7424276171702565009
[2022-05-16 16:29:38] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-16 16:29:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:29:38] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-16 16:29:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:29:38] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-16 16:29:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:29:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7424276171702565009
Running compilation step : cd /tmp/ltsmin7424276171702565009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 16:29:38] [INFO ] Applying decomposition
[2022-05-16 16:29:38] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph362082251740033752.txt' '-o' '/tmp/graph362082251740033752.bin' '-w' '/tmp/graph362082251740033752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph362082251740033752.bin' '-l' '-1' '-v' '-w' '/tmp/graph362082251740033752.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:29:38] [INFO ] Decomposing Gal with order
[2022-05-16 16:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:29:38] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 16:29:38] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 16:29:38] [INFO ] Time to serialize gal into /tmp/LTLFireability12472656938734027806.gal : 1 ms
[2022-05-16 16:29:38] [INFO ] Time to serialize properties into /tmp/LTLFireability1941506138416178168.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12472656938734027806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1941506138416178168.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((X(G((G((X("(i2.u8.Ci>=1)"))U(("(i0.u1.MtF<1)")U("((u3.CG>=1)&&(u7.CwG>=1))"))))||(X(G("(i0.u0.MpA>=1)")))))))
Formula 0 simplified : !XG(G(X"(i2.u8.Ci>=1)" U ("(i0.u1.MtF<1)" U "((u3.CG>=1)&&(u7.CwG>=1))")) | XG"(i0.u0.MpA>=1)")
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin7424276171702565009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7424276171702565009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))||X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: X([](([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))||X([]((LTLAPp3==true))))))
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: "X([](([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))||X([]((LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.067: DFS-FIFO for weak LTL, using special progress label 24
pins2lts-mc-linux64( 0/ 8), 0.067: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.067: State length is 24, there are 54 groups
pins2lts-mc-linux64( 0/ 8), 0.067: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.067: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.067: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.067: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.110: ~105 levels ~960 states ~9624 transitions
pins2lts-mc-linux64( 4/ 8), 0.129: ~1 levels ~1920 states ~0 transitions
pins2lts-mc-linux64( 4/ 8), 0.188: ~1 levels ~3840 states ~0 transitions
pins2lts-mc-linux64( 4/ 8), 0.296: ~1 levels ~7680 states ~0 transitions
pins2lts-mc-linux64( 4/ 8), 0.466: ~1 levels ~15360 states ~0 transitions
pins2lts-mc-linux64( 2/ 8), 0.777: ~1 levels ~30720 states ~0 transitions
pins2lts-mc-linux64( 4/ 8), 1.340: ~1 levels ~61440 states ~0 transitions
pins2lts-mc-linux64( 4/ 8), 2.153: ~1 levels ~122880 states ~0 transitions
pins2lts-mc-linux64( 2/ 8), 3.122: ~1 levels ~245760 states ~0 transitions
pins2lts-mc-linux64( 3/ 8), 4.838: ~39624 levels ~491520 states ~4275696 transitions
pins2lts-mc-linux64( 1/ 8), 5.569: ~40000 levels ~983040 states ~6141064 transitions
pins2lts-mc-linux64( 1/ 8), 6.786: ~40000 levels ~1966080 states ~9376472 transitions
pins2lts-mc-linux64( 1/ 8), 9.045: ~40000 levels ~3932160 states ~15242584 transitions
pins2lts-mc-linux64( 1/ 8), 14.317: ~40000 levels ~7864320 states ~29937464 transitions
pins2lts-mc-linux64( 1/ 8), 25.415: ~40000 levels ~15728640 states ~61206504 transitions
pins2lts-mc-linux64( 1/ 8), 47.565: ~40000 levels ~31457280 states ~123843960 transitions
pins2lts-mc-linux64( 3/ 8), 97.963: ~39998 levels ~62914560 states ~249248368 transitions
pins2lts-mc-linux64( 1/ 8), 107.737: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 107.770:
pins2lts-mc-linux64( 0/ 8), 107.770: mean standard work distribution: 112.9% (states) 173.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 107.770:
pins2lts-mc-linux64( 0/ 8), 107.770: Explored 21530016 states 62905925 transitions, fanout: 2.922
pins2lts-mc-linux64( 0/ 8), 107.770: Total exploration time 107.690 sec (107.630 sec minimum, 107.653 sec on average)
pins2lts-mc-linux64( 0/ 8), 107.770: States per second: 199926, Transitions per second: 584139
pins2lts-mc-linux64( 0/ 8), 107.770:
pins2lts-mc-linux64( 0/ 8), 107.770: Progress states detected: 16176146
pins2lts-mc-linux64( 0/ 8), 107.770: Redundant explorations: -33.4815
pins2lts-mc-linux64( 0/ 8), 107.770:
pins2lts-mc-linux64( 0/ 8), 107.770: Queue width: 8B, total height: 11233115, memory: 85.70MB
pins2lts-mc-linux64( 0/ 8), 107.770: Tree memory: 502.9MB, 16.3 B/state, compr.: 16.6%
pins2lts-mc-linux64( 0/ 8), 107.770: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 107.770: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 107.770: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 107.770: Est. total memory use: 588.6MB (~1109.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7424276171702565009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))||X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7424276171702565009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((X((LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))||X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 16:51:06] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:51:06] [INFO ] Time to serialize gal into /tmp/LTLFireability14283007405759151440.gal : 1 ms
[2022-05-16 16:51:06] [INFO ] Time to serialize properties into /tmp/LTLFireability1684711961530920703.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14283007405759151440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1684711961530920703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 2 LTL properties
Checking formula 0 : !((X(G((G((X("(Ci>=1)"))U(("(MtF<1)")U("((CG>=1)&&(CwG>=1))"))))||(X(G("(MpA>=1)")))))))
Formula 0 simplified : !XG(G(X"(Ci>=1)" U ("(MtF<1)" U "((CG>=1)&&(CwG>=1))")) | XG"(MpA>=1)")
Detected timeout of ITS tools.
[2022-05-16 17:12:35] [INFO ] Flatten gal took : 87 ms
[2022-05-16 17:12:35] [INFO ] Input system was already deterministic with 18 transitions.
[2022-05-16 17:12:35] [INFO ] Transformed 23 places.
[2022-05-16 17:12:35] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 17:12:35] [INFO ] Time to serialize gal into /tmp/LTLFireability13550535535915287933.gal : 2 ms
[2022-05-16 17:12:35] [INFO ] Time to serialize properties into /tmp/LTLFireability17233274881545815530.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13550535535915287933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17233274881545815530.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G((G((X("(Ci>=1)"))U(("(MtF<1)")U("((CG>=1)&&(CwG>=1))"))))||(X(G("(MpA>=1)")))))))
Formula 0 simplified : !XG(G(X"(Ci>=1)" U ("(MtF<1)" U "((CG>=1)&&(CwG>=1))")) | XG"(MpA>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N2000P0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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