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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:54 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.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 15:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:44 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 218K 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-100101-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679027668590

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-100101
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 04:34:30] [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 04:34:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 04:34:30] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-17 04:34:30] [INFO ] Transformed 504 places.
[2023-03-17 04:34:30] [INFO ] Transformed 403 transitions.
[2023-03-17 04:34:30] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-100101-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 44 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 04:34:30] [INFO ] Computed 202 place invariants in 21 ms
[2023-03-17 04:34:31] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
[2023-03-17 04:34:31] [INFO ] Invariant cache hit.
[2023-03-17 04:34:31] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-17 04:34:31] [INFO ] Invariant cache hit.
[2023-03-17 04:34:31] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-17 04:34:31] [INFO ] Invariant cache hit.
[2023-03-17 04:34:31] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1146 ms. Remains : 504/504 places, 403/403 transitions.
Support contains 44 out of 504 places after structural reductions.
[2023-03-17 04:34:32] [INFO ] Flatten gal took : 57 ms
[2023-03-17 04:34:32] [INFO ] Flatten gal took : 26 ms
[2023-03-17 04:34:32] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 32) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) 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 27) 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 27) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) 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 25) seen :0
Running SMT prover for 25 properties.
[2023-03-17 04:34:32] [INFO ] Invariant cache hit.
[2023-03-17 04:34:32] [INFO ] [Real]Absence check using 202 positive place invariants in 27 ms returned sat
[2023-03-17 04:34:32] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-17 04:34:33] [INFO ] [Nat]Absence check using 202 positive place invariants in 27 ms returned sat
[2023-03-17 04:34:34] [INFO ] After 793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-17 04:34:35] [INFO ] After 1813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 586 ms.
[2023-03-17 04:34:35] [INFO ] After 2906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Finished Parikh walk after 19885 steps, including 0 resets, run visited all 3 properties in 226 ms. (steps per millisecond=87 )
Parikh walk visited 25 properties in 2605 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RefineWMG-PT-100101-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(p0) U p1))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 488 place count 110 transition count 16
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 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 581 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 587 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 589 place count 13 transition count 12
Applied a total of 589 rules in 34 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-17 04:34:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 04:34:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 04:34:38] [INFO ] Invariant cache hit.
[2023-03-17 04:34:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 04:34:38] [INFO ] Invariant cache hit.
[2023-03-17 04:34:38] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 04:34:38] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 04:34:38] [INFO ] Invariant cache hit.
[2023-03-17 04:34:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 13/504 places, 12/403 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s11 s6), p0:(LEQ 2 s9)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-00 finished in 428 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((p0||F(p1)||(p2&&X(p3)))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 04:34:39] [INFO ] Computed 202 place invariants in 5 ms
[2023-03-17 04:34:39] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
[2023-03-17 04:34:39] [INFO ] Invariant cache hit.
[2023-03-17 04:34:39] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-17 04:34:39] [INFO ] Invariant cache hit.
[2023-03-17 04:34:39] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-17 04:34:39] [INFO ] Invariant cache hit.
[2023-03-17 04:34:40] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 865 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (LEQ 3 s224) (LEQ 2 s395)), p0:(LEQ 1 s415), p2:(LEQ 3 s224), p3:(LEQ s154 s102)], 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 6 reset in 1797 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 100 in 2 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-01 finished in 2859 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((G((p0 U p1))&&F(p2))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 1 with 92 rules applied. Total rules applied 488 place count 108 transition count 15
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 582 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 582 place count 15 transition count 11
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 588 place count 12 transition count 11
Applied a total of 588 rules in 27 ms. Remains 12 /504 variables (removed 492) and now considering 11/403 (removed 392) transitions.
// Phase 1: matrix 11 rows 12 cols
[2023-03-17 04:34:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 04:34:42] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-17 04:34:42] [INFO ] Invariant cache hit.
[2023-03-17 04:34:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 04:34:42] [INFO ] Invariant cache hit.
[2023-03-17 04:34:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 04:34:42] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 04:34:42] [INFO ] Invariant cache hit.
[2023-03-17 04:34:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/504 places, 11/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 12/504 places, 11/403 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s5), p0:(LEQ 3 s10), p2:(LEQ 1 s8)], 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 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-02 finished in 352 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 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 400 place count 104 transition count 104
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 496 place count 104 transition count 8
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 594 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 594 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 596 place count 6 transition count 6
Applied a total of 596 rules in 50 ms. Remains 6 /504 variables (removed 498) and now considering 6/403 (removed 397) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-17 04:34:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 04:34:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 04:34:42] [INFO ] Invariant cache hit.
[2023-03-17 04:34:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 04:34:42] [INFO ] Invariant cache hit.
[2023-03-17 04:34:42] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-17 04:34:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 04:34:42] [INFO ] Invariant cache hit.
[2023-03-17 04:34:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/504 places, 6/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 6/504 places, 6/403 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-03 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:(LEQ 1 s5)], 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 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-03 finished in 376 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((G(p0)||X(p1)))||X(G(p0)))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 04:34:42] [INFO ] Computed 202 place invariants in 5 ms
[2023-03-17 04:34:42] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
[2023-03-17 04:34:42] [INFO ] Invariant cache hit.
[2023-03-17 04:34:43] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-17 04:34:43] [INFO ] Invariant cache hit.
[2023-03-17 04:34:43] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-17 04:34:43] [INFO ] Invariant cache hit.
[2023-03-17 04:34:43] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 889 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GT 3 s361), p0:(GT 1 s183)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-05 finished in 1128 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(F(p0)))&&F(p1)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:34:43] [INFO ] Invariant cache hit.
[2023-03-17 04:34:44] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
[2023-03-17 04:34:44] [INFO ] Invariant cache hit.
[2023-03-17 04:34:44] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-17 04:34:44] [INFO ] Invariant cache hit.
[2023-03-17 04:34:44] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-17 04:34:44] [INFO ] Invariant cache hit.
[2023-03-17 04:34:44] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s153 s263), p0:(LEQ 3 s81)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 327 reset in 1567 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-06 finished in 2636 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((p0 U (p1||G(p0)))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 299 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 3 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 397 place count 106 transition count 105
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 94 rules applied. Total rules applied 491 place count 106 transition count 11
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 95 rules applied. Total rules applied 586 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 587 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 589 place count 10 transition count 9
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 4 with 2 rules applied. Total rules applied 591 place count 9 transition count 8
Applied a total of 591 rules in 22 ms. Remains 9 /504 variables (removed 495) and now considering 8/403 (removed 395) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-17 04:34:46] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 04:34:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-17 04:34:46] [INFO ] Invariant cache hit.
[2023-03-17 04:34:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 04:34:46] [INFO ] Invariant cache hit.
[2023-03-17 04:34:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-17 04:34:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 04:34:46] [INFO ] Invariant cache hit.
[2023-03-17 04:34:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/504 places, 8/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 9/504 places, 8/403 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GT 3 s6) (GT 1 s8)), p0:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-07 finished in 204 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(p0)||X((X(p1) U (X(G(p1))||(p2&&X((p1&&X(F(p2))))))))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 04:34:46] [INFO ] Computed 202 place invariants in 4 ms
[2023-03-17 04:34:46] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
[2023-03-17 04:34:46] [INFO ] Invariant cache hit.
[2023-03-17 04:34:47] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-17 04:34:47] [INFO ] Invariant cache hit.
[2023-03-17 04:34:47] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-17 04:34:47] [INFO ] Invariant cache hit.
[2023-03-17 04:34:47] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 873 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p0:(GT s402 s487), p2:(GT s110 s108), p1:(LEQ 1 s221)], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 72 reset in 1665 ms.
Product exploration explored 100000 steps with 298 reset in 1681 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 294 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 04:34:52] [INFO ] Invariant cache hit.
[2023-03-17 04:34:52] [INFO ] [Real]Absence check using 202 positive place invariants in 28 ms returned sat
[2023-03-17 04:34:52] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 04:34:52] [INFO ] [Nat]Absence check using 202 positive place invariants in 24 ms returned sat
[2023-03-17 04:34:52] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 04:34:52] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-17 04:34:52] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 18863 steps, including 0 resets, run visited all 3 properties in 305 ms. (steps per millisecond=61 )
Parikh walk visited 3 properties in 305 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p2 (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 4 factoid took 439 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:34:54] [INFO ] Invariant cache hit.
[2023-03-17 04:34:54] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
[2023-03-17 04:34:54] [INFO ] Invariant cache hit.
[2023-03-17 04:34:54] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-17 04:34:54] [INFO ] Invariant cache hit.
[2023-03-17 04:34:54] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-17 04:34:54] [INFO ] Invariant cache hit.
[2023-03-17 04:34:54] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 504/504 places, 403/403 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 04:34:55] [INFO ] Invariant cache hit.
[2023-03-17 04:34:55] [INFO ] [Real]Absence check using 202 positive place invariants in 25 ms returned sat
[2023-03-17 04:34:55] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 04:34:55] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2023-03-17 04:34:56] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 04:34:56] [INFO ] After 328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-17 04:34:56] [INFO ] After 541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 18830 steps, including 0 resets, run visited all 3 properties in 237 ms. (steps per millisecond=79 )
Parikh walk visited 3 properties in 238 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p2 (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 3 factoid took 351 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 259 reset in 1481 ms.
Product exploration explored 100000 steps with 311 reset in 1573 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 292 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 195 place count 310 transition count 210
Deduced a syphon composed of 98 places in 0 ms
Applied a total of 195 rules in 43 ms. Remains 310 /504 variables (removed 194) and now considering 210/403 (removed 193) transitions.
// Phase 1: matrix 210 rows 310 cols
[2023-03-17 04:35:01] [INFO ] Computed 105 place invariants in 1 ms
[2023-03-17 04:35:01] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
[2023-03-17 04:35:01] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-17 04:35:01] [INFO ] Invariant cache hit.
[2023-03-17 04:35:01] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/504 places, 210/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 310/504 places, 210/403 transitions.
Built C files in :
/tmp/ltsmin9799893370861089471
[2023-03-17 04:35:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9799893370861089471
Running compilation step : cd /tmp/ltsmin9799893370861089471;'/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 674 ms.
Running link step : cd /tmp/ltsmin9799893370861089471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9799893370861089471;'/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/stateBased15340171047444011425.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 34 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 04:35:16] [INFO ] Computed 202 place invariants in 5 ms
[2023-03-17 04:35:16] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
[2023-03-17 04:35:16] [INFO ] Invariant cache hit.
[2023-03-17 04:35:16] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-17 04:35:16] [INFO ] Invariant cache hit.
[2023-03-17 04:35:17] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-17 04:35:17] [INFO ] Invariant cache hit.
[2023-03-17 04:35:17] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 900 ms. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin12356433621880358758
[2023-03-17 04:35:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12356433621880358758
Running compilation step : cd /tmp/ltsmin12356433621880358758;'/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 559 ms.
Running link step : cd /tmp/ltsmin12356433621880358758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12356433621880358758;'/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/stateBased2157179723840877663.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 04:35:32] [INFO ] Flatten gal took : 21 ms
[2023-03-17 04:35:32] [INFO ] Flatten gal took : 22 ms
[2023-03-17 04:35:32] [INFO ] Time to serialize gal into /tmp/LTL3876579338153333989.gal : 4 ms
[2023-03-17 04:35:32] [INFO ] Time to serialize properties into /tmp/LTL712985340657724123.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/LTL3876579338153333989.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11859629019939921478.hoa' '-atoms' '/tmp/LTL712985340657724123.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...317
Loading property file /tmp/LTL712985340657724123.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11859629019939921478.hoa
Detected timeout of ITS tools.
[2023-03-17 04:35:47] [INFO ] Flatten gal took : 18 ms
[2023-03-17 04:35:47] [INFO ] Flatten gal took : 17 ms
[2023-03-17 04:35:47] [INFO ] Time to serialize gal into /tmp/LTL15270145894037837624.gal : 4 ms
[2023-03-17 04:35:47] [INFO ] Time to serialize properties into /tmp/LTL2760525957839024046.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/LTL15270145894037837624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2760525957839024046.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 : !(((F("(p399>p484)"))||(X((X("(p218>=1)"))U((X(G("(p218>=1)")))||(("(p107>p105)")&&(X(("(p218>=1)")&&(X(F("(p107>p105)")))))))))))
Formula 0 simplified : G!"(p399>p484)" & X(X!"(p218>=1)" R (XF!"(p218>=1)" & (!"(p107>p105)" | X(!"(p218>=1)" | XG!"(p107>p105)"))))
Detected timeout of ITS tools.
[2023-03-17 04:36:02] [INFO ] Flatten gal took : 18 ms
[2023-03-17 04:36:02] [INFO ] Applying decomposition
[2023-03-17 04:36:02] [INFO ] Flatten gal took : 17 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/graph2399869450533962716.txt' '-o' '/tmp/graph2399869450533962716.bin' '-w' '/tmp/graph2399869450533962716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2399869450533962716.bin' '-l' '-1' '-v' '-w' '/tmp/graph2399869450533962716.weights' '-q' '0' '-e' '0.001'
[2023-03-17 04:36:03] [INFO ] Decomposing Gal with order
[2023-03-17 04:36:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 04:36:03] [INFO ] Flatten gal took : 50 ms
[2023-03-17 04:36:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-17 04:36:03] [INFO ] Time to serialize gal into /tmp/LTL14451118268290155560.gal : 4 ms
[2023-03-17 04:36:03] [INFO ] Time to serialize properties into /tmp/LTL13430473400657189248.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/LTL14451118268290155560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13430473400657189248.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...277
Read 1 LTL properties
Checking formula 0 : !(((F("(gu194.p399>gu194.p484)"))||(X((X("(gi4.gi0.gu105.p218>=1)"))U((X(G("(gi4.gi0.gu105.p218>=1)")))||(("(gu51.p107>gu51.p105)")&&(...225
Formula 0 simplified : G!"(gu194.p399>gu194.p484)" & X(X!"(gi4.gi0.gu105.p218>=1)" R (XF!"(gi4.gi0.gu105.p218>=1)" & (!"(gu51.p107>gu51.p105)" | X(!"(gi4.g...206
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4886965935657416364
[2023-03-17 04:36:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4886965935657416364
Running compilation step : cd /tmp/ltsmin4886965935657416364;'/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 588 ms.
Running link step : cd /tmp/ltsmin4886965935657416364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4886965935657416364;'/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' '(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-100101-LTLCardinality-08 finished in 106667 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||G((p1||(p2 U p0)))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 293 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 394 place count 112 transition count 111
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 1 with 91 rules applied. Total rules applied 485 place count 112 transition count 20
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 576 place count 21 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 576 place count 21 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 584 place count 17 transition count 16
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 586 place count 16 transition count 15
Applied a total of 586 rules in 19 ms. Remains 16 /504 variables (removed 488) and now considering 15/403 (removed 388) transitions.
// Phase 1: matrix 15 rows 16 cols
[2023-03-17 04:36:33] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 04:36:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-17 04:36:33] [INFO ] Invariant cache hit.
[2023-03-17 04:36:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 04:36:33] [INFO ] Invariant cache hit.
[2023-03-17 04:36:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-17 04:36:33] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 04:36:33] [INFO ] Invariant cache hit.
[2023-03-17 04:36:33] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/504 places, 15/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 16/504 places, 15/403 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s9), p1:(LEQ s6 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 123 ms.
Product exploration explored 100000 steps with 0 reset in 204 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 941 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-17 04:36:34] [INFO ] Invariant cache hit.
[2023-03-17 04:36:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 04:36:34] [INFO ] Invariant cache hit.
[2023-03-17 04:36:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 04:36:34] [INFO ] Invariant cache hit.
[2023-03-17 04:36:34] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-17 04:36:34] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 04:36:34] [INFO ] Invariant cache hit.
[2023-03-17 04:36:34] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 16/16 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1359 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=679 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 162 ms.
Built C files in :
/tmp/ltsmin15208326632426751872
[2023-03-17 04:36:35] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2023-03-17 04:36:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 04:36:35] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2023-03-17 04:36:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 04:36:35] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2023-03-17 04:36:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 04:36:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15208326632426751872
Running compilation step : cd /tmp/ltsmin15208326632426751872;'/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 87 ms.
Running link step : cd /tmp/ltsmin15208326632426751872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15208326632426751872;'/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/stateBased4833117027777680516.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-100101-LTLCardinality-10 finished in 2476 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 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 04:36:35] [INFO ] Computed 202 place invariants in 4 ms
[2023-03-17 04:36:36] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
[2023-03-17 04:36:36] [INFO ] Invariant cache hit.
[2023-03-17 04:36:36] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-17 04:36:36] [INFO ] Invariant cache hit.
[2023-03-17 04:36:36] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-17 04:36:36] [INFO ] Invariant cache hit.
[2023-03-17 04:36:36] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 909 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT s337 s389) (GT s196 s9))], 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 834 ms.
Product exploration explored 100000 steps with 50000 reset in 892 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 74 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-100101-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100101-LTLCardinality-11 finished in 2834 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((p0 U X(G((p1&&X(p1)))))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:36:38] [INFO ] Invariant cache hit.
[2023-03-17 04:36:38] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
[2023-03-17 04:36:38] [INFO ] Invariant cache hit.
[2023-03-17 04:36:39] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-17 04:36:39] [INFO ] Invariant cache hit.
[2023-03-17 04:36:39] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-17 04:36:39] [INFO ] Invariant cache hit.
[2023-03-17 04:36:39] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 853 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p1:(GT 3 s289), p0:(GT 2 s269)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25085 reset in 891 ms.
Product exploration explored 100000 steps with 25044 reset in 963 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 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 330 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 166569 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166569 steps, saw 162120 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 04:36:45] [INFO ] Invariant cache hit.
[2023-03-17 04:36:45] [INFO ] [Real]Absence check using 202 positive place invariants in 25 ms returned sat
[2023-03-17 04:36:45] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 04:36:45] [INFO ] [Nat]Absence check using 202 positive place invariants in 26 ms returned sat
[2023-03-17 04:36:46] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 04:36:46] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-17 04:36:46] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 4540 steps, including 0 resets, run visited all 2 properties in 84 ms. (steps per millisecond=54 )
Parikh walk visited 5 properties in 283 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 455 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:36:47] [INFO ] Invariant cache hit.
[2023-03-17 04:36:47] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
[2023-03-17 04:36:47] [INFO ] Invariant cache hit.
[2023-03-17 04:36:47] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-17 04:36:47] [INFO ] Invariant cache hit.
[2023-03-17 04:36:48] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-17 04:36:48] [INFO ] Invariant cache hit.
[2023-03-17 04:36:48] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 504/504 places, 403/403 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 p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10020 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 178006 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178006 steps, saw 173228 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 04:36:52] [INFO ] Invariant cache hit.
[2023-03-17 04:36:52] [INFO ] [Real]Absence check using 202 positive place invariants in 26 ms returned sat
[2023-03-17 04:36:52] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 04:36:52] [INFO ] [Nat]Absence check using 202 positive place invariants in 25 ms returned sat
[2023-03-17 04:36:52] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 04:36:52] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-17 04:36:52] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 4464 steps, including 0 resets, run visited all 2 properties in 60 ms. (steps per millisecond=74 )
Parikh walk visited 5 properties in 226 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 486 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 25004 reset in 869 ms.
Product exploration explored 100000 steps with 24934 reset in 934 ms.
Applying partial POR strategy [false, true, false, true, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 200 place count 304 transition count 204
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 200 rules in 32 ms. Remains 304 /504 variables (removed 200) and now considering 204/403 (removed 199) transitions.
// Phase 1: matrix 204 rows 304 cols
[2023-03-17 04:36:56] [INFO ] Computed 102 place invariants in 2 ms
[2023-03-17 04:36:56] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
[2023-03-17 04:36:56] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 04:36:56] [INFO ] Invariant cache hit.
[2023-03-17 04:36:56] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 304/504 places, 204/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 304/504 places, 204/403 transitions.
Built C files in :
/tmp/ltsmin5889046853025192668
[2023-03-17 04:36:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5889046853025192668
Running compilation step : cd /tmp/ltsmin5889046853025192668;'/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 580 ms.
Running link step : cd /tmp/ltsmin5889046853025192668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5889046853025192668;'/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/stateBased7622510178803748675.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 04:37:11] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-17 04:37:11] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
[2023-03-17 04:37:11] [INFO ] Invariant cache hit.
[2023-03-17 04:37:11] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-17 04:37:11] [INFO ] Invariant cache hit.
[2023-03-17 04:37:12] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-17 04:37:12] [INFO ] Invariant cache hit.
[2023-03-17 04:37:12] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 837 ms. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin11003408496911207769
[2023-03-17 04:37:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11003408496911207769
Running compilation step : cd /tmp/ltsmin11003408496911207769;'/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 564 ms.
Running link step : cd /tmp/ltsmin11003408496911207769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11003408496911207769;'/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/stateBased15044033087824782842.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 04:37:27] [INFO ] Flatten gal took : 18 ms
[2023-03-17 04:37:27] [INFO ] Flatten gal took : 15 ms
[2023-03-17 04:37:27] [INFO ] Time to serialize gal into /tmp/LTL18420147724585991807.gal : 2 ms
[2023-03-17 04:37:27] [INFO ] Time to serialize properties into /tmp/LTL17672195439210905782.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/LTL18420147724585991807.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6081084324763609357.hoa' '-atoms' '/tmp/LTL17672195439210905782.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...319
Loading property file /tmp/LTL17672195439210905782.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6081084324763609357.hoa
Detected timeout of ITS tools.
[2023-03-17 04:37:42] [INFO ] Flatten gal took : 25 ms
[2023-03-17 04:37:42] [INFO ] Flatten gal took : 14 ms
[2023-03-17 04:37:42] [INFO ] Time to serialize gal into /tmp/LTL10869089706421611100.gal : 2 ms
[2023-03-17 04:37:42] [INFO ] Time to serialize properties into /tmp/LTL9321195697181055690.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/LTL10869089706421611100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9321195697181055690.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(("(p266<2)")U(X(G(("(p286<3)")&&(X("(p286<3)"))))))))
Formula 0 simplified : X(!"(p266<2)" R XF(!"(p286<3)" | X!"(p286<3)"))
Detected timeout of ITS tools.
[2023-03-17 04:37:57] [INFO ] Flatten gal took : 13 ms
[2023-03-17 04:37:57] [INFO ] Applying decomposition
[2023-03-17 04:37:57] [INFO ] Flatten gal took : 13 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/graph732697263721778200.txt' '-o' '/tmp/graph732697263721778200.bin' '-w' '/tmp/graph732697263721778200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph732697263721778200.bin' '-l' '-1' '-v' '-w' '/tmp/graph732697263721778200.weights' '-q' '0' '-e' '0.001'
[2023-03-17 04:37:57] [INFO ] Decomposing Gal with order
[2023-03-17 04:37:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 04:37:57] [INFO ] Flatten gal took : 19 ms
[2023-03-17 04:37:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-17 04:37:57] [INFO ] Time to serialize gal into /tmp/LTL10819058587903123763.gal : 5 ms
[2023-03-17 04:37:57] [INFO ] Time to serialize properties into /tmp/LTL17754597739397788100.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/LTL10819058587903123763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17754597739397788100.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((X(("(i18.u125.p266<2)")U(X(G(("(i19.u132.p286<3)")&&(X("(i19.u132.p286<3)"))))))))
Formula 0 simplified : X(!"(i18.u125.p266<2)" R XF(!"(i19.u132.p286<3)" | X!"(i19.u132.p286<3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16048906808380949028
[2023-03-17 04:38:12] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16048906808380949028
Running compilation step : cd /tmp/ltsmin16048906808380949028;'/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 561 ms.
Running link step : cd /tmp/ltsmin16048906808380949028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16048906808380949028;'/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(((LTLAPp0==true) U X([](((LTLAPp1==true)&&X((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-100101-LTLCardinality-13 finished in 109377 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)) U (p1&&X(p2))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:38:28] [INFO ] Invariant cache hit.
[2023-03-17 04:38:28] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2023-03-17 04:38:28] [INFO ] Invariant cache hit.
[2023-03-17 04:38:28] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-17 04:38:28] [INFO ] Invariant cache hit.
[2023-03-17 04:38:28] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-17 04:38:28] [INFO ] Invariant cache hit.
[2023-03-17 04:38:28] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 858 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s480 s65), p0:(LEQ 3 s304), p2:(LEQ 3 s335)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1254 ms.
Stack based approach found an accepted trace after 388 steps with 0 reset with depth 389 and stack size 389 in 5 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-14 finished in 2302 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(p0)||X((X(p1) U (X(G(p1))||(p2&&X((p1&&X(F(p2))))))))))'
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((p0 U X(G((p1&&X(p1)))))))'
Found a Lengthening insensitive property : RefineWMG-PT-100101-LTLCardinality-13
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 400 place count 104 transition count 104
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 493 place count 104 transition count 11
Reduce places removed 93 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 590 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 590 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 592 place count 8 transition count 8
Applied a total of 592 rules in 15 ms. Remains 8 /504 variables (removed 496) and now considering 8/403 (removed 395) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-17 04:38:30] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 04:38:30] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
[2023-03-17 04:38:30] [INFO ] Invariant cache hit.
[2023-03-17 04:38:30] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 04:38:30] [INFO ] Invariant cache hit.
[2023-03-17 04:38:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-17 04:38:30] [INFO ] Invariant cache hit.
[2023-03-17 04:38:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/504 places, 8/403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 100 ms. Remains : 8/504 places, 8/403 transitions.
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p1:(GT 3 s7), p0:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 75 steps with 18 reset in 0 ms.
Treatment of property RefineWMG-PT-100101-LTLCardinality-13 finished in 337 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-17 04:38:30] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3261225876785619790
[2023-03-17 04:38:30] [INFO ] Computing symmetric may disable matrix : 403 transitions.
[2023-03-17 04:38:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 04:38:30] [INFO ] Computing symmetric may enable matrix : 403 transitions.
[2023-03-17 04:38:30] [INFO ] Applying decomposition
[2023-03-17 04:38:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 04:38:30] [INFO ] Flatten gal took : 12 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/graph16562176073067482139.txt' '-o' '/tmp/graph16562176073067482139.bin' '-w' '/tmp/graph16562176073067482139.weights'
[2023-03-17 04:38:30] [INFO ] Computing Do-Not-Accords matrix : 403 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16562176073067482139.bin' '-l' '-1' '-v' '-w' '/tmp/graph16562176073067482139.weights' '-q' '0' '-e' '0.001'
[2023-03-17 04:38:30] [INFO ] Decomposing Gal with order
[2023-03-17 04:38:30] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 04:38:30] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3261225876785619790
Running compilation step : cd /tmp/ltsmin3261225876785619790;'/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'
[2023-03-17 04:38:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 04:38:30] [INFO ] Flatten gal took : 17 ms
[2023-03-17 04:38:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-17 04:38:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality5017547383969818463.gal : 3 ms
[2023-03-17 04:38:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality11976079895608559956.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/LTLCardinality5017547383969818463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11976079895608559956.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 : !(((F("(gu194.p399>gu194.p484)"))||(X((X("(gi4.gu105.p218>=1)"))U((X(G("(gi4.gu105.p218>=1)")))||(("(gu52.p107>gu52.p105)")&&(X(("(gi4...213
Formula 0 simplified : G!"(gu194.p399>gu194.p484)" & X(X!"(gi4.gu105.p218>=1)" R (XF!"(gi4.gu105.p218>=1)" & (!"(gu52.p107>gu52.p105)" | X(!"(gi4.gu105.p21...194
Compilation finished in 800 ms.
Running link step : cd /tmp/ltsmin3261225876785619790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3261225876785619790;'/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' '(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: LTL layer: formula: (<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))
pins2lts-mc-linux64( 3/ 8), 0.016: "(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.016: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.148: DFS-FIFO for weak LTL, using special progress label 409
pins2lts-mc-linux64( 0/ 8), 0.148: There are 410 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.148: State length is 505, there are 415 groups
pins2lts-mc-linux64( 0/ 8), 0.148: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.148: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.148: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.148: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.567: ~1 levels ~960 states ~89472 transitions
pins2lts-mc-linux64( 3/ 8), 0.773: ~1 levels ~1920 states ~182528 transitions
pins2lts-mc-linux64( 3/ 8), 1.242: ~1 levels ~3840 states ~375296 transitions
pins2lts-mc-linux64( 3/ 8), 1.940: ~1 levels ~7680 states ~764984 transitions
pins2lts-mc-linux64( 6/ 8), 2.895: ~1 levels ~15360 states ~1422344 transitions
pins2lts-mc-linux64( 6/ 8), 4.510: ~1 levels ~30720 states ~2836760 transitions
pins2lts-mc-linux64( 6/ 8), 7.409: ~1 levels ~61440 states ~5831816 transitions
pins2lts-mc-linux64( 6/ 8), 13.137: ~1 levels ~122880 states ~12053936 transitions
pins2lts-mc-linux64( 5/ 8), 24.448: ~1 levels ~245760 states ~24038024 transitions
pins2lts-mc-linux64( 3/ 8), 44.634: ~1 levels ~491520 states ~46343456 transitions
pins2lts-mc-linux64( 3/ 8), 88.743: ~1 levels ~983040 states ~93650160 transitions
pins2lts-mc-linux64( 3/ 8), 179.296: ~1 levels ~1966080 states ~191386552 transitions
pins2lts-mc-linux64( 3/ 8), 364.011: ~1 levels ~3932160 states ~391096992 transitions
pins2lts-mc-linux64( 6/ 8), 484.645: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 484.956:
pins2lts-mc-linux64( 0/ 8), 484.956: mean standard work distribution: 2.0% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 484.956:
pins2lts-mc-linux64( 0/ 8), 484.956: Explored 4967939 states 495407099 transitions, fanout: 99.721
pins2lts-mc-linux64( 0/ 8), 484.956: Total exploration time 484.780 sec (484.520 sec minimum, 484.591 sec on average)
pins2lts-mc-linux64( 0/ 8), 484.956: States per second: 10248, Transitions per second: 1021922
pins2lts-mc-linux64( 0/ 8), 484.956:
pins2lts-mc-linux64( 0/ 8), 484.956: Progress states detected: 134217000
pins2lts-mc-linux64( 0/ 8), 484.956: Redundant explorations: -96.2986
pins2lts-mc-linux64( 0/ 8), 484.956:
pins2lts-mc-linux64( 0/ 8), 484.956: Queue width: 8B, total height: 156083371, memory: 1190.82MB
pins2lts-mc-linux64( 0/ 8), 484.956: Tree memory: 1093.5MB, 8.5 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 484.956: Tree fill ratio (roots/leafs): 99.0%/27.0%
pins2lts-mc-linux64( 0/ 8), 484.956: Stored 430 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 484.956: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 484.956: Est. total memory use: 2284.3MB (~2214.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3261225876785619790;'/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' '(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3261225876785619790;'/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' '(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==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 04:59:51] [INFO ] Flatten gal took : 12 ms
[2023-03-17 04:59:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality7158511614403626987.gal : 3 ms
[2023-03-17 04:59:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality6013189638322480129.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/LTLCardinality7158511614403626987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6013189638322480129.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...297
Read 1 LTL properties
Checking formula 0 : !(((F("(p399>p484)"))||(X((X("(p218>=1)"))U((X(G("(p218>=1)")))||(("(p107>p105)")&&(X(("(p218>=1)")&&(X(F("(p107>p105)")))))))))))
Formula 0 simplified : G!"(p399>p484)" & X(X!"(p218>=1)" R (XF!"(p218>=1)" & (!"(p107>p105)" | X(!"(p218>=1)" | XG!"(p107>p105)"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-17 05:21:11] [INFO ] Flatten gal took : 22 ms
[2023-03-17 05:21:11] [INFO ] Input system was already deterministic with 403 transitions.
[2023-03-17 05:21:11] [INFO ] Transformed 504 places.
[2023-03-17 05:21:11] [INFO ] Transformed 403 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 05:21:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality12253958839964262338.gal : 2 ms
[2023-03-17 05:21:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality6336225415085476139.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/LTLCardinality12253958839964262338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6336225415085476139.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 : !(((F("(p399>p484)"))||(X((X("(p218>=1)"))U((X(G("(p218>=1)")))||(("(p107>p105)")&&(X(("(p218>=1)")&&(X(F("(p107>p105)")))))))))))
Formula 0 simplified : G!"(p399>p484)" & X(X!"(p218>=1)" R (XF!"(p218>=1)" & (!"(p107>p105)" | X(!"(p218>=1)" | XG!"(p107>p105)"))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8309112 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034764 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-100101"
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-100101, 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-167889197500651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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