About the Execution of ITS-Tools for RefineWMG-PT-050050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6624.195 | 3600000.00 | 4824671.00 | 10155.50 | TTFTFFTFFFFT?FTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r325-tall-167889197500627.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RefineWMG-PT-050050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197500627
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.1K Feb 26 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 110K Mar 5 18:23 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 RefineWMG-PT-050050-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679023420911
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-050050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 03:23:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 03:23:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 03:23:42] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-17 03:23:42] [INFO ] Transformed 254 places.
[2023-03-17 03:23:42] [INFO ] Transformed 203 transitions.
[2023-03-17 03:23:42] [INFO ] Parsed PT model containing 254 places and 203 transitions and 608 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA RefineWMG-PT-050050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 30 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:23:42] [INFO ] Computed 102 place invariants in 16 ms
[2023-03-17 03:23:43] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
[2023-03-17 03:23:43] [INFO ] Invariant cache hit.
[2023-03-17 03:23:43] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-17 03:23:43] [INFO ] Invariant cache hit.
[2023-03-17 03:23:43] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-17 03:23:43] [INFO ] Invariant cache hit.
[2023-03-17 03:23:43] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 883 ms. Remains : 254/254 places, 203/203 transitions.
Support contains 30 out of 254 places after structural reductions.
[2023-03-17 03:23:43] [INFO ] Flatten gal took : 227 ms
[2023-03-17 03:23:43] [INFO ] Flatten gal took : 21 ms
[2023-03-17 03:23:43] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-17 03:23:44] [INFO ] Invariant cache hit.
[2023-03-17 03:23:44] [INFO ] [Real]Absence check using 102 positive place invariants in 15 ms returned sat
[2023-03-17 03:23:44] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-17 03:23:44] [INFO ] [Nat]Absence check using 102 positive place invariants in 14 ms returned sat
[2023-03-17 03:23:44] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-17 03:23:45] [INFO ] After 658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-17 03:23:45] [INFO ] After 1084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Finished Parikh walk after 282 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=94 )
Parikh walk visited 15 properties in 1174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 2 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 194 place count 58 transition count 56
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 42 rules applied. Total rules applied 236 place count 58 transition count 14
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 43 rules applied. Total rules applied 279 place count 16 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 15 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 280 place count 15 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 286 place count 12 transition count 10
Applied a total of 286 rules in 25 ms. Remains 12 /254 variables (removed 242) and now considering 10/203 (removed 193) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-17 03:23:46] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 03:23:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-17 03:23:46] [INFO ] Invariant cache hit.
[2023-03-17 03:23:46] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 03:23:46] [INFO ] Invariant cache hit.
[2023-03-17 03:23:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 03:23:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 03:23:46] [INFO ] Invariant cache hit.
[2023-03-17 03:23:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/254 places, 10/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 12/254 places, 10/203 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s11), p1:(OR (LEQ 3 s8) (LEQ 3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 201 ms.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Finished Best-First random walk after 1537 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=768 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-17 03:23:48] [INFO ] Invariant cache hit.
[2023-03-17 03:23:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-17 03:23:48] [INFO ] Invariant cache hit.
[2023-03-17 03:23:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 03:23:48] [INFO ] Invariant cache hit.
[2023-03-17 03:23:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 03:23:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 03:23:48] [INFO ] Invariant cache hit.
[2023-03-17 03:23:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Finished Best-First random walk after 1507 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=753 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 120 ms.
Built C files in :
/tmp/ltsmin13216619971736374886
[2023-03-17 03:23:49] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2023-03-17 03:23:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 03:23:49] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2023-03-17 03:23:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 03:23:49] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2023-03-17 03:23:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 03:23:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13216619971736374886
Running compilation step : cd /tmp/ltsmin13216619971736374886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 163 ms.
Running link step : cd /tmp/ltsmin13216619971736374886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13216619971736374886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7053757205031291155.hoa' '--buchi-type=spotba'
LTSmin run took 319 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-050050-LTLCardinality-02 finished in 3477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:23:50] [INFO ] Computed 102 place invariants in 3 ms
[2023-03-17 03:23:50] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
[2023-03-17 03:23:50] [INFO ] Invariant cache hit.
[2023-03-17 03:23:50] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-17 03:23:50] [INFO ] Invariant cache hit.
[2023-03-17 03:23:50] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-17 03:23:50] [INFO ] Invariant cache hit.
[2023-03-17 03:23:50] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s240 s122) (LEQ s34 s122))], 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 489 ms.
Product exploration explored 100000 steps with 50000 reset in 467 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 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050050-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLCardinality-03 finished in 1566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(F(p0))&&F(p1))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:23:51] [INFO ] Invariant cache hit.
[2023-03-17 03:23:51] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
[2023-03-17 03:23:51] [INFO ] Invariant cache hit.
[2023-03-17 03:23:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-17 03:23:52] [INFO ] Invariant cache hit.
[2023-03-17 03:23:52] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-17 03:23:52] [INFO ] Invariant cache hit.
[2023-03-17 03:23:52] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s128 s131), p0:(LEQ 1 s70)], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 24 reset in 673 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-04 finished in 1412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(X(p1)||(p2&&G(p3))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:23:53] [INFO ] Invariant cache hit.
[2023-03-17 03:23:53] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
[2023-03-17 03:23:53] [INFO ] Invariant cache hit.
[2023-03-17 03:23:53] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-17 03:23:53] [INFO ] Invariant cache hit.
[2023-03-17 03:23:53] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-17 03:23:53] [INFO ] Invariant cache hit.
[2023-03-17 03:23:53] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p3), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2 p3), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(LEQ 1 s58), p1:(OR (AND (LEQ s171 s125) (LEQ 1 s58)) (LEQ 1 s58)), p3:(LEQ s11 s154), p2:(LEQ s171 s125)], 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][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 RefineWMG-PT-050050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-05 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 149 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 0 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 197 place count 56 transition count 55
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 47 rules applied. Total rules applied 244 place count 56 transition count 8
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 291 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 291 place count 9 transition count 7
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 293 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 7 transition count 6
Applied a total of 295 rules in 13 ms. Remains 7 /254 variables (removed 247) and now considering 6/203 (removed 197) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-17 03:23:53] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 03:23:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-17 03:23:54] [INFO ] Invariant cache hit.
[2023-03-17 03:23:54] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 03:23:54] [INFO ] Invariant cache hit.
[2023-03-17 03:23:54] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 03:23:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 03:23:54] [INFO ] Invariant cache hit.
[2023-03-17 03:23:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/254 places, 6/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 7/254 places, 6/203 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-07 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(X(G(p1))))) U !p1))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 9 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:23:54] [INFO ] Computed 102 place invariants in 6 ms
[2023-03-17 03:23:54] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
[2023-03-17 03:23:54] [INFO ] Invariant cache hit.
[2023-03-17 03:23:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-17 03:23:54] [INFO ] Invariant cache hit.
[2023-03-17 03:23:54] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-17 03:23:54] [INFO ] Invariant cache hit.
[2023-03-17 03:23:54] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 148 ms :[p1, (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s86), p0:(AND (LEQ 3 s173) (LEQ 1 s114))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 642 ms.
Product exploration explored 100000 steps with 0 reset in 784 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (AND p1 (NOT p0)))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050050-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLCardinality-08 finished in 2261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F((G(p1)||X(p2))) U G(p3))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 143 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 1 with 141 rules applied. Total rules applied 189 place count 64 transition count 61
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 39 rules applied. Total rules applied 228 place count 64 transition count 22
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 267 place count 25 transition count 22
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 267 place count 25 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 277 place count 20 transition count 17
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 279 place count 19 transition count 16
Applied a total of 279 rules in 14 ms. Remains 19 /254 variables (removed 235) and now considering 16/203 (removed 187) transitions.
// Phase 1: matrix 16 rows 19 cols
[2023-03-17 03:23:56] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-17 03:23:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-17 03:23:56] [INFO ] Invariant cache hit.
[2023-03-17 03:23:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 03:23:56] [INFO ] Invariant cache hit.
[2023-03-17 03:23:56] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 03:23:56] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 03:23:56] [INFO ] Invariant cache hit.
[2023-03-17 03:23:56] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/254 places, 16/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 19/254 places, 16/203 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0) p3)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s14), p3:(GT 2 s11), p1:(LEQ s6 s8), p2:(LEQ 3 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-09 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p1))&&p0)))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 60 transition count 59
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 238 place count 60 transition count 16
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 281 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 281 place count 17 transition count 13
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 287 place count 14 transition count 13
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 289 place count 13 transition count 12
Applied a total of 289 rules in 12 ms. Remains 13 /254 variables (removed 241) and now considering 12/203 (removed 191) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-17 03:23:56] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 03:23:56] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-17 03:23:56] [INFO ] Invariant cache hit.
[2023-03-17 03:23:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 03:23:56] [INFO ] Invariant cache hit.
[2023-03-17 03:23:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 03:23:56] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 03:23:56] [INFO ] Invariant cache hit.
[2023-03-17 03:23:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/254 places, 12/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 13/254 places, 12/203 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s6 s11) (LEQ 1 s8)), p1:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-10 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||X(G(p1)))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 1 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:23:56] [INFO ] Computed 102 place invariants in 2 ms
[2023-03-17 03:23:57] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
[2023-03-17 03:23:57] [INFO ] Invariant cache hit.
[2023-03-17 03:23:57] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-17 03:23:57] [INFO ] Invariant cache hit.
[2023-03-17 03:23:57] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-17 03:23:57] [INFO ] Invariant cache hit.
[2023-03-17 03:23:57] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 2 s58), p1:(GT s76 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8819 reset in 575 ms.
Product exploration explored 100000 steps with 1074 reset in 730 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 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10011 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 03:23:59] [INFO ] Invariant cache hit.
[2023-03-17 03:23:59] [INFO ] [Real]Absence check using 102 positive place invariants in 20 ms returned sat
[2023-03-17 03:23:59] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 03:23:59] [INFO ] [Nat]Absence check using 102 positive place invariants in 11 ms returned sat
[2023-03-17 03:23:59] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 03:23:59] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-17 03:23:59] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4864 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=211 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:24:00] [INFO ] Invariant cache hit.
[2023-03-17 03:24:00] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
[2023-03-17 03:24:00] [INFO ] Invariant cache hit.
[2023-03-17 03:24:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-17 03:24:00] [INFO ] Invariant cache hit.
[2023-03-17 03:24:00] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-17 03:24:00] [INFO ] Invariant cache hit.
[2023-03-17 03:24:00] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 254/254 places, 203/203 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10027 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 03:24:01] [INFO ] Invariant cache hit.
[2023-03-17 03:24:01] [INFO ] [Real]Absence check using 102 positive place invariants in 10 ms returned sat
[2023-03-17 03:24:01] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 03:24:01] [INFO ] [Nat]Absence check using 102 positive place invariants in 11 ms returned sat
[2023-03-17 03:24:01] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 03:24:01] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-17 03:24:01] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4864 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=221 )
Parikh walk visited 1 properties in 22 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12764 reset in 527 ms.
Product exploration explored 100000 steps with 5418 reset in 684 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 98 place count 156 transition count 106
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 98 rules in 17 ms. Remains 156 /254 variables (removed 98) and now considering 106/203 (removed 97) transitions.
// Phase 1: matrix 106 rows 156 cols
[2023-03-17 03:24:03] [INFO ] Computed 53 place invariants in 1 ms
[2023-03-17 03:24:03] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2023-03-17 03:24:03] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 03:24:03] [INFO ] Invariant cache hit.
[2023-03-17 03:24:03] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/254 places, 106/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 156/254 places, 106/203 transitions.
Built C files in :
/tmp/ltsmin13504233035689151031
[2023-03-17 03:24:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13504233035689151031
Running compilation step : cd /tmp/ltsmin13504233035689151031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin13504233035689151031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13504233035689151031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17248994687423992799.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 9 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:24:19] [INFO ] Computed 102 place invariants in 2 ms
[2023-03-17 03:24:19] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
[2023-03-17 03:24:19] [INFO ] Invariant cache hit.
[2023-03-17 03:24:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-17 03:24:19] [INFO ] Invariant cache hit.
[2023-03-17 03:24:19] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-17 03:24:19] [INFO ] Invariant cache hit.
[2023-03-17 03:24:19] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 254/254 places, 203/203 transitions.
Built C files in :
/tmp/ltsmin14035361739468177788
[2023-03-17 03:24:19] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14035361739468177788
Running compilation step : cd /tmp/ltsmin14035361739468177788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin14035361739468177788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14035361739468177788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14357338446376727324.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 03:24:34] [INFO ] Flatten gal took : 12 ms
[2023-03-17 03:24:34] [INFO ] Flatten gal took : 10 ms
[2023-03-17 03:24:34] [INFO ] Time to serialize gal into /tmp/LTL12841918070585172124.gal : 3 ms
[2023-03-17 03:24:34] [INFO ] Time to serialize properties into /tmp/LTL7926184678192200082.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12841918070585172124.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2404490537035029887.hoa' '-atoms' '/tmp/LTL7926184678192200082.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7926184678192200082.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2404490537035029887.hoa
Detected timeout of ITS tools.
[2023-03-17 03:24:49] [INFO ] Flatten gal took : 10 ms
[2023-03-17 03:24:49] [INFO ] Flatten gal took : 10 ms
[2023-03-17 03:24:49] [INFO ] Time to serialize gal into /tmp/LTL11285800317550044217.gal : 2 ms
[2023-03-17 03:24:49] [INFO ] Time to serialize properties into /tmp/LTL275668247217251790.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11285800317550044217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL275668247217251790.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")
Detected timeout of ITS tools.
[2023-03-17 03:25:04] [INFO ] Flatten gal took : 15 ms
[2023-03-17 03:25:04] [INFO ] Applying decomposition
[2023-03-17 03:25:04] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9531512627554957573.txt' '-o' '/tmp/graph9531512627554957573.bin' '-w' '/tmp/graph9531512627554957573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9531512627554957573.bin' '-l' '-1' '-v' '-w' '/tmp/graph9531512627554957573.weights' '-q' '0' '-e' '0.001'
[2023-03-17 03:25:04] [INFO ] Decomposing Gal with order
[2023-03-17 03:25:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 03:25:04] [INFO ] Flatten gal took : 37 ms
[2023-03-17 03:25:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-17 03:25:04] [INFO ] Time to serialize gal into /tmp/LTL1613638167006233445.gal : 3 ms
[2023-03-17 03:25:04] [INFO ] Time to serialize properties into /tmp/LTL14419236945368331837.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1613638167006233445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14419236945368331837.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(gi1.gu28.p55<2)"))||(X(G("(gu1.p73>gu1.pterce)"))))))))
Formula 0 simplified : XXX(G!"(gi1.gu28.p55<2)" & XF!"(gu1.p73>gu1.pterce)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18140120866880858573
[2023-03-17 03:25:20] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18140120866880858573
Running compilation step : cd /tmp/ltsmin18140120866880858573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 301 ms.
Running link step : cd /tmp/ltsmin18140120866880858573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18140120866880858573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-050050-LTLCardinality-12 finished in 98135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((G(p1)||F(p0)))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:25:35] [INFO ] Invariant cache hit.
[2023-03-17 03:25:35] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
[2023-03-17 03:25:35] [INFO ] Invariant cache hit.
[2023-03-17 03:25:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-17 03:25:35] [INFO ] Invariant cache hit.
[2023-03-17 03:25:35] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-17 03:25:35] [INFO ] Invariant cache hit.
[2023-03-17 03:25:35] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s36), p1:(LEQ s241 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 459 ms.
Product exploration explored 100000 steps with 33333 reset in 464 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 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050050-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLCardinality-14 finished in 1642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||X(G(p1)))))))'
[2023-03-17 03:25:36] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14093546480272611637
[2023-03-17 03:25:36] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2023-03-17 03:25:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 03:25:36] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2023-03-17 03:25:36] [INFO ] Applying decomposition
[2023-03-17 03:25:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 03:25:36] [INFO ] Flatten gal took : 9 ms
[2023-03-17 03:25:36] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2023-03-17 03:25:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 03:25:36] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14093546480272611637
Running compilation step : cd /tmp/ltsmin14093546480272611637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7212268291938658071.txt' '-o' '/tmp/graph7212268291938658071.bin' '-w' '/tmp/graph7212268291938658071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7212268291938658071.bin' '-l' '-1' '-v' '-w' '/tmp/graph7212268291938658071.weights' '-q' '0' '-e' '0.001'
[2023-03-17 03:25:36] [INFO ] Decomposing Gal with order
[2023-03-17 03:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 03:25:36] [INFO ] Flatten gal took : 11 ms
[2023-03-17 03:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-17 03:25:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality2960059216053237017.gal : 3 ms
[2023-03-17 03:25:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality17800471691075854454.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2960059216053237017.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17800471691075854454.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(gi1.gi1.gi0.gi2.gu28.p55<2)"))||(X(G("(gu0.p73>gu0.pterce)"))))))))
Formula 0 simplified : XXX(G!"(gi1.gi1.gi0.gi2.gu28.p55<2)" & XF!"(gu0.p73>gu0.pterce)")
Compilation finished in 356 ms.
Running link step : cd /tmp/ltsmin14093546480272611637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14093546480272611637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.245: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.245: LTL layer: formula: X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.245: "X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.245: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.260: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.260: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.262: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.263: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.262: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.264: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.267: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.267: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.332: DFS-FIFO for weak LTL, using special progress label 206
pins2lts-mc-linux64( 0/ 8), 0.332: There are 207 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.332: State length is 255, there are 210 groups
pins2lts-mc-linux64( 0/ 8), 0.332: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.332: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.332: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.332: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.434: ~1 levels ~960 states ~50432 transitions
pins2lts-mc-linux64( 5/ 8), 0.488: ~1 levels ~1920 states ~16944 transitions
pins2lts-mc-linux64( 5/ 8), 0.504: ~1 levels ~3840 states ~16944 transitions
pins2lts-mc-linux64( 5/ 8), 0.512: ~1 levels ~7680 states ~16944 transitions
pins2lts-mc-linux64( 7/ 8), 0.589: ~1 levels ~15360 states ~31760 transitions
pins2lts-mc-linux64( 0/ 8), 0.752: ~1 levels ~30720 states ~188168 transitions
pins2lts-mc-linux64( 0/ 8), 1.963: ~1 levels ~61440 states ~704912 transitions
pins2lts-mc-linux64( 0/ 8), 4.604: ~1 levels ~122880 states ~3931944 transitions
pins2lts-mc-linux64( 0/ 8), 8.280: ~1 levels ~245760 states ~10542888 transitions
pins2lts-mc-linux64( 0/ 8), 15.381: ~1 levels ~491520 states ~23701240 transitions
pins2lts-mc-linux64( 2/ 8), 29.572: ~1 levels ~983040 states ~48078992 transitions
pins2lts-mc-linux64( 1/ 8), 55.570: ~1 levels ~1966080 states ~93787672 transitions
pins2lts-mc-linux64( 6/ 8), 110.774: ~1 levels ~3932160 states ~189767552 transitions
pins2lts-mc-linux64( 2/ 8), 221.707: ~1 levels ~7864320 states ~390901784 transitions
pins2lts-mc-linux64( 4/ 8), 347.369: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 347.546:
pins2lts-mc-linux64( 0/ 8), 347.546: mean standard work distribution: 2.7% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 347.546:
pins2lts-mc-linux64( 0/ 8), 347.546: Explored 11412735 states 575943066 transitions, fanout: 50.465
pins2lts-mc-linux64( 0/ 8), 347.546: Total exploration time 347.190 sec (347.030 sec minimum, 347.106 sec on average)
pins2lts-mc-linux64( 0/ 8), 347.546: States per second: 32872, Transitions per second: 1658870
pins2lts-mc-linux64( 0/ 8), 347.546:
pins2lts-mc-linux64( 0/ 8), 347.546: Progress states detected: 134217167
pins2lts-mc-linux64( 0/ 8), 347.546: Redundant explorations: -91.4968
pins2lts-mc-linux64( 0/ 8), 347.546:
pins2lts-mc-linux64( 0/ 8), 347.546: Queue width: 8B, total height: 158884808, memory: 1212.19MB
pins2lts-mc-linux64( 0/ 8), 347.546: Tree memory: 1059.2MB, 8.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 347.546: Tree fill ratio (roots/leafs): 99.0%/13.0%
pins2lts-mc-linux64( 0/ 8), 347.546: Stored 203 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 347.546: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 347.546: Est. total memory use: 2271.4MB (~2236.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14093546480272611637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14093546480272611637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-17 03:46:15] [INFO ] Flatten gal took : 11 ms
[2023-03-17 03:46:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality15427831083683135114.gal : 2 ms
[2023-03-17 03:46:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality9544274542286255266.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15427831083683135114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9544274542286255266.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-17 04:06:53] [INFO ] Flatten gal took : 12 ms
[2023-03-17 04:06:53] [INFO ] Input system was already deterministic with 203 transitions.
[2023-03-17 04:06:53] [INFO ] Transformed 254 places.
[2023-03-17 04:06:53] [INFO ] Transformed 203 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-17 04:06:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality16764923765237136926.gal : 2 ms
[2023-03-17 04:06:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality4280474355333867781.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16764923765237136926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4280474355333867781.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9496836 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16034236 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="RefineWMG-PT-050050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-050050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r325-tall-167889197500627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050050.tgz
mv RefineWMG-PT-050050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;