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.r133-smll-167819410000035.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 Dekker-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410000035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 01:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 01:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 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 5.9M 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 Dekker-PT-100-LTLCardinality-00
FORMULA_NAME Dekker-PT-100-LTLCardinality-01
FORMULA_NAME Dekker-PT-100-LTLCardinality-02
FORMULA_NAME Dekker-PT-100-LTLCardinality-03
FORMULA_NAME Dekker-PT-100-LTLCardinality-04
FORMULA_NAME Dekker-PT-100-LTLCardinality-05
FORMULA_NAME Dekker-PT-100-LTLCardinality-06
FORMULA_NAME Dekker-PT-100-LTLCardinality-07
FORMULA_NAME Dekker-PT-100-LTLCardinality-08
FORMULA_NAME Dekker-PT-100-LTLCardinality-09
FORMULA_NAME Dekker-PT-100-LTLCardinality-10
FORMULA_NAME Dekker-PT-100-LTLCardinality-11
FORMULA_NAME Dekker-PT-100-LTLCardinality-12
FORMULA_NAME Dekker-PT-100-LTLCardinality-13
FORMULA_NAME Dekker-PT-100-LTLCardinality-14
FORMULA_NAME Dekker-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678259040654

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=Dekker-PT-100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 07:04:03] [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 07:04:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:04:04] [INFO ] Load time of PNML (sax parser for PT used): 827 ms
[2023-03-08 07:04:04] [INFO ] Transformed 500 places.
[2023-03-08 07:04:04] [INFO ] Transformed 10200 transitions.
[2023-03-08 07:04:04] [INFO ] Found NUPN structural information;
[2023-03-08 07:04:04] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 1028 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 639 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:04:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2023-03-08 07:04:05] [INFO ] Computed 300 place invariants in 43 ms
[2023-03-08 07:04:16] [INFO ] Implicit Places using invariants in 10793 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 422, 425, 428, 431, 434, 437, 440, 443, 449, 452, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494]
Discarding 95 places :
Implicit Place search using SMT only with invariants took 10862 ms to find 95 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 405/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 244 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11750 ms. Remains : 405/500 places, 10200/10200 transitions.
Support contains 30 out of 405 places after structural reductions.
[2023-03-08 07:04:18] [INFO ] Flatten gal took : 852 ms
[2023-03-08 07:04:18] [INFO ] Flatten gal took : 587 ms
[2023-03-08 07:04:20] [INFO ] Input system was already deterministic with 10200 transitions.
Support contains 26 out of 405 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 954 ms. (steps per millisecond=10 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 07:04:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 405 cols
[2023-03-08 07:04:21] [INFO ] Computed 205 place invariants in 4 ms
[2023-03-08 07:04:21] [INFO ] [Real]Absence check using 200 positive place invariants in 64 ms returned sat
[2023-03-08 07:04:21] [INFO ] [Real]Absence check using 200 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-08 07:04:22] [INFO ] After 526ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2023-03-08 07:04:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:04:22] [INFO ] After 223ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 07:04:22] [INFO ] After 1333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 07:04:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 65 ms returned sat
[2023-03-08 07:04:23] [INFO ] [Nat]Absence check using 200 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-08 07:04:23] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 07:04:24] [INFO ] After 408ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 07:04:24] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 6 ms to minimize.
[2023-03-08 07:04:25] [INFO ] Deduced a trap composed of 4 places in 738 ms of which 2 ms to minimize.
[2023-03-08 07:04:26] [INFO ] Deduced a trap composed of 4 places in 562 ms of which 2 ms to minimize.
[2023-03-08 07:04:26] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 2 ms to minimize.
[2023-03-08 07:04:26] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 2 ms to minimize.
[2023-03-08 07:04:27] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2023-03-08 07:04:27] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 1 ms to minimize.
[2023-03-08 07:04:28] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 1 ms to minimize.
[2023-03-08 07:04:28] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2023-03-08 07:04:28] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2023-03-08 07:04:29] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 1 ms to minimize.
[2023-03-08 07:04:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5213 ms
[2023-03-08 07:04:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5213 ms
[2023-03-08 07:04:29] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2023-03-08 07:04:30] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 1 ms to minimize.
[2023-03-08 07:04:30] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 0 ms to minimize.
[2023-03-08 07:04:31] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 1 ms to minimize.
[2023-03-08 07:04:31] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 1 ms to minimize.
[2023-03-08 07:04:31] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2023-03-08 07:04:32] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2023-03-08 07:04:32] [INFO ] Deduced a trap composed of 4 places in 484 ms of which 2 ms to minimize.
[2023-03-08 07:04:33] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2023-03-08 07:04:33] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 1 ms to minimize.
[2023-03-08 07:04:34] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 2 ms to minimize.
[2023-03-08 07:04:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4935 ms
[2023-03-08 07:04:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4938 ms
[2023-03-08 07:04:34] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2023-03-08 07:04:35] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 1 ms to minimize.
[2023-03-08 07:04:35] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 1 ms to minimize.
[2023-03-08 07:04:36] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 2 ms to minimize.
[2023-03-08 07:04:36] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2023-03-08 07:04:37] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 2 ms to minimize.
[2023-03-08 07:04:37] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2023-03-08 07:04:37] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2023-03-08 07:04:38] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-08 07:04:38] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2023-03-08 07:04:38] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-08 07:04:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4596 ms
[2023-03-08 07:04:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4598 ms
[2023-03-08 07:04:39] [INFO ] After 15562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-08 07:04:39] [INFO ] After 16636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 11 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 1142 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1145 ms. Remains : 405/405 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 97162 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97162 steps, saw 90185 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-08 07:04:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:04:44] [INFO ] Invariant cache hit.
[2023-03-08 07:04:44] [INFO ] [Real]Absence check using 200 positive place invariants in 67 ms returned sat
[2023-03-08 07:04:44] [INFO ] [Real]Absence check using 200 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-08 07:04:45] [INFO ] After 515ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2023-03-08 07:04:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:04:45] [INFO ] After 328ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 07:04:45] [INFO ] After 1278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 07:04:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 72 ms returned sat
[2023-03-08 07:04:46] [INFO ] [Nat]Absence check using 200 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-08 07:04:46] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 07:04:46] [INFO ] After 400ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 07:04:47] [INFO ] Deduced a trap composed of 4 places in 671 ms of which 5 ms to minimize.
[2023-03-08 07:04:48] [INFO ] Deduced a trap composed of 4 places in 470 ms of which 1 ms to minimize.
[2023-03-08 07:04:48] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 2 ms to minimize.
[2023-03-08 07:04:49] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 1 ms to minimize.
[2023-03-08 07:04:49] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 1 ms to minimize.
[2023-03-08 07:04:50] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 2 ms to minimize.
[2023-03-08 07:04:51] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 0 ms to minimize.
[2023-03-08 07:04:51] [INFO ] Deduced a trap composed of 4 places in 576 ms of which 1 ms to minimize.
[2023-03-08 07:04:52] [INFO ] Deduced a trap composed of 4 places in 554 ms of which 3 ms to minimize.
[2023-03-08 07:04:52] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2023-03-08 07:04:53] [INFO ] Deduced a trap composed of 4 places in 697 ms of which 1 ms to minimize.
[2023-03-08 07:04:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6700 ms
[2023-03-08 07:04:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6701 ms
[2023-03-08 07:04:54] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 1 ms to minimize.
[2023-03-08 07:04:54] [INFO ] Deduced a trap composed of 4 places in 555 ms of which 1 ms to minimize.
[2023-03-08 07:04:55] [INFO ] Deduced a trap composed of 4 places in 554 ms of which 1 ms to minimize.
[2023-03-08 07:04:56] [INFO ] Deduced a trap composed of 4 places in 590 ms of which 1 ms to minimize.
[2023-03-08 07:04:56] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 0 ms to minimize.
[2023-03-08 07:04:57] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 2 ms to minimize.
[2023-03-08 07:04:57] [INFO ] Deduced a trap composed of 4 places in 501 ms of which 1 ms to minimize.
[2023-03-08 07:04:58] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 1 ms to minimize.
[2023-03-08 07:04:58] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 2 ms to minimize.
[2023-03-08 07:04:59] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 1 ms to minimize.
[2023-03-08 07:04:59] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 5 ms to minimize.
[2023-03-08 07:04:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6119 ms
[2023-03-08 07:04:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6119 ms
[2023-03-08 07:05:00] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2023-03-08 07:05:00] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2023-03-08 07:05:01] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2023-03-08 07:05:01] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 1 ms to minimize.
[2023-03-08 07:05:02] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2023-03-08 07:05:02] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 1 ms to minimize.
[2023-03-08 07:05:03] [INFO ] Deduced a trap composed of 4 places in 501 ms of which 0 ms to minimize.
[2023-03-08 07:05:03] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 2 ms to minimize.
[2023-03-08 07:05:03] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 3 ms to minimize.
[2023-03-08 07:05:04] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2023-03-08 07:05:04] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 3 ms to minimize.
[2023-03-08 07:05:04] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4919 ms
[2023-03-08 07:05:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4919 ms
[2023-03-08 07:05:05] [INFO ] After 18503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-08 07:05:05] [INFO ] After 19464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 11 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 1075 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1075 ms. Remains : 405/405 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 476 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:05:06] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:05:06] [INFO ] Invariant cache hit.
[2023-03-08 07:05:09] [INFO ] Implicit Places using invariants in 2879 ms returned [264, 366, 402]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2900 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 402/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 731 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4114 ms. Remains : 402/405 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 124331 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124331 steps, saw 115182 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-08 07:05:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 402 cols
[2023-03-08 07:05:14] [INFO ] Computed 202 place invariants in 6 ms
[2023-03-08 07:05:14] [INFO ] [Real]Absence check using 200 positive place invariants in 63 ms returned sat
[2023-03-08 07:05:14] [INFO ] [Real]Absence check using 200 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 07:05:15] [INFO ] After 471ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:2
[2023-03-08 07:05:15] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:05:15] [INFO ] After 350ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 07:05:15] [INFO ] After 1237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 07:05:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 47 ms returned sat
[2023-03-08 07:05:15] [INFO ] [Nat]Absence check using 200 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 07:05:16] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 07:05:16] [INFO ] After 457ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 07:05:16] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-08 07:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-08 07:05:17] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 2 ms to minimize.
[2023-03-08 07:05:17] [INFO ] Deduced a trap composed of 4 places in 584 ms of which 1 ms to minimize.
[2023-03-08 07:05:18] [INFO ] Deduced a trap composed of 4 places in 564 ms of which 1 ms to minimize.
[2023-03-08 07:05:18] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 1 ms to minimize.
[2023-03-08 07:05:19] [INFO ] Deduced a trap composed of 4 places in 558 ms of which 1 ms to minimize.
[2023-03-08 07:05:20] [INFO ] Deduced a trap composed of 4 places in 540 ms of which 1 ms to minimize.
[2023-03-08 07:05:20] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 1 ms to minimize.
[2023-03-08 07:05:21] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 0 ms to minimize.
[2023-03-08 07:05:21] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 1 ms to minimize.
[2023-03-08 07:05:21] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 1 ms to minimize.
[2023-03-08 07:05:22] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2023-03-08 07:05:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5617 ms
[2023-03-08 07:05:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5617 ms
[2023-03-08 07:05:22] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 1 ms to minimize.
[2023-03-08 07:05:23] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2023-03-08 07:05:23] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2023-03-08 07:05:23] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 1 ms to minimize.
[2023-03-08 07:05:24] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 1 ms to minimize.
[2023-03-08 07:05:24] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 1 ms to minimize.
[2023-03-08 07:05:25] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 1 ms to minimize.
[2023-03-08 07:05:25] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 0 ms to minimize.
[2023-03-08 07:05:25] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 1 ms to minimize.
[2023-03-08 07:05:26] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2023-03-08 07:05:26] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2023-03-08 07:05:26] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4296 ms
[2023-03-08 07:05:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4297 ms
[2023-03-08 07:05:26] [INFO ] After 10800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-08 07:05:27] [INFO ] After 11557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 11 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 10200/10200 transitions.
Applied a total of 0 rules in 646 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 647 ms. Remains : 402/402 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 10200/10200 transitions.
Applied a total of 0 rules in 425 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:05:28] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:05:28] [INFO ] Invariant cache hit.
[2023-03-08 07:05:30] [INFO ] Implicit Places using invariants in 2488 ms returned []
Implicit Place search using SMT only with invariants took 2499 ms to find 0 implicit places.
[2023-03-08 07:05:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:05:30] [INFO ] Invariant cache hit.
[2023-03-08 07:05:37] [INFO ] Dead Transitions using invariants and state equation in 6650 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9581 ms. Remains : 402/402 places, 10200/10200 transitions.
Graph (complete) has 610 edges and 402 vertex of which 46 are kept as prefixes of interest. Removing 356 places using SCC suffix rule.2 ms
Discarding 356 places :
Also discarding 9078 output transitions
Drop transitions removed 9078 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1080 rules applied. Total rules applied 1081 place count 44 transition count 44
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 1105 place count 28 transition count 36
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1113 place count 28 transition count 28
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1115 place count 28 transition count 26
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1121 place count 24 transition count 24
Applied a total of 1121 rules in 67 ms. Remains 24 /402 variables (removed 378) and now considering 24/10200 (removed 10176) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 24 rows 24 cols
[2023-03-08 07:05:37] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-08 07:05:37] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-08 07:05:37] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-08 07:05:37] [INFO ] After 50ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 07:05:37] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:6
[2023-03-08 07:05:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-08 07:05:37] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 07:05:37] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 07:05:37] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(!p1&&(p2||X(G(!p3)))))))))'
Support contains 7 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 203 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:05:38] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 405 cols
[2023-03-08 07:05:38] [INFO ] Computed 205 place invariants in 2 ms
[2023-03-08 07:05:40] [INFO ] Implicit Places using invariants in 2502 ms returned [264, 373, 402]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2519 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 206 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2929 ms. Remains : 402/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 472 ms :[true, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1)), (OR p3 (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p1) p3), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s365 0) (EQ s27 1)), p1:(OR (EQ s76 0) (EQ s115 1)), p2:(NEQ s63 1), p3:(OR (EQ s375 0) (EQ s346 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 5 ms.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-00 finished in 3526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 1278 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:05:42] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:05:42] [INFO ] Invariant cache hit.
[2023-03-08 07:05:46] [INFO ] Implicit Places using invariants in 3046 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3056 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 922 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5257 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s330 0) (EQ s283 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2944 ms.
Stack based approach found an accepted trace after 253 steps with 0 reset with depth 254 and stack size 252 in 9 ms.
FORMULA Dekker-PT-100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-03 finished in 8292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p1) U X(p2))))))'
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 713 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:05:50] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:05:50] [INFO ] Invariant cache hit.
[2023-03-08 07:05:53] [INFO ] Implicit Places using invariants in 3039 ms returned [264, 347, 366, 402]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3048 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 837 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4600 ms. Remains : 401/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s317 0) (EQ s370 1)), p1:(OR (EQ s289 0) (EQ s298 1)), p2:(OR (EQ s375 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 25619 reset in 2771 ms.
Stack based approach found an accepted trace after 408 steps with 111 reset with depth 19 and stack size 19 in 12 ms.
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-04 finished in 7803 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))'
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 575 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:05:58] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:05:58] [INFO ] Invariant cache hit.
[2023-03-08 07:06:00] [INFO ] Implicit Places using invariants in 2160 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2168 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 572 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3316 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2566 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-06 finished in 5957 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))'
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 561 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:06:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:06:04] [INFO ] Invariant cache hit.
[2023-03-08 07:06:06] [INFO ] Implicit Places using invariants in 2221 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2230 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 566 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3359 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s247 0) (EQ s361 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 3040 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-08 finished in 6488 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(G(p0))))))'
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 120 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:06:10] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:06:10] [INFO ] Invariant cache hit.
[2023-03-08 07:06:13] [INFO ] Implicit Places using invariants in 2890 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2906 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 206 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3233 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (NEQ s338 0) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-09 finished in 3584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 201 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:06:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:06:14] [INFO ] Invariant cache hit.
[2023-03-08 07:06:17] [INFO ] Implicit Places using invariants in 3273 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3295 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 206 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3702 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s83 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, null][false, false, false]]
Product exploration explored 100000 steps with 1000 reset in 2744 ms.
Stack based approach found an accepted trace after 171 steps with 1 reset with depth 110 and stack size 110 in 5 ms.
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-10 finished in 6781 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)))'
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 120 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:06:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:06:20] [INFO ] Invariant cache hit.
[2023-03-08 07:06:23] [INFO ] Implicit Places using invariants in 2618 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2633 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 206 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2959 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s341 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-14 finished in 3114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Support contains 5 out of 405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 200 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:06:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:06:23] [INFO ] Invariant cache hit.
[2023-03-08 07:06:27] [INFO ] Implicit Places using invariants in 3279 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3295 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 208 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3705 ms. Remains : 400/405 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s199 0) (EQ s80 1)), p2:(OR (EQ s373 0) (EQ s399 1)), p0:(EQ s114 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3193 ms.
Product exploration explored 100000 steps with 0 reset in 3046 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1))))]
Knowledge based reduction with 9 factoid took 1107 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:06:36] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 07:06:36] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-08 07:06:36] [INFO ] [Real]Absence check using 200 positive place invariants in 72 ms returned sat
[2023-03-08 07:06:37] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:06:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 56 ms returned sat
[2023-03-08 07:06:37] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:06:37] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:06:38] [INFO ] After 211ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 07:06:38] [INFO ] Deduced a trap composed of 4 places in 537 ms of which 1 ms to minimize.
[2023-03-08 07:06:39] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 0 ms to minimize.
[2023-03-08 07:06:39] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2023-03-08 07:06:40] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 0 ms to minimize.
[2023-03-08 07:06:40] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2023-03-08 07:06:40] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 1 ms to minimize.
[2023-03-08 07:06:41] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 0 ms to minimize.
[2023-03-08 07:06:41] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2023-03-08 07:06:42] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2023-03-08 07:06:42] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 0 ms to minimize.
[2023-03-08 07:06:43] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 1 ms to minimize.
[2023-03-08 07:06:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4962 ms
[2023-03-08 07:06:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4962 ms
[2023-03-08 07:06:43] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
[2023-03-08 07:06:43] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 0 ms to minimize.
[2023-03-08 07:06:44] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2023-03-08 07:06:44] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2023-03-08 07:06:44] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2023-03-08 07:06:45] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 0 ms to minimize.
[2023-03-08 07:06:45] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2023-03-08 07:06:45] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2023-03-08 07:06:46] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-08 07:06:46] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2023-03-08 07:06:46] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2023-03-08 07:06:46] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3449 ms
[2023-03-08 07:06:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3450 ms
[2023-03-08 07:06:46] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2023-03-08 07:06:47] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2023-03-08 07:06:47] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2023-03-08 07:06:47] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2023-03-08 07:06:47] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2023-03-08 07:06:48] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-08 07:06:48] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-08 07:06:48] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2023-03-08 07:06:48] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2023-03-08 07:06:48] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2023-03-08 07:06:49] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-08 07:06:49] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2418 ms
[2023-03-08 07:06:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2419 ms
[2023-03-08 07:06:49] [INFO ] After 11193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-08 07:06:49] [INFO ] After 11986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 574 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 575 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 189880 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189880 steps, saw 174894 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:06:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:06:53] [INFO ] Invariant cache hit.
[2023-03-08 07:06:53] [INFO ] [Real]Absence check using 200 positive place invariants in 65 ms returned sat
[2023-03-08 07:06:54] [INFO ] After 669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:06:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 65 ms returned sat
[2023-03-08 07:06:54] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:06:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:06:55] [INFO ] After 281ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 07:06:55] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 1 ms to minimize.
[2023-03-08 07:06:56] [INFO ] Deduced a trap composed of 4 places in 680 ms of which 1 ms to minimize.
[2023-03-08 07:06:57] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
[2023-03-08 07:06:57] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 0 ms to minimize.
[2023-03-08 07:06:58] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 1 ms to minimize.
[2023-03-08 07:06:59] [INFO ] Deduced a trap composed of 4 places in 585 ms of which 1 ms to minimize.
[2023-03-08 07:06:59] [INFO ] Deduced a trap composed of 4 places in 569 ms of which 1 ms to minimize.
[2023-03-08 07:07:00] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 1 ms to minimize.
[2023-03-08 07:07:00] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 1 ms to minimize.
[2023-03-08 07:07:01] [INFO ] Deduced a trap composed of 4 places in 530 ms of which 1 ms to minimize.
[2023-03-08 07:07:02] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 1 ms to minimize.
[2023-03-08 07:07:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6892 ms
[2023-03-08 07:07:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6892 ms
[2023-03-08 07:07:02] [INFO ] Deduced a trap composed of 4 places in 500 ms of which 1 ms to minimize.
[2023-03-08 07:07:03] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2023-03-08 07:07:03] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2023-03-08 07:07:03] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 1 ms to minimize.
[2023-03-08 07:07:04] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 1 ms to minimize.
[2023-03-08 07:07:04] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 0 ms to minimize.
[2023-03-08 07:07:05] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2023-03-08 07:07:05] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 1 ms to minimize.
[2023-03-08 07:07:06] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2023-03-08 07:07:06] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 0 ms to minimize.
[2023-03-08 07:07:06] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 1 ms to minimize.
[2023-03-08 07:07:06] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4873 ms
[2023-03-08 07:07:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4873 ms
[2023-03-08 07:07:07] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2023-03-08 07:07:07] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2023-03-08 07:07:08] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2023-03-08 07:07:08] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2023-03-08 07:07:08] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2023-03-08 07:07:09] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2023-03-08 07:07:09] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2023-03-08 07:07:09] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2023-03-08 07:07:09] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2023-03-08 07:07:10] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2023-03-08 07:07:10] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2023-03-08 07:07:10] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3498 ms
[2023-03-08 07:07:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3498 ms
[2023-03-08 07:07:10] [INFO ] After 15706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-08 07:07:10] [INFO ] After 16578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 421 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 423 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:07:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:07:11] [INFO ] Invariant cache hit.
[2023-03-08 07:07:14] [INFO ] Implicit Places using invariants in 2635 ms returned []
Implicit Place search using SMT only with invariants took 2636 ms to find 0 implicit places.
[2023-03-08 07:07:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:07:14] [INFO ] Invariant cache hit.
[2023-03-08 07:07:20] [INFO ] Dead Transitions using invariants and state equation in 6317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9380 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 12 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 07:07:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:07:20] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 07:07:20] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 07:07:20] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:07:20] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:07:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 07:07:20] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:07:20] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 07:07:20] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 1538 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 203 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:07:22] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 07:07:22] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-08 07:07:25] [INFO ] Implicit Places using invariants in 2693 ms returned []
Implicit Place search using SMT only with invariants took 2695 ms to find 0 implicit places.
[2023-03-08 07:07:25] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:07:25] [INFO ] Invariant cache hit.
[2023-03-08 07:07:33] [INFO ] Dead Transitions using invariants and state equation in 7882 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10783 ms. Remains : 400/400 places, 10200/10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1067 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=16 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:07:35] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:07:35] [INFO ] Invariant cache hit.
[2023-03-08 07:07:36] [INFO ] [Real]Absence check using 200 positive place invariants in 66 ms returned sat
[2023-03-08 07:07:36] [INFO ] After 687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:07:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 43 ms returned sat
[2023-03-08 07:07:36] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:07:37] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:07:37] [INFO ] After 181ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 07:07:37] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 1 ms to minimize.
[2023-03-08 07:07:38] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2023-03-08 07:07:38] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 0 ms to minimize.
[2023-03-08 07:07:39] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 1 ms to minimize.
[2023-03-08 07:07:39] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 1 ms to minimize.
[2023-03-08 07:07:40] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 1 ms to minimize.
[2023-03-08 07:07:40] [INFO ] Deduced a trap composed of 4 places in 581 ms of which 1 ms to minimize.
[2023-03-08 07:07:41] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 1 ms to minimize.
[2023-03-08 07:07:41] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 0 ms to minimize.
[2023-03-08 07:07:42] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 1 ms to minimize.
[2023-03-08 07:07:42] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2023-03-08 07:07:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5435 ms
[2023-03-08 07:07:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5435 ms
[2023-03-08 07:07:43] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2023-03-08 07:07:43] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2023-03-08 07:07:44] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2023-03-08 07:07:44] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 1 ms to minimize.
[2023-03-08 07:07:44] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 0 ms to minimize.
[2023-03-08 07:07:45] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2023-03-08 07:07:45] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2023-03-08 07:07:46] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2023-03-08 07:07:46] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2023-03-08 07:07:46] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 1 ms to minimize.
[2023-03-08 07:07:47] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2023-03-08 07:07:47] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4572 ms
[2023-03-08 07:07:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4573 ms
[2023-03-08 07:07:47] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2023-03-08 07:07:48] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2023-03-08 07:07:48] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2023-03-08 07:07:48] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2023-03-08 07:07:49] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 1 ms to minimize.
[2023-03-08 07:07:49] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2023-03-08 07:07:49] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2023-03-08 07:07:49] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
[2023-03-08 07:07:50] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2023-03-08 07:07:50] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2023-03-08 07:07:50] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2023-03-08 07:07:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3358 ms
[2023-03-08 07:07:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3358 ms
[2023-03-08 07:07:50] [INFO ] After 13680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-08 07:07:50] [INFO ] After 14373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 437 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 859 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 114433 steps, run timeout after 3002 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114433 steps, saw 106098 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:07:55] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:07:55] [INFO ] Invariant cache hit.
[2023-03-08 07:07:55] [INFO ] [Real]Absence check using 200 positive place invariants in 64 ms returned sat
[2023-03-08 07:07:56] [INFO ] After 670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:07:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 65 ms returned sat
[2023-03-08 07:07:56] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:07:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:07:56] [INFO ] After 203ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 07:07:57] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 0 ms to minimize.
[2023-03-08 07:07:58] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 0 ms to minimize.
[2023-03-08 07:07:58] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 1 ms to minimize.
[2023-03-08 07:07:59] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 1 ms to minimize.
[2023-03-08 07:07:59] [INFO ] Deduced a trap composed of 4 places in 476 ms of which 2 ms to minimize.
[2023-03-08 07:08:00] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 2 ms to minimize.
[2023-03-08 07:08:00] [INFO ] Deduced a trap composed of 4 places in 501 ms of which 1 ms to minimize.
[2023-03-08 07:08:01] [INFO ] Deduced a trap composed of 4 places in 579 ms of which 0 ms to minimize.
[2023-03-08 07:08:01] [INFO ] Deduced a trap composed of 4 places in 564 ms of which 1 ms to minimize.
[2023-03-08 07:08:02] [INFO ] Deduced a trap composed of 4 places in 567 ms of which 1 ms to minimize.
[2023-03-08 07:08:03] [INFO ] Deduced a trap composed of 4 places in 539 ms of which 0 ms to minimize.
[2023-03-08 07:08:03] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6047 ms
[2023-03-08 07:08:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6047 ms
[2023-03-08 07:08:03] [INFO ] Deduced a trap composed of 4 places in 528 ms of which 0 ms to minimize.
[2023-03-08 07:08:04] [INFO ] Deduced a trap composed of 4 places in 532 ms of which 1 ms to minimize.
[2023-03-08 07:08:04] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 0 ms to minimize.
[2023-03-08 07:08:05] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 1 ms to minimize.
[2023-03-08 07:08:05] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 1 ms to minimize.
[2023-03-08 07:08:06] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 0 ms to minimize.
[2023-03-08 07:08:06] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 1 ms to minimize.
[2023-03-08 07:08:07] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2023-03-08 07:08:07] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2023-03-08 07:08:08] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
[2023-03-08 07:08:08] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2023-03-08 07:08:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5428 ms
[2023-03-08 07:08:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5428 ms
[2023-03-08 07:08:08] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2023-03-08 07:08:09] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2023-03-08 07:08:09] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2023-03-08 07:08:09] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2023-03-08 07:08:09] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2023-03-08 07:08:10] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2023-03-08 07:08:10] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2023-03-08 07:08:10] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-08 07:08:10] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2023-03-08 07:08:11] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2023-03-08 07:08:11] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2023-03-08 07:08:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2969 ms
[2023-03-08 07:08:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2969 ms
[2023-03-08 07:08:11] [INFO ] After 14817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-08 07:08:11] [INFO ] After 15656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 613 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 613 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 521 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:08:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:08:12] [INFO ] Invariant cache hit.
[2023-03-08 07:08:14] [INFO ] Implicit Places using invariants in 2029 ms returned []
Implicit Place search using SMT only with invariants took 2030 ms to find 0 implicit places.
[2023-03-08 07:08:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:08:14] [INFO ] Invariant cache hit.
[2023-03-08 07:08:24] [INFO ] Dead Transitions using invariants and state equation in 9200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11762 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.3 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 17 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 07:08:24] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 07:08:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 07:08:24] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 07:08:24] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:08:24] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:08:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 07:08:24] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:08:24] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 07:08:24] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 1195 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2714 ms.
Product exploration explored 100000 steps with 0 reset in 2928 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 836 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:08:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 07:08:32] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-08 07:08:38] [INFO ] Dead Transitions using invariants and state equation in 5567 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6407 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin11377360486555097711
[2023-03-08 07:08:38] [INFO ] Built C files in 299ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11377360486555097711
Running compilation step : cd /tmp/ltsmin11377360486555097711;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11377360486555097711;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11377360486555097711;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 167 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:08:42] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:08:42] [INFO ] Invariant cache hit.
[2023-03-08 07:08:44] [INFO ] Implicit Places using invariants in 2259 ms returned []
Implicit Place search using SMT only with invariants took 2259 ms to find 0 implicit places.
[2023-03-08 07:08:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:08:44] [INFO ] Invariant cache hit.
[2023-03-08 07:08:51] [INFO ] Dead Transitions using invariants and state equation in 7178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9611 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin9377059040523419587
[2023-03-08 07:08:51] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9377059040523419587
Running compilation step : cd /tmp/ltsmin9377059040523419587;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9377059040523419587;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9377059040523419587;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 07:08:55] [INFO ] Flatten gal took : 481 ms
[2023-03-08 07:08:56] [INFO ] Flatten gal took : 425 ms
[2023-03-08 07:08:56] [INFO ] Time to serialize gal into /tmp/LTL2596136421627120020.gal : 140 ms
[2023-03-08 07:08:56] [INFO ] Time to serialize properties into /tmp/LTL14612518113938524664.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/LTL2596136421627120020.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7693863791503242869.hoa' '-atoms' '/tmp/LTL14612518113938524664.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14612518113938524664.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7693863791503242869.hoa
Detected timeout of ITS tools.
[2023-03-08 07:09:12] [INFO ] Flatten gal took : 550 ms
[2023-03-08 07:09:12] [INFO ] Flatten gal took : 382 ms
[2023-03-08 07:09:12] [INFO ] Time to serialize gal into /tmp/LTL5315925159055067592.gal : 58 ms
[2023-03-08 07:09:12] [INFO ] Time to serialize properties into /tmp/LTL11783320737006215083.ltl : 5 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/LTL5315925159055067592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11783320737006215083.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 : !((("(flag_0_57==1)")U(X(("((flag_1_99==0)||(flag_0_40==1))")U((G("((p3_86==0)||(p3_99==1))"))||(F(G("((flag_1_99==0)||(flag_0_40==1))...164
Formula 0 simplified : !"(flag_0_57==1)" R X(!"((flag_1_99==0)||(flag_0_40==1))" R (F!"((p3_86==0)||(p3_99==1))" & GF!"((flag_1_99==0)||(flag_0_40==1))"))
Detected timeout of ITS tools.
[2023-03-08 07:09:27] [INFO ] Flatten gal took : 383 ms
[2023-03-08 07:09:27] [INFO ] Applying decomposition
[2023-03-08 07:09:28] [INFO ] Flatten gal took : 359 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/graph533912457356366718.txt' '-o' '/tmp/graph533912457356366718.bin' '-w' '/tmp/graph533912457356366718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph533912457356366718.bin' '-l' '-1' '-v' '-w' '/tmp/graph533912457356366718.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:09:29] [INFO ] Decomposing Gal with order
[2023-03-08 07:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:09:30] [INFO ] Removed a total of 29400 redundant transitions.
[2023-03-08 07:09:30] [INFO ] Flatten gal took : 885 ms
[2023-03-08 07:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 307 ms.
[2023-03-08 07:09:31] [INFO ] Time to serialize gal into /tmp/LTL16885780792375928480.gal : 57 ms
[2023-03-08 07:09:31] [INFO ] Time to serialize properties into /tmp/LTL12014598124982310264.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/LTL16885780792375928480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12014598124982310264.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 : !((("(u57.flag_0_57==1)")U(X(("((u99.flag_1_99==0)||(u40.flag_0_40==1))")U((G("((u86.p3_86==0)||(u99.p3_99==1))"))||(F(G("((u99.flag_1...192
Formula 0 simplified : !"(u57.flag_0_57==1)" R X(!"((u99.flag_1_99==0)||(u40.flag_0_40==1))" R (F!"((u86.p3_86==0)||(u99.p3_99==1))" & GF!"((u99.flag_1_99=...182
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9241934977979667043
[2023-03-08 07:09:46] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9241934977979667043
Running compilation step : cd /tmp/ltsmin9241934977979667043;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9241934977979667043;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9241934977979667043;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 205690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Found a Lengthening insensitive property : Dekker-PT-100-LTLCardinality-15
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 405 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 405/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 369 ms. Remains 405 /405 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:09:50] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 405 cols
[2023-03-08 07:09:50] [INFO ] Computed 205 place invariants in 5 ms
[2023-03-08 07:09:53] [INFO ] Implicit Places using invariants in 2892 ms returned [264, 347, 366, 373, 402]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2910 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/405 places, 10200/10200 transitions.
Applied a total of 0 rules in 510 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3789 ms. Remains : 400/405 places, 10200/10200 transitions.
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s199 0) (EQ s80 1)), p2:(OR (EQ s373 0) (EQ s399 1)), p0:(EQ s114 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2757 ms.
Product exploration explored 100000 steps with 0 reset in 2651 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1))))]
Knowledge based reduction with 9 factoid took 850 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:10:01] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 07:10:01] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-08 07:10:01] [INFO ] [Real]Absence check using 200 positive place invariants in 58 ms returned sat
[2023-03-08 07:10:01] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:10:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 74 ms returned sat
[2023-03-08 07:10:02] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:10:02] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:10:02] [INFO ] After 252ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 07:10:03] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 1 ms to minimize.
[2023-03-08 07:10:04] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 1 ms to minimize.
[2023-03-08 07:10:04] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 0 ms to minimize.
[2023-03-08 07:10:05] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 1 ms to minimize.
[2023-03-08 07:10:05] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 1 ms to minimize.
[2023-03-08 07:10:05] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 0 ms to minimize.
[2023-03-08 07:10:06] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 0 ms to minimize.
[2023-03-08 07:10:06] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 2 ms to minimize.
[2023-03-08 07:10:07] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 4 ms to minimize.
[2023-03-08 07:10:07] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2023-03-08 07:10:08] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 0 ms to minimize.
[2023-03-08 07:10:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5049 ms
[2023-03-08 07:10:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5049 ms
[2023-03-08 07:10:08] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2023-03-08 07:10:08] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 1 ms to minimize.
[2023-03-08 07:10:09] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 0 ms to minimize.
[2023-03-08 07:10:09] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 2 ms to minimize.
[2023-03-08 07:10:10] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 3 ms to minimize.
[2023-03-08 07:10:10] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2023-03-08 07:10:11] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 0 ms to minimize.
[2023-03-08 07:10:11] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 0 ms to minimize.
[2023-03-08 07:10:11] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2023-03-08 07:10:12] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2023-03-08 07:10:12] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2023-03-08 07:10:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4489 ms
[2023-03-08 07:10:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4489 ms
[2023-03-08 07:10:12] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 1 ms to minimize.
[2023-03-08 07:10:13] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 3 ms to minimize.
[2023-03-08 07:10:13] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 3 ms to minimize.
[2023-03-08 07:10:13] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2023-03-08 07:10:14] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2023-03-08 07:10:14] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2023-03-08 07:10:14] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2023-03-08 07:10:14] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-08 07:10:15] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-08 07:10:15] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-08 07:10:15] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2023-03-08 07:10:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2920 ms
[2023-03-08 07:10:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2920 ms
[2023-03-08 07:10:15] [INFO ] After 12875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-08 07:10:15] [INFO ] After 13882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 727 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 729 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 150793 steps, run timeout after 3002 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150793 steps, saw 139361 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:10:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:10:20] [INFO ] Invariant cache hit.
[2023-03-08 07:10:20] [INFO ] [Real]Absence check using 200 positive place invariants in 42 ms returned sat
[2023-03-08 07:10:20] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:10:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 46 ms returned sat
[2023-03-08 07:10:21] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:10:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:10:21] [INFO ] After 257ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 07:10:22] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2023-03-08 07:10:22] [INFO ] Deduced a trap composed of 4 places in 673 ms of which 1 ms to minimize.
[2023-03-08 07:10:23] [INFO ] Deduced a trap composed of 4 places in 670 ms of which 1 ms to minimize.
[2023-03-08 07:10:24] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 1 ms to minimize.
[2023-03-08 07:10:24] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 1 ms to minimize.
[2023-03-08 07:10:25] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2023-03-08 07:10:26] [INFO ] Deduced a trap composed of 4 places in 573 ms of which 1 ms to minimize.
[2023-03-08 07:10:26] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 1 ms to minimize.
[2023-03-08 07:10:27] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 1 ms to minimize.
[2023-03-08 07:10:27] [INFO ] Deduced a trap composed of 4 places in 489 ms of which 1 ms to minimize.
[2023-03-08 07:10:28] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 1 ms to minimize.
[2023-03-08 07:10:28] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6784 ms
[2023-03-08 07:10:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6785 ms
[2023-03-08 07:10:28] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 1 ms to minimize.
[2023-03-08 07:10:29] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2023-03-08 07:10:29] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 1 ms to minimize.
[2023-03-08 07:10:30] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 0 ms to minimize.
[2023-03-08 07:10:30] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2023-03-08 07:10:31] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 0 ms to minimize.
[2023-03-08 07:10:31] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 0 ms to minimize.
[2023-03-08 07:10:31] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2023-03-08 07:10:32] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2023-03-08 07:10:32] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2023-03-08 07:10:32] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2023-03-08 07:10:32] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4551 ms
[2023-03-08 07:10:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4551 ms
[2023-03-08 07:10:33] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2023-03-08 07:10:33] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 2 ms to minimize.
[2023-03-08 07:10:33] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2023-03-08 07:10:34] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
[2023-03-08 07:10:34] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2023-03-08 07:10:34] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-08 07:10:35] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2023-03-08 07:10:35] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-08 07:10:35] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 2 ms to minimize.
[2023-03-08 07:10:36] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2023-03-08 07:10:36] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2023-03-08 07:10:36] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3439 ms
[2023-03-08 07:10:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3440 ms
[2023-03-08 07:10:36] [INFO ] After 15183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-08 07:10:36] [INFO ] After 15920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 715 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 552 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:10:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:10:37] [INFO ] Invariant cache hit.
[2023-03-08 07:10:40] [INFO ] Implicit Places using invariants in 2318 ms returned []
Implicit Place search using SMT only with invariants took 2322 ms to find 0 implicit places.
[2023-03-08 07:10:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:10:40] [INFO ] Invariant cache hit.
[2023-03-08 07:10:46] [INFO ] Dead Transitions using invariants and state equation in 6138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9016 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 16 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 07:10:46] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 07:10:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 07:10:46] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 07:10:46] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:10:46] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:10:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 07:10:46] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:10:46] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 07:10:46] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 1278 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 206 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:10:48] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 07:10:48] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-08 07:10:51] [INFO ] Implicit Places using invariants in 2915 ms returned []
Implicit Place search using SMT only with invariants took 2916 ms to find 0 implicit places.
[2023-03-08 07:10:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:10:51] [INFO ] Invariant cache hit.
[2023-03-08 07:11:00] [INFO ] Dead Transitions using invariants and state equation in 9389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12512 ms. Remains : 400/400 places, 10200/10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 983 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 2 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 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:11:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:11:02] [INFO ] Invariant cache hit.
[2023-03-08 07:11:02] [INFO ] [Real]Absence check using 200 positive place invariants in 63 ms returned sat
[2023-03-08 07:11:03] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:11:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 65 ms returned sat
[2023-03-08 07:11:04] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:11:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:11:04] [INFO ] After 274ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 07:11:04] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
[2023-03-08 07:11:05] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 1 ms to minimize.
[2023-03-08 07:11:05] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 1 ms to minimize.
[2023-03-08 07:11:06] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 1 ms to minimize.
[2023-03-08 07:11:06] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 0 ms to minimize.
[2023-03-08 07:11:07] [INFO ] Deduced a trap composed of 4 places in 479 ms of which 0 ms to minimize.
[2023-03-08 07:11:07] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 0 ms to minimize.
[2023-03-08 07:11:08] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 0 ms to minimize.
[2023-03-08 07:11:09] [INFO ] Deduced a trap composed of 4 places in 559 ms of which 1 ms to minimize.
[2023-03-08 07:11:09] [INFO ] Deduced a trap composed of 4 places in 550 ms of which 0 ms to minimize.
[2023-03-08 07:11:10] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 0 ms to minimize.
[2023-03-08 07:11:10] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5822 ms
[2023-03-08 07:11:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5823 ms
[2023-03-08 07:11:10] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 1 ms to minimize.
[2023-03-08 07:11:11] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 1 ms to minimize.
[2023-03-08 07:11:11] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 1 ms to minimize.
[2023-03-08 07:11:12] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 0 ms to minimize.
[2023-03-08 07:11:12] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 1 ms to minimize.
[2023-03-08 07:11:13] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 0 ms to minimize.
[2023-03-08 07:11:13] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 0 ms to minimize.
[2023-03-08 07:11:14] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2023-03-08 07:11:14] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 1 ms to minimize.
[2023-03-08 07:11:15] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 0 ms to minimize.
[2023-03-08 07:11:15] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2023-03-08 07:11:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5141 ms
[2023-03-08 07:11:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5141 ms
[2023-03-08 07:11:15] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 0 ms to minimize.
[2023-03-08 07:11:16] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2023-03-08 07:11:16] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 0 ms to minimize.
[2023-03-08 07:11:16] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2023-03-08 07:11:17] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2023-03-08 07:11:17] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2023-03-08 07:11:17] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2023-03-08 07:11:18] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2023-03-08 07:11:18] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2023-03-08 07:11:18] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-08 07:11:19] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2023-03-08 07:11:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3662 ms
[2023-03-08 07:11:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3662 ms
[2023-03-08 07:11:19] [INFO ] After 15071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-08 07:11:19] [INFO ] After 15942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 704 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 705 ms. Remains : 400/400 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 161802 steps, run timeout after 3002 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161802 steps, saw 149416 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:11:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:11:23] [INFO ] Invariant cache hit.
[2023-03-08 07:11:24] [INFO ] [Real]Absence check using 200 positive place invariants in 78 ms returned sat
[2023-03-08 07:11:24] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:11:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 77 ms returned sat
[2023-03-08 07:11:25] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:11:25] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 07:11:25] [INFO ] After 307ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 07:11:26] [INFO ] Deduced a trap composed of 4 places in 658 ms of which 1 ms to minimize.
[2023-03-08 07:11:27] [INFO ] Deduced a trap composed of 4 places in 639 ms of which 1 ms to minimize.
[2023-03-08 07:11:27] [INFO ] Deduced a trap composed of 4 places in 610 ms of which 1 ms to minimize.
[2023-03-08 07:11:28] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 1 ms to minimize.
[2023-03-08 07:11:29] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2023-03-08 07:11:29] [INFO ] Deduced a trap composed of 4 places in 613 ms of which 4 ms to minimize.
[2023-03-08 07:11:30] [INFO ] Deduced a trap composed of 4 places in 595 ms of which 1 ms to minimize.
[2023-03-08 07:11:30] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 0 ms to minimize.
[2023-03-08 07:11:31] [INFO ] Deduced a trap composed of 4 places in 561 ms of which 1 ms to minimize.
[2023-03-08 07:11:32] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 1 ms to minimize.
[2023-03-08 07:11:32] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 0 ms to minimize.
[2023-03-08 07:11:32] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6785 ms
[2023-03-08 07:11:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6785 ms
[2023-03-08 07:11:33] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 1 ms to minimize.
[2023-03-08 07:11:33] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 1 ms to minimize.
[2023-03-08 07:11:33] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2023-03-08 07:11:34] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 0 ms to minimize.
[2023-03-08 07:11:35] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 1 ms to minimize.
[2023-03-08 07:11:35] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2023-03-08 07:11:35] [INFO ] Deduced a trap composed of 4 places in 463 ms of which 0 ms to minimize.
[2023-03-08 07:11:36] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 0 ms to minimize.
[2023-03-08 07:11:36] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2023-03-08 07:11:37] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2023-03-08 07:11:37] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2023-03-08 07:11:37] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5150 ms
[2023-03-08 07:11:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5151 ms
[2023-03-08 07:11:38] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2023-03-08 07:11:38] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2023-03-08 07:11:38] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2023-03-08 07:11:38] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2023-03-08 07:11:39] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2023-03-08 07:11:39] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2023-03-08 07:11:39] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-08 07:11:40] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2023-03-08 07:11:40] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-08 07:11:40] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2023-03-08 07:11:40] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-08 07:11:40] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3145 ms
[2023-03-08 07:11:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3146 ms
[2023-03-08 07:11:40] [INFO ] After 15565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-08 07:11:41] [INFO ] After 16595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 479 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 443 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:11:42] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:11:42] [INFO ] Invariant cache hit.
[2023-03-08 07:11:44] [INFO ] Implicit Places using invariants in 2656 ms returned []
Implicit Place search using SMT only with invariants took 2657 ms to find 0 implicit places.
[2023-03-08 07:11:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:11:44] [INFO ] Invariant cache hit.
[2023-03-08 07:11:51] [INFO ] Dead Transitions using invariants and state equation in 6618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9732 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 10 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 07:11:51] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 07:11:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 07:11:51] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 07:11:51] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:11:51] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:11:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 07:11:51] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:11:51] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 07:11:51] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 1274 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2741 ms.
Product exploration explored 100000 steps with 0 reset in 2622 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 966 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:12:00] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-08 07:12:00] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-08 07:12:06] [INFO ] Dead Transitions using invariants and state equation in 6353 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7324 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin7905598701828495278
[2023-03-08 07:12:06] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7905598701828495278
Running compilation step : cd /tmp/ltsmin7905598701828495278;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7905598701828495278;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7905598701828495278;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 122 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 07:12:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:12:09] [INFO ] Invariant cache hit.
[2023-03-08 07:12:12] [INFO ] Implicit Places using invariants in 2602 ms returned []
Implicit Place search using SMT only with invariants took 2605 ms to find 0 implicit places.
[2023-03-08 07:12:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 07:12:12] [INFO ] Invariant cache hit.
[2023-03-08 07:12:18] [INFO ] Dead Transitions using invariants and state equation in 6128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8864 ms. Remains : 400/400 places, 10200/10200 transitions.
Built C files in :
/tmp/ltsmin11226858036656020663
[2023-03-08 07:12:18] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11226858036656020663
Running compilation step : cd /tmp/ltsmin11226858036656020663;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11226858036656020663;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11226858036656020663;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 07:12:22] [INFO ] Flatten gal took : 362 ms
[2023-03-08 07:12:22] [INFO ] Flatten gal took : 374 ms
[2023-03-08 07:12:22] [INFO ] Time to serialize gal into /tmp/LTL10315347078014162251.gal : 52 ms
[2023-03-08 07:12:22] [INFO ] Time to serialize properties into /tmp/LTL12323499297062156668.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/LTL10315347078014162251.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6766620026324921119.hoa' '-atoms' '/tmp/LTL12323499297062156668.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12323499297062156668.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6766620026324921119.hoa
Detected timeout of ITS tools.
[2023-03-08 07:12:38] [INFO ] Flatten gal took : 388 ms
[2023-03-08 07:12:38] [INFO ] Flatten gal took : 436 ms
[2023-03-08 07:12:38] [INFO ] Time to serialize gal into /tmp/LTL8176597432628839983.gal : 61 ms
[2023-03-08 07:12:38] [INFO ] Time to serialize properties into /tmp/LTL10312951003156278385.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/LTL8176597432628839983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10312951003156278385.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 : !((("(flag_0_57==1)")U(X(("((flag_1_99==0)||(flag_0_40==1))")U((G("((p3_86==0)||(p3_99==1))"))||(F(G("((flag_1_99==0)||(flag_0_40==1))...164
Formula 0 simplified : !"(flag_0_57==1)" R X(!"((flag_1_99==0)||(flag_0_40==1))" R (F!"((p3_86==0)||(p3_99==1))" & GF!"((flag_1_99==0)||(flag_0_40==1))"))
Detected timeout of ITS tools.
[2023-03-08 07:12:54] [INFO ] Flatten gal took : 497 ms
[2023-03-08 07:12:54] [INFO ] Applying decomposition
[2023-03-08 07:12:54] [INFO ] Flatten gal took : 485 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/graph2632191372710298097.txt' '-o' '/tmp/graph2632191372710298097.bin' '-w' '/tmp/graph2632191372710298097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2632191372710298097.bin' '-l' '-1' '-v' '-w' '/tmp/graph2632191372710298097.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:12:55] [INFO ] Decomposing Gal with order
[2023-03-08 07:12:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:12:56] [INFO ] Removed a total of 29400 redundant transitions.
[2023-03-08 07:12:56] [INFO ] Flatten gal took : 626 ms
[2023-03-08 07:12:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 152 ms.
[2023-03-08 07:12:56] [INFO ] Time to serialize gal into /tmp/LTL14609521632841193623.gal : 49 ms
[2023-03-08 07:12:56] [INFO ] Time to serialize properties into /tmp/LTL11447766060110774993.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/LTL14609521632841193623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11447766060110774993.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 : !((("(u57.flag_0_57==1)")U(X(("((u99.flag_1_99==0)||(u40.flag_0_40==1))")U((G("((u86.p3_86==0)||(u99.p3_99==1))"))||(F(G("((u99.flag_1...192
Formula 0 simplified : !"(u57.flag_0_57==1)" R X(!"((u99.flag_1_99==0)||(u40.flag_0_40==1))" R (F!"((u86.p3_86==0)||(u99.p3_99==1))" & GF!"((u99.flag_1_99=...182
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5471254797041637616
[2023-03-08 07:13:11] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5471254797041637616
Running compilation step : cd /tmp/ltsmin5471254797041637616;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5471254797041637616;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5471254797041637616;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 205369 ms.
[2023-03-08 07:13:15] [INFO ] Flatten gal took : 360 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13570652890457591192
[2023-03-08 07:13:15] [INFO ] Too many transitions (10200) to apply POR reductions. Disabling POR matrices.
[2023-03-08 07:13:15] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13570652890457591192
Running compilation step : cd /tmp/ltsmin13570652890457591192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-08 07:13:15] [INFO ] Applying decomposition
[2023-03-08 07:13:15] [INFO ] Flatten gal took : 437 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/graph9779184429667228358.txt' '-o' '/tmp/graph9779184429667228358.bin' '-w' '/tmp/graph9779184429667228358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9779184429667228358.bin' '-l' '-1' '-v' '-w' '/tmp/graph9779184429667228358.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:13:16] [INFO ] Decomposing Gal with order
[2023-03-08 07:13:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:13:17] [INFO ] Removed a total of 29499 redundant transitions.
[2023-03-08 07:13:17] [INFO ] Flatten gal took : 538 ms
[2023-03-08 07:13:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 174 ms.
[2023-03-08 07:13:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality9145633008904356012.gal : 34 ms
[2023-03-08 07:13:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality18024671006870763513.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/LTLCardinality9145633008904356012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18024671006870763513.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 : !((("(u57.flag_0_57==1)")U(X(("((u98.flag_1_99==0)||(u40.flag_0_40==1))")U((G("((u85.p3_86==0)||(u98.p3_99==1))"))||(F(G("((u98.flag_1...192
Formula 0 simplified : !"(u57.flag_0_57==1)" R X(!"((u98.flag_1_99==0)||(u40.flag_0_40==1))" R (F!"((u85.p3_86==0)||(u98.p3_99==1))" & GF!"((u98.flag_1_99=...182
Reverse transition relation is NOT exact ! Due to transitions u0.t101, u1.t203, u2.t305, u3.t407, u4.t509, u5.t611, u6.t713, u7.t815, u8.t917, u9.t1019, u1...1250
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2814 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.9365,567364,1,0,1.46109e+06,5192,71630,943253,314,5172,1922179
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-100-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 587594 ms.

BK_STOP 1678259632446

--------------------
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="Dekker-PT-100"
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 Dekker-PT-100, 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 r133-smll-167819410000035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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