Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505700364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CircularTrains-PT-384, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505700364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 293K May 18 16:42 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 CircularTrains-PT-384-LTLFireability-00
FORMULA_NAME CircularTrains-PT-384-LTLFireability-01
FORMULA_NAME CircularTrains-PT-384-LTLFireability-02
FORMULA_NAME CircularTrains-PT-384-LTLFireability-03
FORMULA_NAME CircularTrains-PT-384-LTLFireability-04
FORMULA_NAME CircularTrains-PT-384-LTLFireability-05
FORMULA_NAME CircularTrains-PT-384-LTLFireability-06
FORMULA_NAME CircularTrains-PT-384-LTLFireability-07
FORMULA_NAME CircularTrains-PT-384-LTLFireability-08
FORMULA_NAME CircularTrains-PT-384-LTLFireability-09
FORMULA_NAME CircularTrains-PT-384-LTLFireability-10
FORMULA_NAME CircularTrains-PT-384-LTLFireability-11
FORMULA_NAME CircularTrains-PT-384-LTLFireability-12
FORMULA_NAME CircularTrains-PT-384-LTLFireability-13
FORMULA_NAME CircularTrains-PT-384-LTLFireability-14
FORMULA_NAME CircularTrains-PT-384-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717205603428

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-384
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:33:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:33:24] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-01 01:33:24] [INFO ] Transformed 768 places.
[2024-06-01 01:33:24] [INFO ] Transformed 384 transitions.
[2024-06-01 01:33:24] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-384-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 384/384 transitions.
Applied a total of 0 rules in 86 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2024-06-01 01:33:25] [INFO ] Computed 385 invariants in 49 ms
[2024-06-01 01:33:25] [INFO ] Implicit Places using invariants in 869 ms returned [1, 7, 9, 21, 26, 32, 42, 46, 48, 58, 63, 64, 71, 86, 88, 98, 103, 107, 108, 133, 135, 137, 158, 162, 167, 174, 179, 185, 193, 198, 203, 215, 220, 221, 230, 245, 246, 254, 270, 276, 287, 293, 301, 303, 340, 346, 347, 350, 353, 354, 357, 365, 383, 390, 397, 411, 412, 426, 433, 447, 448, 449, 470, 475, 476, 496, 502, 504, 505, 507, 508, 522, 525, 538, 539, 545, 551, 579, 580, 586, 600, 619, 622, 625, 628, 638, 643, 644, 647, 648, 662, 666, 671, 674, 689, 693, 700, 708, 715, 718, 719, 723, 732, 735, 740, 741, 746, 747, 749, 758, 759, 760, 763]
Discarding 113 places :
Implicit Place search using SMT only with invariants took 935 ms to find 113 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 655/768 places, 384/384 transitions.
Applied a total of 0 rules in 152 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1193 ms. Remains : 655/768 places, 384/384 transitions.
Support contains 54 out of 655 places after structural reductions.
[2024-06-01 01:33:26] [INFO ] Flatten gal took : 63 ms
[2024-06-01 01:33:26] [INFO ] Flatten gal took : 35 ms
[2024-06-01 01:33:26] [INFO ] Input system was already deterministic with 384 transitions.
Support contains 48 out of 655 places (down from 54) after GAL structural reductions.
RANDOM walk for 1557 steps (0 resets) in 327 ms. (4 steps per ms) remains 0/24 properties
FORMULA CircularTrains-PT-384-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 198 place count 556 transition count 272
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 169 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-06-01 01:33:27] [INFO ] Computed 272 invariants in 14 ms
[2024-06-01 01:33:28] [INFO ] Implicit Places using invariants in 961 ms returned [12, 63, 79, 238, 241, 250, 285, 296, 342, 400, 423, 466, 515, 521]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 976 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 57 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-06-01 01:33:28] [INFO ] Computed 258 invariants in 14 ms
[2024-06-01 01:33:28] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-06-01 01:33:28] [INFO ] Invariant cache hit.
[2024-06-01 01:33:29] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2312 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-00
Product exploration explored 100000 steps with 1098 reset in 1964 ms.
Product exploration explored 100000 steps with 963 reset in 1957 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 419 steps (0 resets) in 19 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:33:34] [INFO ] Invariant cache hit.
[2024-06-01 01:33:34] [INFO ] [Real]Absence check using 254 positive place invariants in 73 ms returned sat
[2024-06-01 01:33:34] [INFO ] [Real]Absence check using 254 positive and 4 generalized place invariants in 28 ms returned sat
[2024-06-01 01:33:35] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2024-06-01 01:33:35] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 01:33:49] [INFO ] Added : 126 causal constraints over 26 iterations in 13795 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:33:49] [INFO ] Invariant cache hit.
[2024-06-01 01:33:49] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-01 01:33:49] [INFO ] Invariant cache hit.
[2024-06-01 01:33:50] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2024-06-01 01:33:50] [INFO ] Redundant transitions in 10 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:33:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8831 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38903ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38910ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39659 ms. Remains : 514/514 places, 257/257 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 772 steps (0 resets) in 24 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:34:29] [INFO ] Invariant cache hit.
[2024-06-01 01:34:29] [INFO ] [Real]Absence check using 254 positive place invariants in 76 ms returned sat
[2024-06-01 01:34:29] [INFO ] [Real]Absence check using 254 positive and 4 generalized place invariants in 24 ms returned sat
[2024-06-01 01:34:30] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2024-06-01 01:34:30] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 01:34:44] [INFO ] Added : 125 causal constraints over 25 iterations in 13869 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1075 reset in 1735 ms.
Product exploration explored 100000 steps with 1031 reset in 1864 ms.
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:34:48] [INFO ] Invariant cache hit.
[2024-06-01 01:34:48] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-06-01 01:34:48] [INFO ] Invariant cache hit.
[2024-06-01 01:34:49] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-06-01 01:34:49] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:34:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8580 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38610ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38611ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39368 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-00 finished in 120716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-06-01 01:35:27] [INFO ] Computed 272 invariants in 10 ms
[2024-06-01 01:35:28] [INFO ] Implicit Places using invariants in 341 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 583, 637, 646, 651]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 342 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 364 ms. Remains : 640/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-01
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-384-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-01 finished in 526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:35:28] [INFO ] Invariant cache hit.
[2024-06-01 01:35:28] [INFO ] Implicit Places using invariants in 415 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 637, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 418 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 439 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02
Product exploration explored 100000 steps with 763 reset in 1790 ms.
Product exploration explored 100000 steps with 736 reset in 1962 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1163 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 8535 steps (1 resets) in 233 ms. (36 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1237 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2024-06-01 01:35:35] [INFO ] Computed 259 invariants in 7 ms
[2024-06-01 01:35:36] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 01:35:36] [INFO ] Invariant cache hit.
[2024-06-01 01:35:36] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 01:35:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23381 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53429ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53434ms
Finished structural reductions in LTL mode , in 1 iterations and 54237 ms. Remains : 642/642 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (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 6 factoid took 982 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 8252 steps (0 resets) in 245 ms. (33 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1816 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 745 reset in 1839 ms.
Product exploration explored 100000 steps with 713 reset in 1942 ms.
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:36:37] [INFO ] Invariant cache hit.
[2024-06-01 01:36:37] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 01:36:37] [INFO ] Invariant cache hit.
[2024-06-01 01:36:38] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 01:36:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23183 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53231ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53234ms
Finished structural reductions in LTL mode , in 1 iterations and 54092 ms. Remains : 642/642 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 123261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U ((p1 U X(X(X(!p2))))||G(!p0)))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-06-01 01:37:31] [INFO ] Computed 272 invariants in 5 ms
[2024-06-01 01:37:31] [INFO ] Implicit Places using invariants in 326 ms returned [14, 72, 90, 287, 290, 303, 348, 420, 499, 583, 637, 646, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 329 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 607 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), p2, (AND p0 p2), (AND p0 p2), p2, true, p2, p2, p2, p2, p2, p2, p2]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1970 steps with 321 reset in 43 ms.
FORMULA CircularTrains-PT-384-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-04 finished in 1024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 65 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-06-01 01:37:32] [INFO ] Computed 272 invariants in 3 ms
[2024-06-01 01:37:33] [INFO ] Implicit Places using invariants in 316 ms returned [12, 63, 79, 239, 242, 286, 297, 401, 424, 467, 516, 522, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 319 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 15 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2024-06-01 01:37:33] [INFO ] Computed 259 invariants in 3 ms
[2024-06-01 01:37:33] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-06-01 01:37:33] [INFO ] Invariant cache hit.
[2024-06-01 01:37:33] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1143 ms. Remains : 516/655 places, 258/384 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-05
Product exploration explored 100000 steps with 1027 reset in 1778 ms.
Product exploration explored 100000 steps with 988 reset in 1870 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 401 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 660 steps (0 resets) in 22 ms. (28 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 384 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2024-06-01 01:37:39] [INFO ] Invariant cache hit.
[2024-06-01 01:37:39] [INFO ] [Real]Absence check using 256 positive place invariants in 79 ms returned sat
[2024-06-01 01:37:39] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 34 ms returned sat
[2024-06-01 01:37:40] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2024-06-01 01:37:40] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 01:37:54] [INFO ] Added : 127 causal constraints over 26 iterations in 13650 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 12 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-01 01:37:54] [INFO ] Invariant cache hit.
[2024-06-01 01:37:54] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 01:37:54] [INFO ] Invariant cache hit.
[2024-06-01 01:37:54] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-06-01 01:37:54] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 01:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9343 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39372ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39373ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40087 ms. Remains : 516/516 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 402 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 602 steps (0 resets) in 33 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 436 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2024-06-01 01:38:35] [INFO ] Invariant cache hit.
[2024-06-01 01:38:35] [INFO ] [Real]Absence check using 256 positive place invariants in 75 ms returned sat
[2024-06-01 01:38:35] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 32 ms returned sat
[2024-06-01 01:38:36] [INFO ] [Real]Absence check using state equation in 983 ms returned sat
[2024-06-01 01:38:36] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 01:38:50] [INFO ] Added : 127 causal constraints over 26 iterations in 13739 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1008 reset in 1700 ms.
Product exploration explored 100000 steps with 1009 reset in 1847 ms.
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 14 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-01 01:38:54] [INFO ] Invariant cache hit.
[2024-06-01 01:38:54] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-06-01 01:38:54] [INFO ] Invariant cache hit.
[2024-06-01 01:38:54] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
[2024-06-01 01:38:54] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 01:38:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9361 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39386ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39388ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40115 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-05 finished in 121672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 198 place count 556 transition count 272
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 27 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-06-01 01:39:34] [INFO ] Computed 272 invariants in 2 ms
[2024-06-01 01:39:34] [INFO ] Implicit Places using invariants in 292 ms returned [63, 79, 239, 242, 251, 286, 297, 343, 400, 423, 466, 515, 521, 526]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 294 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 16 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-06-01 01:39:34] [INFO ] Computed 258 invariants in 8 ms
[2024-06-01 01:39:34] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 01:39:34] [INFO ] Invariant cache hit.
[2024-06-01 01:39:35] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1095 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-07
Product exploration explored 100000 steps with 1060 reset in 1727 ms.
Product exploration explored 100000 steps with 1057 reset in 1845 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 271 steps (0 resets) in 11 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-06-01 01:39:39] [INFO ] Invariant cache hit.
[2024-06-01 01:39:39] [INFO ] [Real]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-06-01 01:39:39] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 29 ms returned sat
[2024-06-01 01:39:40] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2024-06-01 01:39:41] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 01:39:54] [INFO ] Added : 120 causal constraints over 24 iterations in 13577 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 18 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:39:54] [INFO ] Invariant cache hit.
[2024-06-01 01:39:54] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 01:39:54] [INFO ] Invariant cache hit.
[2024-06-01 01:39:55] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-06-01 01:39:55] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:39:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8442 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38464ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38467ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39173 ms. Remains : 514/514 places, 257/257 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 335 steps (0 resets) in 17 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-06-01 01:40:34] [INFO ] Invariant cache hit.
[2024-06-01 01:40:34] [INFO ] [Real]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-06-01 01:40:34] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 27 ms returned sat
[2024-06-01 01:40:35] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2024-06-01 01:40:35] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 01:40:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1089 reset in 1721 ms.
Product exploration explored 100000 steps with 1080 reset in 1845 ms.
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:40:52] [INFO ] Invariant cache hit.
[2024-06-01 01:40:53] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-01 01:40:53] [INFO ] Invariant cache hit.
[2024-06-01 01:40:53] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-06-01 01:40:53] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8396 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38427ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38428ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39088 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-07 finished in 117705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 26 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-06-01 01:41:32] [INFO ] Computed 272 invariants in 4 ms
[2024-06-01 01:41:32] [INFO ] Implicit Places using invariants in 304 ms returned [12, 63, 240, 243, 252, 287, 298, 344, 401, 424, 467, 516, 522, 527]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 305 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/655 places, 259/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 516 transition count 258
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 514 transition count 257
Applied a total of 4 rules in 14 ms. Remains 514 /516 variables (removed 2) and now considering 257/259 (removed 2) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-06-01 01:41:32] [INFO ] Computed 258 invariants in 2 ms
[2024-06-01 01:41:32] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 01:41:32] [INFO ] Invariant cache hit.
[2024-06-01 01:41:33] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 977 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-08
Product exploration explored 100000 steps with 534 reset in 1659 ms.
Product exploration explored 100000 steps with 566 reset in 1816 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 398 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 778 ms. (51 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 1/1 properties
[2024-06-01 01:41:37] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/771 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/256 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 473 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 9 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:41:38] [INFO ] Invariant cache hit.
[2024-06-01 01:41:38] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 01:41:38] [INFO ] Invariant cache hit.
[2024-06-01 01:41:38] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-06-01 01:41:38] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:41:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8369 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38392ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38393ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39092 ms. Remains : 514/514 places, 257/257 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 354 steps (0 resets) in 15 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 541 reset in 1646 ms.
Product exploration explored 100000 steps with 576 reset in 1788 ms.
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:42:21] [INFO ] Invariant cache hit.
[2024-06-01 01:42:21] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 01:42:21] [INFO ] Invariant cache hit.
[2024-06-01 01:42:21] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2024-06-01 01:42:21] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:42:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8156 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38190ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38191ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38871 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-08 finished in 88184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 655 transition count 287
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 558 transition count 287
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 194 place count 558 transition count 271
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 226 place count 542 transition count 271
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 254 place count 528 transition count 257
Applied a total of 254 rules in 29 ms. Remains 528 /655 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 528 cols
[2024-06-01 01:43:00] [INFO ] Computed 272 invariants in 3 ms
[2024-06-01 01:43:00] [INFO ] Implicit Places using invariants in 297 ms returned [12, 63, 79, 238, 241, 250, 285, 296, 342, 399, 422, 465, 514, 520, 525]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 298 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/655 places, 257/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 256
Applied a total of 2 rules in 13 ms. Remains 512 /513 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 512 cols
[2024-06-01 01:43:00] [INFO ] Computed 257 invariants in 2 ms
[2024-06-01 01:43:00] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 01:43:00] [INFO ] Invariant cache hit.
[2024-06-01 01:43:01] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/655 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1011 ms. Remains : 512/655 places, 256/384 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-09
Product exploration explored 100000 steps with 746 reset in 1658 ms.
Product exploration explored 100000 steps with 710 reset in 1814 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 356 steps (0 resets) in 14 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-06-01 01:43:05] [INFO ] Invariant cache hit.
[2024-06-01 01:43:05] [INFO ] [Real]Absence check using 255 positive place invariants in 76 ms returned sat
[2024-06-01 01:43:05] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 23 ms returned sat
[2024-06-01 01:43:06] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2024-06-01 01:43:06] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 01:43:20] [INFO ] Added : 126 causal constraints over 26 iterations in 13677 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 17 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-01 01:43:20] [INFO ] Invariant cache hit.
[2024-06-01 01:43:20] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 01:43:20] [INFO ] Invariant cache hit.
[2024-06-01 01:43:20] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-06-01 01:43:20] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 01:43:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 769 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8472 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 38495ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38496ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39188 ms. Remains : 512/512 places, 256/256 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 273 steps (0 resets) in 15 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-06-01 01:43:59] [INFO ] Invariant cache hit.
[2024-06-01 01:44:00] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-06-01 01:44:00] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 16 ms returned sat
[2024-06-01 01:44:01] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2024-06-01 01:44:01] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 01:44:14] [INFO ] Added : 126 causal constraints over 26 iterations in 13723 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 721 reset in 1656 ms.
Product exploration explored 100000 steps with 720 reset in 1809 ms.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-01 01:44:18] [INFO ] Invariant cache hit.
[2024-06-01 01:44:18] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 01:44:18] [INFO ] Invariant cache hit.
[2024-06-01 01:44:19] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-06-01 01:44:19] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 01:44:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 769 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7941 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 37964ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 37966ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38626 ms. Remains : 512/512 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-09 finished in 116854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((X(p1)||F(p2)))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 8 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-06-01 01:44:57] [INFO ] Computed 272 invariants in 8 ms
[2024-06-01 01:44:57] [INFO ] Implicit Places using invariants in 333 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 583, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 333 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 8 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10
Product exploration explored 100000 steps with 21495 reset in 1739 ms.
Product exploration explored 100000 steps with 22062 reset in 1859 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 827 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1369 steps (0 resets) in 47 ms. (28 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F p2), (F (NOT (AND (NOT p2) p0))), (F p1)]
Knowledge based reduction with 2 factoid took 981 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
// Phase 1: matrix 384 rows 641 cols
[2024-06-01 01:45:04] [INFO ] Computed 258 invariants in 5 ms
[2024-06-01 01:45:04] [INFO ] [Real]Absence check using 255 positive place invariants in 84 ms returned sat
[2024-06-01 01:45:04] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 26 ms returned sat
[2024-06-01 01:45:07] [INFO ] [Real]Absence check using state equation in 2554 ms returned sat
[2024-06-01 01:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:45:07] [INFO ] [Nat]Absence check using 255 positive place invariants in 83 ms returned sat
[2024-06-01 01:45:07] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 26 ms returned sat
[2024-06-01 01:45:11] [INFO ] [Nat]Absence check using state equation in 4298 ms returned sat
[2024-06-01 01:45:11] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 01:45:22] [INFO ] Added : 85 causal constraints over 17 iterations in 10361 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:45:22] [INFO ] Invariant cache hit.
[2024-06-01 01:45:22] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 01:45:22] [INFO ] Invariant cache hit.
[2024-06-01 01:45:22] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 01:45:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 899 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23449 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 256/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1155 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53495ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53498ms
Finished structural reductions in LTL mode , in 1 iterations and 54238 ms. Remains : 641/641 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 803 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 2251 steps (0 resets) in 53 ms. (41 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F p2), (F (NOT (AND (NOT p2) p0))), (F p1)]
Knowledge based reduction with 2 factoid took 906 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
[2024-06-01 01:46:19] [INFO ] Invariant cache hit.
[2024-06-01 01:46:19] [INFO ] [Real]Absence check using 255 positive place invariants in 82 ms returned sat
[2024-06-01 01:46:19] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 34 ms returned sat
[2024-06-01 01:46:21] [INFO ] [Real]Absence check using state equation in 1617 ms returned sat
[2024-06-01 01:46:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:46:21] [INFO ] [Nat]Absence check using 255 positive place invariants in 79 ms returned sat
[2024-06-01 01:46:21] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 22 ms returned sat
[2024-06-01 01:46:25] [INFO ] [Nat]Absence check using state equation in 4103 ms returned sat
[2024-06-01 01:46:25] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 01:46:36] [INFO ] Added : 80 causal constraints over 16 iterations in 10583 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 22593 reset in 1731 ms.
Product exploration explored 100000 steps with 22079 reset in 1895 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 641 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 124 place count 641 transition count 384
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 641 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 127 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 641 transition count 384
Deduced a syphon composed of 127 places in 0 ms
Applied a total of 127 rules in 97 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:46:40] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 384 rows 641 cols
[2024-06-01 01:46:40] [INFO ] Computed 258 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 13 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 2 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 2 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 8 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:46:46] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 20/277 constraints. Problems are: Problem set: 20 solved, 236 unsolved
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 2 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-06-01 01:46:47] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 5 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 20/297 constraints. Problems are: Problem set: 40 solved, 216 unsolved
[2024-06-01 01:46:48] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 1 ms to minimize.
[2024-06-01 01:46:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 01:46:50] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-06-01 01:46:50] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 20/317 constraints. Problems are: Problem set: 60 solved, 196 unsolved
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:46:52] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
[2024-06-01 01:46:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD215 is UNSAT
[2024-06-01 01:46:53] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 01:46:53] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-06-01 01:46:53] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:46:54] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD234 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 20/337 constraints. Problems are: Problem set: 80 solved, 176 unsolved
[2024-06-01 01:46:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:46:54] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 01:46:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD166 is UNSAT
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-06-01 01:46:55] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-06-01 01:46:56] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:46:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:46:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 20/357 constraints. Problems are: Problem set: 100 solved, 156 unsolved
[2024-06-01 01:46:56] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:46:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 01:46:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-01 01:46:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 01:46:57] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 5/362 constraints. Problems are: Problem set: 105 solved, 151 unsolved
[2024-06-01 01:46:59] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:46:59] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 01:46:59] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 01:47:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:47:00] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 5/367 constraints. Problems are: Problem set: 110 solved, 146 unsolved
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD121 is UNSAT
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:47:01] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 9/376 constraints. Problems are: Problem set: 118 solved, 138 unsolved
[2024-06-01 01:47:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD140 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/640 variables, 1/377 constraints. Problems are: Problem set: 119 solved, 137 unsolved
[2024-06-01 01:47:05] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:47:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-06-01 01:47:05] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 01:47:06] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 4/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/640 variables, 0/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 15 (OVERLAPS) 1/641 variables, 1/382 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/382 constraints. Problems are: Problem set: 123 solved, 133 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 17 (OVERLAPS) 384/1025 variables, 641/1023 constraints. Problems are: Problem set: 127 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 1023 constraints, problems are : Problem set: 127 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 124/124 constraints]
Escalating to Integer solving :Problem set: 127 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 382/640 variables, 255/255 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 124/381 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/381 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/382 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/382 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/1023 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 129/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/1025 variables, 0/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1152 constraints, problems are : Problem set: 127 solved, 129 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 129/256 constraints, Known Traps: 124/124 constraints]
After SMT, in 60048ms problems are : Problem set: 127 solved, 129 unsolved
Search for dead transitions found 127 dead transitions in 60052ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 641/641 places, 257/384 transitions.
Graph (complete) has 1028 edges and 641 vertex of which 514 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.2 ms
Discarding 127 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 514 /641 variables (removed 127) and now considering 257/257 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/641 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60171 ms. Remains : 514/641 places, 257/384 transitions.
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 641 cols
[2024-06-01 01:47:40] [INFO ] Computed 258 invariants in 5 ms
[2024-06-01 01:47:40] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 01:47:41] [INFO ] Invariant cache hit.
[2024-06-01 01:47:41] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 01:47:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 899 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23505 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 256/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1155 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53548ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53550ms
Finished structural reductions in LTL mode , in 1 iterations and 54371 ms. Remains : 641/641 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 217977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p0))))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-06-01 01:48:35] [INFO ] Computed 272 invariants in 6 ms
[2024-06-01 01:48:35] [INFO ] Implicit Places using invariants in 336 ms returned [14, 72, 90, 290, 303, 348, 365, 420, 499, 526, 583, 637, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 337 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 364 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-384-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(G((!p1||X(!p2))))||G(!p3))))'
Support contains 8 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:48:35] [INFO ] Invariant cache hit.
[2024-06-01 01:48:35] [INFO ] Implicit Places using invariants in 344 ms returned [14, 72, 90, 287, 303, 348, 365, 420, 526, 583, 637, 646, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 345 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 367 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND p1 p2 p3), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2 p3), (AND p1 p2)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14
Product exploration explored 100000 steps with 302 reset in 1588 ms.
Product exploration explored 100000 steps with 286 reset in 1687 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 30 factoid took 919 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 2785 steps (0 resets) in 81 ms. (33 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 30 factoid took 1131 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 152 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Support contains 6 out of 642 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2024-06-01 01:48:42] [INFO ] Computed 259 invariants in 5 ms
[2024-06-01 01:48:42] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-06-01 01:48:42] [INFO ] Invariant cache hit.
[2024-06-01 01:48:42] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 01:48:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 24089 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 54131ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 54134ms
Finished structural reductions in LTL mode , in 1 iterations and 54926 ms. Remains : 642/642 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 7961 steps (1 resets) in 199 ms. (39 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F p3)]
Knowledge based reduction with 2 factoid took 272 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 154 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 149 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 267 reset in 1539 ms.
Product exploration explored 100000 steps with 296 reset in 1663 ms.
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:49:41] [INFO ] Invariant cache hit.
[2024-06-01 01:49:41] [INFO ] Implicit Places using invariants in 319 ms returned [286]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 320 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/642 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 641/642 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 66335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Found a Shortening insensitive property : CircularTrains-PT-384-LTLFireability-02
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 655 transition count 286
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 197 place count 557 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 23 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-06-01 01:49:42] [INFO ] Computed 272 invariants in 7 ms
[2024-06-01 01:49:42] [INFO ] Implicit Places using invariants in 313 ms returned [12, 63, 79, 239, 242, 251, 286, 297, 344, 401, 424, 516, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 314 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 15 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2024-06-01 01:49:42] [INFO ] Computed 259 invariants in 3 ms
[2024-06-01 01:49:42] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 01:49:42] [INFO ] Invariant cache hit.
[2024-06-01 01:49:43] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1017 ms. Remains : 516/655 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02
Product exploration explored 100000 steps with 862 reset in 1848 ms.
Product exploration explored 100000 steps with 837 reset in 1979 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1153 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 7666 steps (0 resets) in 329 ms. (23 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1270 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 8 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-01 01:49:50] [INFO ] Invariant cache hit.
[2024-06-01 01:49:50] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 01:49:50] [INFO ] Invariant cache hit.
[2024-06-01 01:49:50] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 01:49:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9751 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39774ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39776ms
Finished structural reductions in LTL mode , in 1 iterations and 40431 ms. Remains : 516/516 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (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 6 factoid took 1034 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 3907 steps (0 resets) in 130 ms. (29 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1320 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 794 reset in 1829 ms.
Product exploration explored 100000 steps with 845 reset in 1980 ms.
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-01 01:50:37] [INFO ] Invariant cache hit.
[2024-06-01 01:50:37] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-06-01 01:50:37] [INFO ] Invariant cache hit.
[2024-06-01 01:50:38] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 01:50:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9645 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39666ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39667ms
Finished structural reductions in LTL mode , in 1 iterations and 40371 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 95719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((X(p1)||F(p2)))))'
Found a Lengthening insensitive property : CircularTrains-PT-384-LTLFireability-10
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 655 transition count 287
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 558 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 557 transition count 286
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 196 place count 557 transition count 272
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 26 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-06-01 01:51:18] [INFO ] Computed 272 invariants in 2 ms
[2024-06-01 01:51:18] [INFO ] Implicit Places using invariants in 291 ms returned [12, 64, 80, 239, 242, 251, 286, 297, 343, 400, 423, 466, 521, 526]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 292 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 10 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-06-01 01:51:18] [INFO ] Computed 258 invariants in 3 ms
[2024-06-01 01:51:19] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 01:51:19] [INFO ] Invariant cache hit.
[2024-06-01 01:51:19] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1002 ms. Remains : 514/655 places, 257/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10
Product exploration explored 100000 steps with 23081 reset in 1721 ms.
Product exploration explored 100000 steps with 23683 reset in 1879 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 777 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1170 steps (0 resets) in 50 ms. (22 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 1 factoid took 1006 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
[2024-06-01 01:51:25] [INFO ] Invariant cache hit.
[2024-06-01 01:51:26] [INFO ] [Real]Absence check using 255 positive place invariants in 76 ms returned sat
[2024-06-01 01:51:26] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 20 ms returned sat
[2024-06-01 01:51:26] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2024-06-01 01:51:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:51:27] [INFO ] [Nat]Absence check using 255 positive place invariants in 65 ms returned sat
[2024-06-01 01:51:27] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 13 ms returned sat
[2024-06-01 01:51:28] [INFO ] [Nat]Absence check using state equation in 1699 ms returned sat
[2024-06-01 01:51:28] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 01:51:41] [INFO ] Added : 126 causal constraints over 26 iterations in 12604 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:51:41] [INFO ] Invariant cache hit.
[2024-06-01 01:51:41] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 01:51:41] [INFO ] Invariant cache hit.
[2024-06-01 01:51:42] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-06-01 01:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9386 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39415ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39416ms
Finished structural reductions in LTL mode , in 1 iterations and 40072 ms. Remains : 514/514 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 824 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1469 steps (0 resets) in 59 ms. (24 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 1 factoid took 991 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
[2024-06-01 01:52:24] [INFO ] Invariant cache hit.
[2024-06-01 01:52:24] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-06-01 01:52:24] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 20 ms returned sat
[2024-06-01 01:52:25] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2024-06-01 01:52:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:52:25] [INFO ] [Nat]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-06-01 01:52:25] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 13 ms returned sat
[2024-06-01 01:52:27] [INFO ] [Nat]Absence check using state equation in 1700 ms returned sat
[2024-06-01 01:52:27] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 01:52:40] [INFO ] Added : 126 causal constraints over 26 iterations in 12645 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 23033 reset in 1711 ms.
Product exploration explored 100000 steps with 22719 reset in 1856 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 11 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:52:44] [INFO ] Redundant transitions in 2 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:52:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9533 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39559ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39560ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39588 ms. Remains : 514/514 places, 257/257 transitions.
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:53:24] [INFO ] Invariant cache hit.
[2024-06-01 01:53:24] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-01 01:53:24] [INFO ] Invariant cache hit.
[2024-06-01 01:53:24] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-06-01 01:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9223 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39247ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39248ms
Finished structural reductions in LTL mode , in 1 iterations and 39921 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 165934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(G((!p1||X(!p2))))||G(!p3))))'
Found a Lengthening insensitive property : CircularTrains-PT-384-LTLFireability-14
Stuttering acceptance computed with spot in 220 ms :[(AND p1 p2 p3), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2 p3), (AND p1 p2)]
Support contains 8 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 655 transition count 289
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 560 transition count 289
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 190 place count 560 transition count 272
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 25 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-06-01 01:54:04] [INFO ] Computed 272 invariants in 3 ms
[2024-06-01 01:54:04] [INFO ] Implicit Places using invariants in 298 ms returned [12, 63, 79, 238, 250, 286, 297, 343, 423, 466, 515, 521, 526]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 310 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 516/655 places, 258/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 347 ms. Remains : 516/655 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14
Product exploration explored 100000 steps with 433 reset in 1648 ms.
Product exploration explored 100000 steps with 393 reset in 1765 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p0) p2))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 27 factoid took 1170 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 938 steps (0 resets) in 33 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p0) p2))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 27 factoid took 1820 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 190 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Support contains 6 out of 516 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 516 cols
[2024-06-01 01:54:11] [INFO ] Computed 259 invariants in 7 ms
[2024-06-01 01:54:12] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-06-01 01:54:12] [INFO ] Invariant cache hit.
[2024-06-01 01:54:12] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 01:54:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9492 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39525ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39527ms
Finished structural reductions in LTL mode , in 1 iterations and 40576 ms. Remains : 516/516 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 268 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 1609 steps (0 resets) in 56 ms. (28 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 1 factoid took 338 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 269 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 170 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 394 reset in 1592 ms.
Product exploration explored 100000 steps with 420 reset in 1725 ms.
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 11 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-01 01:54:57] [INFO ] Invariant cache hit.
[2024-06-01 01:54:57] [INFO ] Implicit Places using invariants in 279 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 280 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 515/516 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 515 /515 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 297 ms. Remains : 515/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 53697 ms.
[2024-06-01 01:54:57] [INFO ] Flatten gal took : 25 ms
[2024-06-01 01:54:57] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 01:54:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 655 places, 384 transitions and 1310 arcs took 8 ms.
Total runtime 1293210 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : CircularTrains-PT-384-LTLFireability-00
Could not compute solution for formula : CircularTrains-PT-384-LTLFireability-02
Could not compute solution for formula : CircularTrains-PT-384-LTLFireability-05
Could not compute solution for formula : CircularTrains-PT-384-LTLFireability-07
Could not compute solution for formula : CircularTrains-PT-384-LTLFireability-08
Could not compute solution for formula : CircularTrains-PT-384-LTLFireability-09
Could not compute solution for formula : CircularTrains-PT-384-LTLFireability-10
FORMULA CircularTrains-PT-384-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717207339703

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CircularTrains-PT-384-LTLFireability-00
ltl formula formula --ltl=/tmp/4900/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 655 places, 384 transitions and 1310 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4900/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4900/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4900/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4900/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 657 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 656, there are 389 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1547 levels ~10000 states ~233984 transitions
pnml2lts-mc( 2/ 4): ~3127 levels ~20000 states ~293644 transitions
pnml2lts-mc( 2/ 4): ~6316 levels ~40000 states ~360236 transitions
pnml2lts-mc( 2/ 4): ~12214 levels ~80000 states ~443048 transitions
pnml2lts-mc( 2/ 4): ~12214 levels ~160000 states ~589408 transitions
pnml2lts-mc( 2/ 4): ~12214 levels ~320000 states ~905892 transitions
pnml2lts-mc( 2/ 4): ~12214 levels ~640000 states ~1536612 transitions
pnml2lts-mc( 3/ 4): ~12142 levels ~1280000 states ~2842780 transitions
pnml2lts-mc( 3/ 4): ~12142 levels ~2560000 states ~5392444 transitions
pnml2lts-mc( 3/ 4): ~12142 levels ~5120000 states ~10486796 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6087501
pnml2lts-mc( 0/ 4): unique states count: 6135682
pnml2lts-mc( 0/ 4): unique transitions count: 15732689
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9208117
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6135685
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48801
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6135685 states 15733460 transitions, fanout: 2.564
pnml2lts-mc( 0/ 4): Total exploration time 64.370 sec (64.350 sec minimum, 64.355 sec on average)
pnml2lts-mc( 0/ 4): States per second: 95319, Transitions per second: 244422
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 113.8MB, 18.3 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 113.8MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLFireability-02
ltl formula formula --ltl=/tmp/4900/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 655 places, 384 transitions and 1310 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4900/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4900/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4900/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4900/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 656 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 656, there are 434 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~340 levels ~10000 states ~134612 transitions
pnml2lts-mc( 2/ 4): ~552 levels ~20000 states ~189092 transitions
pnml2lts-mc( 2/ 4): ~1215 levels ~40000 states ~282548 transitions
pnml2lts-mc( 2/ 4): ~4200 levels ~80000 states ~469008 transitions
pnml2lts-mc( 2/ 4): ~11568 levels ~160000 states ~764232 transitions
pnml2lts-mc( 2/ 4): ~12227 levels ~320000 states ~1344744 transitions
pnml2lts-mc( 2/ 4): ~12227 levels ~640000 states ~2853072 transitions
pnml2lts-mc( 1/ 4): ~12227 levels ~1280000 states ~5517984 transitions
pnml2lts-mc( 1/ 4): ~12227 levels ~2560000 states ~10592456 transitions
pnml2lts-mc( 0/ 4): ~12166 levels ~5120000 states ~21687464 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5399820
pnml2lts-mc( 0/ 4): unique states count: 5447907
pnml2lts-mc( 0/ 4): unique transitions count: 24652593
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18339182
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5447910
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48844
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5447910 states 24652979 transitions, fanout: 4.525
pnml2lts-mc( 0/ 4): Total exploration time 60.360 sec (60.340 sec minimum, 60.347 sec on average)
pnml2lts-mc( 0/ 4): States per second: 90257, Transitions per second: 408432
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 108.7MB, 19.4 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 108.7MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLFireability-05
ltl formula formula --ltl=/tmp/4900/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 655 places, 384 transitions and 1310 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4900/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4900/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4900/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4900/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 657 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 656, there are 397 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~624920 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~853416 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~1042592 transitions
pnml2lts-mc( 3/ 4): ~16412 levels ~80000 states ~1191896 transitions
pnml2lts-mc( 3/ 4): ~26494 levels ~160000 states ~1329748 transitions
pnml2lts-mc( 3/ 4): ~29868 levels ~320000 states ~1637596 transitions
pnml2lts-mc( 3/ 4): ~29868 levels ~640000 states ~2330924 transitions
pnml2lts-mc( 3/ 4): ~29868 levels ~1280000 states ~3889616 transitions
pnml2lts-mc( 1/ 4): ~21826 levels ~2560000 states ~6019728 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4778578
pnml2lts-mc( 0/ 4): unique states count: 4902224
pnml2lts-mc( 0/ 4): unique transitions count: 14097387
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8013143
pnml2lts-mc( 0/ 4): - claim found count: 4
pnml2lts-mc( 0/ 4): - claim success count: 4902246
pnml2lts-mc( 0/ 4): - cum. max stack depth: 124134
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4902246 states 14098617 transitions, fanout: 2.876
pnml2lts-mc( 0/ 4): Total exploration time 54.300 sec (54.290 sec minimum, 54.295 sec on average)
pnml2lts-mc( 0/ 4): States per second: 90281, Transitions per second: 259643
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 108.9MB, 19.4 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 108.9MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLFireability-07
ltl formula formula --ltl=/tmp/4900/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 655 places, 384 transitions and 1310 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4900/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4900/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4900/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4900/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 657 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 656, there are 386 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1756 levels ~10000 states ~246392 transitions
pnml2lts-mc( 0/ 4): ~3448 levels ~20000 states ~303568 transitions
pnml2lts-mc( 0/ 4): ~6831 levels ~40000 states ~372968 transitions
pnml2lts-mc( 3/ 4): ~12226 levels ~80000 states ~468104 transitions
pnml2lts-mc( 3/ 4): ~12226 levels ~160000 states ~666572 transitions
pnml2lts-mc( 3/ 4): ~12226 levels ~320000 states ~1070104 transitions
pnml2lts-mc( 3/ 4): ~12226 levels ~640000 states ~1864712 transitions
pnml2lts-mc( 3/ 4): ~12226 levels ~1280000 states ~3516020 transitions
pnml2lts-mc( 2/ 4): ~12221 levels ~2560000 states ~6077536 transitions
pnml2lts-mc( 2/ 4): ~12221 levels ~5120000 states ~12346024 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6297236
pnml2lts-mc( 0/ 4): unique states count: 6345461
pnml2lts-mc( 0/ 4): unique transitions count: 15672323
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 11585608
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7179988
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48835
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7179988 states 19658285 transitions, fanout: 2.738
pnml2lts-mc( 0/ 4): Total exploration time 76.400 sec (76.400 sec minimum, 76.400 sec on average)
pnml2lts-mc( 0/ 4): States per second: 93979, Transitions per second: 257307
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.5MB, 18.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 115.5MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLFireability-08
ltl formula formula --ltl=/tmp/4900/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 655 places, 384 transitions and 1310 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4900/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4900/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4900/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4900/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 657 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 656, there are 387 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2485 levels ~10000 states ~276496 transitions
pnml2lts-mc( 1/ 4): ~4984 levels ~20000 states ~345556 transitions
pnml2lts-mc( 1/ 4): ~9984 levels ~40000 states ~419564 transitions
pnml2lts-mc( 0/ 4): ~12223 levels ~80000 states ~487356 transitions
pnml2lts-mc( 0/ 4): ~12223 levels ~160000 states ~629448 transitions
pnml2lts-mc( 3/ 4): ~12227 levels ~320000 states ~946984 transitions
pnml2lts-mc( 0/ 4): ~12223 levels ~640000 states ~1582020 transitions
pnml2lts-mc( 0/ 4): ~12223 levels ~1280000 states ~2848024 transitions
pnml2lts-mc( 0/ 4): ~12223 levels ~2560000 states ~5600132 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2790230
pnml2lts-mc( 0/ 4): unique states count: 3620526
pnml2lts-mc( 0/ 4): unique transitions count: 11303431
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4075795
pnml2lts-mc( 0/ 4): - claim found count: 1114797
pnml2lts-mc( 0/ 4): - claim success count: 3620529
pnml2lts-mc( 0/ 4): - cum. max stack depth: 830750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3620529 states 11303815 transitions, fanout: 3.122
pnml2lts-mc( 0/ 4): Total exploration time 44.890 sec (44.880 sec minimum, 44.883 sec on average)
pnml2lts-mc( 0/ 4): States per second: 80653, Transitions per second: 251811
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 110.1MB, 19.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 110.1MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLFireability-09
ltl formula formula --ltl=/tmp/4900/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 655 places, 384 transitions and 1310 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4900/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4900/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4900/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4900/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 657 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 656, there are 386 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1883 levels ~10000 states ~297852 transitions
pnml2lts-mc( 2/ 4): ~3730 levels ~20000 states ~351640 transitions
pnml2lts-mc( 2/ 4): ~7549 levels ~40000 states ~417196 transitions
pnml2lts-mc( 2/ 4): ~12227 levels ~80000 states ~511036 transitions
pnml2lts-mc( 2/ 4): ~12227 levels ~160000 states ~692052 transitions
pnml2lts-mc( 2/ 4): ~12227 levels ~320000 states ~1067060 transitions
pnml2lts-mc( 1/ 4): ~12203 levels ~640000 states ~1650208 transitions
pnml2lts-mc( 1/ 4): ~12203 levels ~1280000 states ~3124204 transitions
pnml2lts-mc( 1/ 4): ~12203 levels ~2560000 states ~6264816 transitions
pnml2lts-mc( 1/ 4): ~12203 levels ~5120000 states ~12545832 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6790338
pnml2lts-mc( 0/ 4): unique states count: 6838807
pnml2lts-mc( 0/ 4): unique transitions count: 18889530
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 11530791
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6838810
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48857
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6838810 states 18890301 transitions, fanout: 2.762
pnml2lts-mc( 0/ 4): Total exploration time 72.760 sec (72.750 sec minimum, 72.755 sec on average)
pnml2lts-mc( 0/ 4): States per second: 93991, Transitions per second: 259625
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 119.3MB, 17.3 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 119.3MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLFireability-10
ltl formula formula --ltl=/tmp/4900/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 655 places, 384 transitions and 1310 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4900/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4900/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4900/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4900/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 656 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 656, there are 435 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1197 levels ~10000 states ~219044 transitions
pnml2lts-mc( 1/ 4): ~2506 levels ~20000 states ~284488 transitions
pnml2lts-mc( 1/ 4): ~5180 levels ~40000 states ~356652 transitions
pnml2lts-mc( 1/ 4): ~10453 levels ~80000 states ~434856 transitions
pnml2lts-mc( 1/ 4): ~12220 levels ~160000 states ~616856 transitions
pnml2lts-mc( 1/ 4): ~12220 levels ~320000 states ~1029036 transitions
pnml2lts-mc( 1/ 4): ~12220 levels ~640000 states ~1912336 transitions
pnml2lts-mc( 0/ 4): ~12148 levels ~1280000 states ~3336232 transitions
pnml2lts-mc( 0/ 4): ~12148 levels ~2560000 states ~5980072 transitions
pnml2lts-mc( 0/ 4): ~12148 levels ~5120000 states ~11227520 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5484945
pnml2lts-mc( 0/ 4): unique states count: 5533284
pnml2lts-mc( 0/ 4): unique transitions count: 13467904
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8408936
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5932946
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48816
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5932946 states 15071635 transitions, fanout: 2.540
pnml2lts-mc( 0/ 4): Total exploration time 62.830 sec (62.820 sec minimum, 62.825 sec on average)
pnml2lts-mc( 0/ 4): States per second: 94429, Transitions per second: 239880
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 110.0MB, 19.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 110.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLFireability-14
ltl formula formula --ltl=/tmp/4900/ltl_7_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 655 places, 384 transitions and 1310 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4900/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4900/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4900/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4900/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 656 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 656, there are 426 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2499 levels ~10000 states ~306324 transitions
pnml2lts-mc( 2/ 4): ~4982 levels ~20000 states ~382460 transitions
pnml2lts-mc( 0/ 4): ~9641 levels ~40000 states ~478660 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~12579!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 476
pnml2lts-mc( 0/ 4): unique states count: 55074
pnml2lts-mc( 0/ 4): unique transitions count: 525502
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 3831
pnml2lts-mc( 0/ 4): - claim success count: 55077
pnml2lts-mc( 0/ 4): - cum. max stack depth: 54601
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 55077 states 525890 transitions, fanout: 9.548
pnml2lts-mc( 0/ 4): Total exploration time 1.510 sec (1.510 sec minimum, 1.510 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36475, Transitions per second: 348272
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 18.3MB, 36.7 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/22.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 18.3MB (~256.0MB paged-in)

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="CircularTrains-PT-384"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CircularTrains-PT-384, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505700364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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