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.r101-tall-167814475400499.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 DES-PT-60b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.6K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 139K Mar 5 18:22 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 DES-PT-60b-LTLCardinality-00
FORMULA_NAME DES-PT-60b-LTLCardinality-01
FORMULA_NAME DES-PT-60b-LTLCardinality-02
FORMULA_NAME DES-PT-60b-LTLCardinality-03
FORMULA_NAME DES-PT-60b-LTLCardinality-04
FORMULA_NAME DES-PT-60b-LTLCardinality-05
FORMULA_NAME DES-PT-60b-LTLCardinality-06
FORMULA_NAME DES-PT-60b-LTLCardinality-07
FORMULA_NAME DES-PT-60b-LTLCardinality-08
FORMULA_NAME DES-PT-60b-LTLCardinality-09
FORMULA_NAME DES-PT-60b-LTLCardinality-10
FORMULA_NAME DES-PT-60b-LTLCardinality-11
FORMULA_NAME DES-PT-60b-LTLCardinality-12
FORMULA_NAME DES-PT-60b-LTLCardinality-13
FORMULA_NAME DES-PT-60b-LTLCardinality-14
FORMULA_NAME DES-PT-60b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678281450808

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=DES-PT-60b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 13:17:32] [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-08 13:17:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 13:17:32] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-08 13:17:32] [INFO ] Transformed 519 places.
[2023-03-08 13:17:32] [INFO ] Transformed 470 transitions.
[2023-03-08 13:17:32] [INFO ] Found NUPN structural information;
[2023-03-08 13:17:32] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-60b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 492 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 492 transition count 446
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 479 transition count 433
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 479 transition count 433
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 87 place count 479 transition count 423
Applied a total of 87 rules in 103 ms. Remains 479 /519 variables (removed 40) and now considering 423/470 (removed 47) transitions.
// Phase 1: matrix 423 rows 479 cols
[2023-03-08 13:17:32] [INFO ] Computed 62 place invariants in 60 ms
[2023-03-08 13:17:33] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-08 13:17:33] [INFO ] Invariant cache hit.
[2023-03-08 13:17:33] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2023-03-08 13:17:33] [INFO ] Invariant cache hit.
[2023-03-08 13:17:33] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 479/519 places, 423/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1405 ms. Remains : 479/519 places, 423/470 transitions.
Support contains 26 out of 479 places after structural reductions.
[2023-03-08 13:17:34] [INFO ] Flatten gal took : 61 ms
[2023-03-08 13:17:34] [INFO ] Flatten gal took : 28 ms
[2023-03-08 13:17:34] [INFO ] Input system was already deterministic with 423 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 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 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 13:17:34] [INFO ] Invariant cache hit.
[2023-03-08 13:17:34] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 13:17:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 13:17:35] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 33 ms returned sat
[2023-03-08 13:17:35] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 13:17:36] [INFO ] Deduced a trap composed of 11 places in 814 ms of which 39 ms to minimize.
[2023-03-08 13:17:36] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2023-03-08 13:17:36] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2023-03-08 13:17:36] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2023-03-08 13:17:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1128 ms
[2023-03-08 13:17:37] [INFO ] After 2069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-08 13:17:37] [INFO ] After 2537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 1 properties in 393 ms.
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 423/423 transitions.
Graph (complete) has 1140 edges and 479 vertex of which 473 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 473 transition count 405
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 460 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 459 transition count 404
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 31 place count 459 transition count 392
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 55 place count 447 transition count 392
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 444 transition count 389
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 444 transition count 389
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 444 transition count 386
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 443 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 66 place count 443 transition count 384
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 442 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 441 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 441 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 71 place count 441 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 71 place count 441 transition count 381
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 73 place count 440 transition count 381
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 225 place count 364 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 231 place count 361 transition count 313
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 361 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 360 transition count 312
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 360 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 359 transition count 311
Applied a total of 235 rules in 211 ms. Remains 359 /479 variables (removed 120) and now considering 311/423 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 359/479 places, 311/423 transitions.
Incomplete random walk after 10000 steps, including 485 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 785812 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 785812 steps, saw 110904 distinct states, run finished after 3002 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 311 rows 359 cols
[2023-03-08 13:17:41] [INFO ] Computed 61 place invariants in 11 ms
[2023-03-08 13:17:41] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2023-03-08 13:17:41] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 13:17:41] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 13:17:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 13:17:41] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 122 ms returned sat
[2023-03-08 13:17:42] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 13:17:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:17:42] [INFO ] After 141ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 13:17:42] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-08 13:17:42] [INFO ] After 914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 138 ms.
Support contains 5 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 311/311 transitions.
Applied a total of 0 rules in 12 ms. Remains 359 /359 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 359/359 places, 311/311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 311/311 transitions.
Applied a total of 0 rules in 12 ms. Remains 359 /359 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2023-03-08 13:17:42] [INFO ] Invariant cache hit.
[2023-03-08 13:17:42] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-08 13:17:42] [INFO ] Invariant cache hit.
[2023-03-08 13:17:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:17:43] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-08 13:17:43] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-08 13:17:43] [INFO ] Invariant cache hit.
[2023-03-08 13:17:43] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 949 ms. Remains : 359/359 places, 311/311 transitions.
Graph (complete) has 1250 edges and 359 vertex of which 358 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 358 transition count 311
Applied a total of 2 rules in 23 ms. Remains 358 /359 variables (removed 1) and now considering 311/311 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 311 rows 358 cols
[2023-03-08 13:17:43] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 13:17:43] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 13:17:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-08 13:17:43] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 13:17:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 13:17:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 159 ms returned sat
[2023-03-08 13:17:44] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 13:17:44] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-08 13:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-08 13:17:44] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-08 13:17:44] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-60b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 297 stabilizing places and 289 stable transitions
Graph (complete) has 1140 edges and 479 vertex of which 473 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.19 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 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Graph (complete) has 1140 edges and 479 vertex of which 473 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 472 transition count 407
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 460 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 459 transition count 406
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 27 place count 459 transition count 394
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 51 place count 447 transition count 394
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 444 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 444 transition count 391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 444 transition count 388
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 443 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 62 place count 443 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 64 place count 442 transition count 386
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 441 transition count 385
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 441 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 441 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 67 place count 441 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 69 place count 440 transition count 383
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 221 place count 364 transition count 307
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 227 place count 361 transition count 315
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 359 transition count 313
Applied a total of 229 rules in 109 ms. Remains 359 /479 variables (removed 120) and now considering 313/423 (removed 110) transitions.
// Phase 1: matrix 313 rows 359 cols
[2023-03-08 13:17:45] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 13:17:45] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 13:17:45] [INFO ] Invariant cache hit.
[2023-03-08 13:17:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:17:45] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-08 13:17:45] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 13:17:45] [INFO ] Invariant cache hit.
[2023-03-08 13:17:46] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/479 places, 313/423 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1031 ms. Remains : 359/479 places, 313/423 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-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:(OR (EQ s316 0) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5451 reset in 381 ms.
Product exploration explored 100000 steps with 5574 reset in 297 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 320 steps, including 17 resets, run visited all 1 properties in 3 ms. (steps per millisecond=106 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 313/313 transitions.
Applied a total of 0 rules in 15 ms. Remains 359 /359 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2023-03-08 13:17:47] [INFO ] Invariant cache hit.
[2023-03-08 13:17:47] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-08 13:17:47] [INFO ] Invariant cache hit.
[2023-03-08 13:17:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:17:48] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-08 13:17:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:17:48] [INFO ] Invariant cache hit.
[2023-03-08 13:17:48] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 930 ms. Remains : 359/359 places, 313/313 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 271 steps, including 16 resets, run visited all 1 properties in 2 ms. (steps per millisecond=135 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5526 reset in 235 ms.
Product exploration explored 100000 steps with 5514 reset in 288 ms.
Built C files in :
/tmp/ltsmin308106901817260370
[2023-03-08 13:17:49] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2023-03-08 13:17:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:17:49] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2023-03-08 13:17:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:17:49] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2023-03-08 13:17:49] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:17:49] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin308106901817260370
Running compilation step : cd /tmp/ltsmin308106901817260370;'/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 867 ms.
Running link step : cd /tmp/ltsmin308106901817260370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin308106901817260370;'/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/stateBased9259538296410762857.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 313/313 transitions.
Applied a total of 0 rules in 14 ms. Remains 359 /359 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2023-03-08 13:18:04] [INFO ] Invariant cache hit.
[2023-03-08 13:18:04] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-08 13:18:04] [INFO ] Invariant cache hit.
[2023-03-08 13:18:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:18:05] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-08 13:18:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:18:05] [INFO ] Invariant cache hit.
[2023-03-08 13:18:05] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 947 ms. Remains : 359/359 places, 313/313 transitions.
Built C files in :
/tmp/ltsmin11369827992117261399
[2023-03-08 13:18:05] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2023-03-08 13:18:05] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:18:05] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2023-03-08 13:18:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:18:05] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2023-03-08 13:18:05] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:18:05] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11369827992117261399
Running compilation step : cd /tmp/ltsmin11369827992117261399;'/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 673 ms.
Running link step : cd /tmp/ltsmin11369827992117261399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11369827992117261399;'/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/stateBased1398418491617050256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 13:18:20] [INFO ] Flatten gal took : 23 ms
[2023-03-08 13:18:20] [INFO ] Flatten gal took : 23 ms
[2023-03-08 13:18:20] [INFO ] Time to serialize gal into /tmp/LTL6597180540373694994.gal : 6 ms
[2023-03-08 13:18:20] [INFO ] Time to serialize properties into /tmp/LTL1550809435757896234.prop : 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/LTL6597180540373694994.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1526145110068768264.hoa' '-atoms' '/tmp/LTL1550809435757896234.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/LTL1550809435757896234.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1526145110068768264.hoa
Detected timeout of ITS tools.
[2023-03-08 13:18:35] [INFO ] Flatten gal took : 20 ms
[2023-03-08 13:18:35] [INFO ] Flatten gal took : 22 ms
[2023-03-08 13:18:35] [INFO ] Time to serialize gal into /tmp/LTL3700914089592421814.gal : 3 ms
[2023-03-08 13:18:35] [INFO ] Time to serialize properties into /tmp/LTL11044763311518560379.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/LTL3700914089592421814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11044763311518560379.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 : !((G(F("((p457==0)||(p56==1))"))))
Formula 0 simplified : FG!"((p457==0)||(p56==1))"
Detected timeout of ITS tools.
[2023-03-08 13:18:50] [INFO ] Flatten gal took : 21 ms
[2023-03-08 13:18:50] [INFO ] Applying decomposition
[2023-03-08 13:18:51] [INFO ] Flatten gal took : 18 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/graph5879597697999247079.txt' '-o' '/tmp/graph5879597697999247079.bin' '-w' '/tmp/graph5879597697999247079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5879597697999247079.bin' '-l' '-1' '-v' '-w' '/tmp/graph5879597697999247079.weights' '-q' '0' '-e' '0.001'
[2023-03-08 13:18:51] [INFO ] Decomposing Gal with order
[2023-03-08 13:18:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 13:18:51] [INFO ] Removed a total of 48 redundant transitions.
[2023-03-08 13:18:51] [INFO ] Flatten gal took : 53 ms
[2023-03-08 13:18:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 8 ms.
[2023-03-08 13:18:51] [INFO ] Time to serialize gal into /tmp/LTL11950623846714496925.gal : 6 ms
[2023-03-08 13:18:51] [INFO ] Time to serialize properties into /tmp/LTL15920716041724316994.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/LTL11950623846714496925.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15920716041724316994.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 : !((G(F("((i8.u28.p457==0)||(u8.p56==1))"))))
Formula 0 simplified : FG!"((i8.u28.p457==0)||(u8.p56==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4941175777503686677
[2023-03-08 13:19:06] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4941175777503686677
Running compilation step : cd /tmp/ltsmin4941175777503686677;'/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 518 ms.
Running link step : cd /tmp/ltsmin4941175777503686677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4941175777503686677;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60b-LTLCardinality-03 finished in 96376 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(p0))&&F(p1)))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 476 transition count 420
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 476 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 476 transition count 418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 475 transition count 417
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 475 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 475 transition count 416
Applied a total of 11 rules in 33 ms. Remains 475 /479 variables (removed 4) and now considering 416/423 (removed 7) transitions.
// Phase 1: matrix 416 rows 475 cols
[2023-03-08 13:19:21] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-08 13:19:21] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-08 13:19:21] [INFO ] Invariant cache hit.
[2023-03-08 13:19:22] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-08 13:19:22] [INFO ] Invariant cache hit.
[2023-03-08 13:19:22] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 475/479 places, 416/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1139 ms. Remains : 475/479 places, 416/423 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : DES-PT-60b-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: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s272 0) (EQ s416 1)), p0:(OR (AND (NEQ s272 0) (NEQ s416 1)) (EQ s272 0) (EQ s169 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 276 ms.
Product exploration explored 100000 steps with 33333 reset in 277 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1131 edges and 475 vertex of which 469 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60b-LTLCardinality-06 finished in 2016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 473 transition count 413
Applied a total of 16 rules in 19 ms. Remains 473 /479 variables (removed 6) and now considering 413/423 (removed 10) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 13:19:23] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 13:19:23] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-08 13:19:23] [INFO ] Invariant cache hit.
[2023-03-08 13:19:24] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2023-03-08 13:19:24] [INFO ] Invariant cache hit.
[2023-03-08 13:19:24] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1061 ms. Remains : 473/479 places, 413/423 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(EQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-07 finished in 1292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(p0))))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Graph (complete) has 1140 edges and 479 vertex of which 473 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 472 transition count 406
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 459 transition count 406
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 459 transition count 395
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 448 transition count 395
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 446 transition count 393
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 446 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 446 transition count 392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 446 transition count 391
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 56 place count 445 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 444 transition count 390
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 444 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 444 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 59 place count 444 transition count 388
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 443 transition count 388
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 215 place count 366 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 364 transition count 316
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 364 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 362 transition count 310
Applied a total of 225 rules in 83 ms. Remains 362 /479 variables (removed 117) and now considering 310/423 (removed 113) transitions.
// Phase 1: matrix 310 rows 362 cols
[2023-03-08 13:19:24] [INFO ] Computed 59 place invariants in 10 ms
[2023-03-08 13:19:24] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 13:19:24] [INFO ] Invariant cache hit.
[2023-03-08 13:19:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:25] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-08 13:19:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:19:25] [INFO ] Invariant cache hit.
[2023-03-08 13:19:25] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/479 places, 310/423 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1030 ms. Remains : 362/479 places, 310/423 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s253 0) (EQ s247 1)), p1:(AND (EQ s247 0) (EQ s253 1))], 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 13 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-08 finished in 1203 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(G((p1||X((G(!p2) U (p1&&G(!p2))))))))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 473 transition count 413
Applied a total of 16 rules in 23 ms. Remains 473 /479 variables (removed 6) and now considering 413/423 (removed 10) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 13:19:25] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 13:19:26] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-08 13:19:26] [INFO ] Invariant cache hit.
[2023-03-08 13:19:26] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-08 13:19:26] [INFO ] Invariant cache hit.
[2023-03-08 13:19:26] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 473/479 places, 413/423 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p1) p2), true, p2]
Running random walk in product with property : DES-PT-60b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s196 0) (EQ s406 1)), p1:(EQ s232 1), p2:(OR (EQ s439 0) (EQ s254 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-10 finished in 1378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 473 transition count 413
Applied a total of 16 rules in 24 ms. Remains 473 /479 variables (removed 6) and now considering 413/423 (removed 10) transitions.
[2023-03-08 13:19:27] [INFO ] Invariant cache hit.
[2023-03-08 13:19:27] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-08 13:19:27] [INFO ] Invariant cache hit.
[2023-03-08 13:19:28] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2023-03-08 13:19:28] [INFO ] Invariant cache hit.
[2023-03-08 13:19:28] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 473/479 places, 413/423 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s453 0) (EQ s329 1)), p1:(OR (EQ s444 0) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 706 steps with 6 reset in 9 ms.
FORMULA DES-PT-60b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-11 finished in 1313 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 (G(p2)||G(p0)||p1)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Graph (complete) has 1140 edges and 479 vertex of which 473 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 472 transition count 407
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 460 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 459 transition count 406
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 27 place count 459 transition count 396
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 47 place count 449 transition count 396
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 446 transition count 393
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 446 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 446 transition count 390
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 59 place count 445 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 60 place count 444 transition count 388
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 61 place count 443 transition count 387
Iterating global reduction 6 with 1 rules applied. Total rules applied 62 place count 443 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 63 place count 443 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 63 place count 443 transition count 385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 65 place count 442 transition count 385
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 7 with 152 rules applied. Total rules applied 217 place count 366 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 223 place count 363 transition count 317
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 225 place count 361 transition count 315
Applied a total of 225 rules in 70 ms. Remains 361 /479 variables (removed 118) and now considering 315/423 (removed 108) transitions.
// Phase 1: matrix 315 rows 361 cols
[2023-03-08 13:19:28] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-08 13:19:28] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 13:19:28] [INFO ] Invariant cache hit.
[2023-03-08 13:19:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:29] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-08 13:19:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:19:29] [INFO ] Invariant cache hit.
[2023-03-08 13:19:29] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 361/479 places, 315/423 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 945 ms. Remains : 361/479 places, 315/423 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-60b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s257 0) (EQ s270 1)), p2:(OR (EQ s257 0) (EQ s270 1)), p0:(EQ s142 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5996 reset in 272 ms.
Product exploration explored 100000 steps with 5964 reset in 273 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Detected a total of 256/361 stabilizing places and 257/315 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 396 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 548 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 13:19:31] [INFO ] Invariant cache hit.
[2023-03-08 13:19:31] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-08 13:19:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 13:19:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2023-03-08 13:19:31] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-08 13:19:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:31] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-08 13:19:31] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 13:19:31] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 315/315 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 313
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 313
Applied a total of 4 rules in 22 ms. Remains 360 /361 variables (removed 1) and now considering 313/315 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 360/361 places, 313/315 transitions.
Incomplete random walk after 10000 steps, including 544 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1362523 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :{}
Probabilistic random walk after 1362523 steps, saw 189959 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 360 cols
[2023-03-08 13:19:34] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 13:19:34] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:19:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 13:19:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 26 ms returned sat
[2023-03-08 13:19:34] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:19:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:34] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 13:19:34] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 13:19:34] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 360/360 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2023-03-08 13:19:34] [INFO ] Invariant cache hit.
[2023-03-08 13:19:35] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 13:19:35] [INFO ] Invariant cache hit.
[2023-03-08 13:19:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:35] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-03-08 13:19:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:19:35] [INFO ] Invariant cache hit.
[2023-03-08 13:19:35] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 360/360 places, 313/313 transitions.
Graph (complete) has 1256 edges and 360 vertex of which 359 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 359 transition count 313
Applied a total of 2 rules in 13 ms. Remains 359 /360 variables (removed 1) and now considering 313/313 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 359 cols
[2023-03-08 13:19:35] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 13:19:35] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:19:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 13:19:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 13:19:36] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:19:36] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 13:19:36] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) p2))), (G (NOT (AND (NOT p1) p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 536 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 315/315 transitions.
Applied a total of 0 rules in 7 ms. Remains 361 /361 variables (removed 0) and now considering 315/315 (removed 0) transitions.
// Phase 1: matrix 315 rows 361 cols
[2023-03-08 13:19:37] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 13:19:37] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-08 13:19:37] [INFO ] Invariant cache hit.
[2023-03-08 13:19:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:37] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-08 13:19:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 13:19:37] [INFO ] Invariant cache hit.
[2023-03-08 13:19:37] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 920 ms. Remains : 361/361 places, 315/315 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Detected a total of 256/361 stabilizing places and 257/315 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 350 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 543 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 13:19:38] [INFO ] Invariant cache hit.
[2023-03-08 13:19:38] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 13:19:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 13:19:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-08 13:19:38] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 13:19:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:38] [INFO ] After 127ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 13:19:38] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 13:19:39] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 315/315 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 313
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 313
Applied a total of 4 rules in 22 ms. Remains 360 /361 variables (removed 1) and now considering 313/315 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 360/361 places, 313/315 transitions.
Incomplete random walk after 10000 steps, including 506 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1279812 steps, run timeout after 3001 ms. (steps per millisecond=426 ) properties seen :{}
Probabilistic random walk after 1279812 steps, saw 178374 distinct states, run finished after 3001 ms. (steps per millisecond=426 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 360 cols
[2023-03-08 13:19:42] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-08 13:19:42] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:19:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 13:19:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2023-03-08 13:19:42] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:19:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:42] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 13:19:42] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 13:19:42] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 360/360 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2023-03-08 13:19:42] [INFO ] Invariant cache hit.
[2023-03-08 13:19:42] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-08 13:19:42] [INFO ] Invariant cache hit.
[2023-03-08 13:19:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 13:19:43] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-08 13:19:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:19:43] [INFO ] Invariant cache hit.
[2023-03-08 13:19:43] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 944 ms. Remains : 360/360 places, 313/313 transitions.
Graph (complete) has 1256 edges and 360 vertex of which 359 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 359 transition count 313
Applied a total of 2 rules in 16 ms. Remains 359 /360 variables (removed 1) and now considering 313/313 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 359 cols
[2023-03-08 13:19:43] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 13:19:43] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:19:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 13:19:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 13:19:43] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:19:43] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 13:19:43] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 11 factoid took 402 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 5966 reset in 217 ms.
Product exploration explored 100000 steps with 5942 reset in 239 ms.
Built C files in :
/tmp/ltsmin18208345131139256478
[2023-03-08 13:19:44] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2023-03-08 13:19:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:19:44] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2023-03-08 13:19:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:19:45] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2023-03-08 13:19:45] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:19:45] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18208345131139256478
Running compilation step : cd /tmp/ltsmin18208345131139256478;'/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 730 ms.
Running link step : cd /tmp/ltsmin18208345131139256478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18208345131139256478;'/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/stateBased17734945849705228759.hoa' '--buchi-type=spotba'
LTSmin run took 3387 ms.
FORMULA DES-PT-60b-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLCardinality-13 finished in 20608 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 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 473 transition count 413
Applied a total of 16 rules in 20 ms. Remains 473 /479 variables (removed 6) and now considering 413/423 (removed 10) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 13:19:49] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 13:19:49] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-08 13:19:49] [INFO ] Invariant cache hit.
[2023-03-08 13:19:50] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2023-03-08 13:19:50] [INFO ] Invariant cache hit.
[2023-03-08 13:19:50] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1016 ms. Remains : 473/479 places, 413/423 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s334 0) (EQ s8 1) (AND (NEQ s47 0) (NEQ s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 367 ms.
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Detected a total of 296/473 stabilizing places and 288/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60b-LTLCardinality-15 finished in 1940 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)))'
[2023-03-08 13:19:51] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9512217084326228385
[2023-03-08 13:19:51] [INFO ] Computing symmetric may disable matrix : 423 transitions.
[2023-03-08 13:19:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:19:51] [INFO ] Computing symmetric may enable matrix : 423 transitions.
[2023-03-08 13:19:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:19:51] [INFO ] Applying decomposition
[2023-03-08 13:19:51] [INFO ] Flatten gal took : 22 ms
[2023-03-08 13:19:51] [INFO ] Computing Do-Not-Accords matrix : 423 transitions.
[2023-03-08 13:19:51] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph10806979631109304686.txt' '-o' '/tmp/graph10806979631109304686.bin' '-w' '/tmp/graph10806979631109304686.weights'
[2023-03-08 13:19:51] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9512217084326228385
Running compilation step : cd /tmp/ltsmin9512217084326228385;'/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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10806979631109304686.bin' '-l' '-1' '-v' '-w' '/tmp/graph10806979631109304686.weights' '-q' '0' '-e' '0.001'
[2023-03-08 13:19:51] [INFO ] Decomposing Gal with order
[2023-03-08 13:19:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 13:19:51] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-08 13:19:51] [INFO ] Flatten gal took : 27 ms
[2023-03-08 13:19:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2023-03-08 13:19:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality3467023958657713790.gal : 5 ms
[2023-03-08 13:19:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality10177297919689319080.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/LTLCardinality3467023958657713790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10177297919689319080.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((i8.u63.p457==0)||(i5.u36.p56==1))"))))
Formula 0 simplified : FG!"((i8.u63.p457==0)||(i5.u36.p56==1))"
Compilation finished in 974 ms.
Running link step : cd /tmp/ltsmin9512217084326228385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9512217084326228385;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t119, t314, t383, t384, t416, u33.t79, u8.t259, u8.t260, u8.t261, u8.t262, u8.t263, ...1226
Computing Next relation with stutter on 7.92554e+08 deadlock states
Detected timeout of ITS tools.
[2023-03-08 13:40:37] [INFO ] Applying decomposition
[2023-03-08 13:40:37] [INFO ] Flatten gal took : 34 ms
[2023-03-08 13:40:37] [INFO ] Decomposing Gal with order
[2023-03-08 13:40:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 13:40:37] [INFO ] Removed a total of 246 redundant transitions.
[2023-03-08 13:40:37] [INFO ] Flatten gal took : 122 ms
[2023-03-08 13:40:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 818 labels/synchronizations in 62 ms.
[2023-03-08 13:40:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality8042760205658847099.gal : 11 ms
[2023-03-08 13:40:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality6782062672607273696.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/LTLCardinality8042760205658847099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6782062672607273696.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.i0.i0.i0.i0.i0.u88.p457==0)||(i0.i0.i0.u4.p56==1))"))))
Formula 0 simplified : FG!"((i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.i0.i0.i0.i0.i0.u88.p457==0)||(i0.i0.i0.u4.p56==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: Initializing POR dependencies: labels 424, guards 423
pins2lts-mc-linux64( 2/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 2.422: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 2.422: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 2.422: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 2.628: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 2.648: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.679: There are 426 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.679: State length is 480, there are 426 groups
pins2lts-mc-linux64( 0/ 8), 2.679: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.679: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.679: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.679: Visible groups: 0 / 426, labels: 1 / 426
pins2lts-mc-linux64( 0/ 8), 2.679: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.679: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 2.715: [Blue] ~97 levels ~960 states ~1192 transitions
pins2lts-mc-linux64( 2/ 8), 2.725: [Blue] ~99 levels ~1920 states ~2480 transitions
pins2lts-mc-linux64( 4/ 8), 2.764: [Blue] ~116 levels ~3840 states ~4776 transitions
pins2lts-mc-linux64( 2/ 8), 2.825: [Blue] ~121 levels ~7680 states ~9760 transitions
pins2lts-mc-linux64( 2/ 8), 2.967: [Blue] ~133 levels ~15360 states ~20008 transitions
pins2lts-mc-linux64( 6/ 8), 3.278: [Blue] ~163 levels ~30720 states ~39416 transitions
pins2lts-mc-linux64( 6/ 8), 3.772: [Blue] ~163 levels ~61440 states ~80744 transitions
pins2lts-mc-linux64( 6/ 8), 4.856: [Blue] ~163 levels ~122880 states ~163760 transitions
pins2lts-mc-linux64( 2/ 8), 6.917: [Blue] ~161 levels ~245760 states ~327848 transitions
pins2lts-mc-linux64( 0/ 8), 10.729: [Blue] ~334 levels ~491520 states ~663912 transitions
pins2lts-mc-linux64( 2/ 8), 17.876: [Blue] ~276 levels ~983040 states ~1313304 transitions
pins2lts-mc-linux64( 3/ 8), 31.386: [Blue] ~1071 levels ~1966080 states ~2822816 transitions
pins2lts-mc-linux64( 0/ 8), 57.683: [Blue] ~1177 levels ~3932160 states ~5277264 transitions
pins2lts-mc-linux64( 0/ 8), 108.189: [Blue] ~2336 levels ~7864320 states ~10523600 transitions
pins2lts-mc-linux64( 6/ 8), 213.413: [Blue] ~452 levels ~15728640 states ~24421408 transitions
pins2lts-mc-linux64( 3/ 8), 412.835: [Blue] ~18091 levels ~31457280 states ~44385264 transitions
pins2lts-mc-linux64( 3/ 8), 796.059: [Blue] ~36043 levels ~62914560 states ~88733864 transitions
pins2lts-mc-linux64( 6/ 8), 1640.290: [Blue] ~1182 levels ~125829120 states ~191858616 transitions
pins2lts-mc-linux64( 6/ 8), 2288.296: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2288.338:
pins2lts-mc-linux64( 0/ 8), 2288.338: Explored 133981299 states 180333891 transitions, fanout: 1.346
pins2lts-mc-linux64( 0/ 8), 2288.338: Total exploration time 2285.640 sec (2285.600 sec minimum, 2285.619 sec on average)
pins2lts-mc-linux64( 0/ 8), 2288.338: States per second: 58619, Transitions per second: 78899
pins2lts-mc-linux64( 0/ 8), 2288.338:
pins2lts-mc-linux64( 0/ 8), 2288.338: State space has 134217379 states, 84851806 are accepting
pins2lts-mc-linux64( 0/ 8), 2288.338: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2288.338: blue states: 133981299 (99.82%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2288.338: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2288.338: all-red states: 84851806 (63.22%), bogus 34926 (0.03%)
pins2lts-mc-linux64( 0/ 8), 2288.338:
pins2lts-mc-linux64( 0/ 8), 2288.338: Total memory used for local state coloring: 47.9MB
pins2lts-mc-linux64( 0/ 8), 2288.338:
pins2lts-mc-linux64( 0/ 8), 2288.338: Queue width: 8B, total height: 3139172, memory: 23.95MB
pins2lts-mc-linux64( 0/ 8), 2288.338: Tree memory: 1083.3MB, 8.5 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 2288.338: Tree fill ratio (roots/leafs): 99.0%/23.0%
pins2lts-mc-linux64( 0/ 8), 2288.338: Stored 468 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2288.338: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2288.338: Est. total memory use: 1107.3MB (~1047.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9512217084326228385;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9512217084326228385;'/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' '--ltl' '[](<>((LTLAPp0==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-08 14:01:24] [INFO ] Flatten gal took : 13 ms
[2023-03-08 14:01:24] [INFO ] Input system was already deterministic with 423 transitions.
[2023-03-08 14:01:24] [INFO ] Transformed 479 places.
[2023-03-08 14:01:24] [INFO ] Transformed 423 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-08 14:01:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality4918546871565506269.gal : 6 ms
[2023-03-08 14:01:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality2422711537512261866.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/LTLCardinality4918546871565506269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2422711537512261866.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p457==0)||(p56==1))"))))
Formula 0 simplified : FG!"((p457==0)||(p56==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9941384 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037996 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60b"
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 DES-PT-60b, 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 r101-tall-167814475400499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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