MCC'2023- Execution of r071-smll-167814397700188

About the Execution of LoLa+red for CircularTrains-PT-384

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1248.052	478469.00	511884.00	2205.80	FF?TFTFFTTFF??FF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397700188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r071-smll-167814397700188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 04:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 04:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 26 04:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 293K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1678254322966

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-384
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:45:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:45:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:45:26] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-08 05:45:26] [INFO ] Transformed 768 places.
[2023-03-08 05:45:26] [INFO ] Transformed 384 transitions.
[2023-03-08 05:45:27] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-384-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 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 191 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2023-03-08 05:45:27] [INFO ] Computed 385 place invariants in 136 ms
[2023-03-08 05:45:29] [INFO ] Implicit Places using invariants in 1802 ms returned [7, 17, 58, 107, 353, 354, 383, 448, 470, 475, 502, 538, 545, 600, 671, 689, 693, 718, 741, 743, 747, 749, 760, 763]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1865 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 744/768 places, 384/384 transitions.
Applied a total of 0 rules in 96 ms. Remains 744 /744 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2154 ms. Remains : 744/768 places, 384/384 transitions.
Support contains 60 out of 744 places after structural reductions.
[2023-03-08 05:45:29] [INFO ] Flatten gal took : 148 ms
[2023-03-08 05:45:29] [INFO ] Flatten gal took : 79 ms
[2023-03-08 05:45:30] [INFO ] Input system was already deterministic with 384 transitions.
Support contains 58 out of 744 places (down from 60) after GAL structural reductions.
Finished random walk after 1875 steps, including 0 resets, run visited all 27 properties in 307 ms. (steps per millisecond=6 )
FORMULA CircularTrains-PT-384-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(!p0)) U !p1))))'
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 744 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 738 transition count 378
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 738 transition count 360
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 720 transition count 360
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 702 transition count 342
Applied a total of 84 rules in 221 ms. Remains 702 /744 variables (removed 42) and now considering 342/384 (removed 42) transitions.
// Phase 1: matrix 342 rows 702 cols
[2023-03-08 05:45:31] [INFO ] Computed 361 place invariants in 36 ms
[2023-03-08 05:45:32] [INFO ] Implicit Places using invariants in 911 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 104, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 286, 313, 316, 322, 328, 329, 332, 333, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 422, 423, 447, 456, 466, 473, 474, 476, 477, 491, 494, 505, 515, 534, 537, 538, 544, 562, 570, 573, 576, 578, 586, 591, 592, 595, 596, 610, 620, 623, 644, 652, 658, 661, 665, 673, 676, 680, 684, 691, 694, 695, 698]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 915 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/744 places, 342/384 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 600 transition count 260
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 518 transition count 260
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 516 transition count 258
Applied a total of 168 rules in 59 ms. Remains 516 /600 variables (removed 84) and now considering 258/342 (removed 84) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 05:45:32] [INFO ] Computed 259 place invariants in 10 ms
[2023-03-08 05:45:32] [INFO ] Implicit Places using invariants in 731 ms returned []
[2023-03-08 05:45:32] [INFO ] Invariant cache hit.
[2023-03-08 05:45:34] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/744 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3010 ms. Remains : 516/744 places, 258/384 transitions.
Stuttering acceptance computed with spot in 408 ms :[p1, (AND p1 p0), p1]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s55 1) (GEQ s451 1)), p0:(AND (GEQ s149 1) (GEQ s239 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1992 ms.
Product exploration explored 100000 steps with 0 reset in 2413 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)), (X (NOT (AND p1 p0)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 746 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[p1, (AND p1 p0), p1]
Finished random walk after 496 steps, including 0 resets, run visited all 5 properties in 31 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 898 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[p1, (AND p1 p0), p1]
Stuttering acceptance computed with spot in 168 ms :[p1, (AND p1 p0), 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 30 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 05:45:41] [INFO ] Invariant cache hit.
[2023-03-08 05:45:42] [INFO ] Implicit Places using invariants in 946 ms returned []
[2023-03-08 05:45:42] [INFO ] Invariant cache hit.
[2023-03-08 05:45:43] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2023-03-08 05:45:43] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-08 05:45:43] [INFO ] Invariant cache hit.
[2023-03-08 05:45:43] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2681 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)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 730 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[p1, (AND p1 p0), p1]
Finished random walk after 106 steps, including 0 resets, run visited all 5 properties in 14 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 875 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[p1, (AND p1 p0), p1]
Stuttering acceptance computed with spot in 172 ms :[p1, (AND p1 p0), p1]
Stuttering acceptance computed with spot in 164 ms :[p1, (AND p1 p0), p1]
Product exploration explored 100000 steps with 0 reset in 1855 ms.
Product exploration explored 100000 steps with 0 reset in 1764 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 20 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 05:45:50] [INFO ] Invariant cache hit.
[2023-03-08 05:45:50] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-08 05:45:50] [INFO ] Invariant cache hit.
[2023-03-08 05:45:51] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
[2023-03-08 05:45:51] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-08 05:45:51] [INFO ] Invariant cache hit.
[2023-03-08 05:45:51] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1893 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-00 finished in 21127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 744 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 738 transition count 378
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 12 place count 738 transition count 361
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 46 place count 721 transition count 361
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 82 place count 703 transition count 343
Applied a total of 82 rules in 110 ms. Remains 703 /744 variables (removed 41) and now considering 343/384 (removed 41) transitions.
// Phase 1: matrix 343 rows 703 cols
[2023-03-08 05:45:52] [INFO ] Computed 361 place invariants in 11 ms
[2023-03-08 05:45:53] [INFO ] Implicit Places using invariants in 1034 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 104, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 201, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 286, 313, 316, 322, 328, 329, 332, 333, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 422, 447, 456, 466, 473, 474, 476, 477, 491, 494, 506, 516, 535, 538, 539, 545, 563, 571, 574, 577, 579, 587, 592, 593, 596, 597, 611, 615, 621, 624, 645, 653, 659, 662, 666, 674, 677, 681, 685, 692, 695, 696]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 1037 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 601/744 places, 343/384 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 601 transition count 259
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 517 transition count 259
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 2 with 2 rules applied. Total rules applied 170 place count 516 transition count 258
Applied a total of 170 rules in 59 ms. Remains 516 /601 variables (removed 85) and now considering 258/343 (removed 85) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 05:45:53] [INFO ] Computed 259 place invariants in 5 ms
[2023-03-08 05:45:54] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-08 05:45:54] [INFO ] Invariant cache hit.
[2023-03-08 05:45:55] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 2018 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/744 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3224 ms. Remains : 516/744 places, 258/384 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s363 1) (LT s513 1)) (OR (LT s207 1) (LT s307 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1770 ms.
Product exploration explored 100000 steps with 0 reset in 1969 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
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 27 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 05:45:59] [INFO ] Invariant cache hit.
[2023-03-08 05:46:00] [INFO ] Implicit Places using invariants in 881 ms returned []
[2023-03-08 05:46:00] [INFO ] Invariant cache hit.
[2023-03-08 05:46:01] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2023-03-08 05:46:01] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 05:46:01] [INFO ] Invariant cache hit.
[2023-03-08 05:46:01] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2247 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 : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=11 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2314 ms.
Product exploration explored 100000 steps with 0 reset in 1774 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 15 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 05:46:06] [INFO ] Invariant cache hit.
[2023-03-08 05:46:07] [INFO ] Implicit Places using invariants in 864 ms returned []
[2023-03-08 05:46:07] [INFO ] Invariant cache hit.
[2023-03-08 05:46:08] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2023-03-08 05:46:08] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:46:08] [INFO ] Invariant cache hit.
[2023-03-08 05:46:09] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2225 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-01 finished in 17016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Applied a total of 0 rules in 28 ms. Remains 744 /744 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 744 cols
[2023-03-08 05:46:09] [INFO ] Computed 361 place invariants in 19 ms
[2023-03-08 05:46:10] [INFO ] Implicit Places using invariants in 1347 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 60, 61, 68, 82, 83, 85, 95, 100, 104, 105, 129, 131, 133, 154, 158, 163, 170, 175, 181, 189, 194, 199, 211, 216, 217, 226, 241, 242, 250, 266, 272, 283, 289, 297, 299, 327, 330, 336, 342, 343, 346, 347, 351, 359, 383, 390, 396, 404, 405, 415, 419, 426, 440, 441, 466, 475, 486, 493, 494, 496, 497, 511, 514, 527, 538, 563, 566, 567, 573, 593, 605, 608, 611, 614, 624, 629, 630, 633, 634, 648, 652, 659, 683, 691, 698, 701, 705, 714, 717, 722, 726, 736, 737, 740]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 1351 ms to find 102 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/744 places, 384/384 transitions.
Applied a total of 0 rules in 24 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 1405 ms. Remains : 642/744 places, 384/384 transitions.
Stuttering acceptance computed with spot in 187 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s247 1) (LT s634 1)), p2:(AND (GEQ s269 1) (GEQ s549 1)), p1:(AND (GEQ s372 1) (GEQ s572 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 755 reset in 2473 ms.
Product exploration explored 100000 steps with 748 reset in 2471 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 p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(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 (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT 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 (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 1071 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 171 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 644 steps, including 0 resets, run visited all 8 properties in 51 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(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 (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT 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 (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1364 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 177 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 177 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 22 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2023-03-08 05:46:18] [INFO ] Computed 259 place invariants in 13 ms
[2023-03-08 05:46:19] [INFO ] Implicit Places using invariants in 921 ms returned []
[2023-03-08 05:46:19] [INFO ] Invariant cache hit.
[2023-03-08 05:46:20] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-08 05:46:20] [INFO ] Invariant cache hit.
[2023-03-08 05:46:21] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2785 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 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 906 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)]
Finished random walk after 4955 steps, including 1 resets, run visited all 8 properties in 214 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1345 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 175 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 736 reset in 2474 ms.
Product exploration explored 100000 steps with 777 reset in 2251 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 13 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 05:46:29] [INFO ] Invariant cache hit.
[2023-03-08 05:46:30] [INFO ] Implicit Places using invariants in 809 ms returned []
[2023-03-08 05:46:30] [INFO ] Invariant cache hit.
[2023-03-08 05:46:31] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1970 ms to find 0 implicit places.
[2023-03-08 05:46:31] [INFO ] Invariant cache hit.
[2023-03-08 05:46:32] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2562 ms. Remains : 642/642 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 23376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 744 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 738 transition count 378
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 738 transition count 360
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 720 transition count 360
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 702 transition count 342
Applied a total of 84 rules in 96 ms. Remains 702 /744 variables (removed 42) and now considering 342/384 (removed 42) transitions.
// Phase 1: matrix 342 rows 702 cols
[2023-03-08 05:46:32] [INFO ] Computed 361 place invariants in 10 ms
[2023-03-08 05:46:33] [INFO ] Implicit Places using invariants in 1400 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 104, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 201, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 286, 313, 316, 322, 328, 329, 332, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 422, 423, 447, 466, 473, 474, 476, 477, 491, 494, 505, 515, 534, 537, 538, 544, 562, 570, 573, 576, 578, 586, 591, 592, 595, 596, 610, 614, 620, 623, 644, 652, 658, 661, 665, 673, 676, 680, 684, 691, 694, 695, 698]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 1403 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/744 places, 342/384 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 600 transition count 260
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 518 transition count 260
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 516 transition count 258
Applied a total of 168 rules in 62 ms. Remains 516 /600 variables (removed 84) and now considering 258/342 (removed 84) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 05:46:34] [INFO ] Computed 259 place invariants in 6 ms
[2023-03-08 05:46:34] [INFO ] Implicit Places using invariants in 928 ms returned []
[2023-03-08 05:46:34] [INFO ] Invariant cache hit.
[2023-03-08 05:46:35] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1976 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/744 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3537 ms. Remains : 516/744 places, 258/384 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s316 1) (GEQ s337 1)), p0:(AND (GEQ s111 1) (GEQ s246 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1034 reset in 2357 ms.
Product exploration explored 100000 steps with 1019 reset in 2143 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)), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 488 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 191 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 147 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X 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 (NOT p0))), (X (X p0)), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 745 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 208 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2023-03-08 05:46:42] [INFO ] Invariant cache hit.
[2023-03-08 05:46:43] [INFO ] [Real]Absence check using 256 positive place invariants in 195 ms returned sat
[2023-03-08 05:46:43] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 53 ms returned sat
[2023-03-08 05:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:44] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2023-03-08 05:46:44] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-08 05:46:48] [INFO ] Added : 127 causal constraints over 26 iterations in 3610 ms. Result :sat
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 23 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 05:46:48] [INFO ] Invariant cache hit.
[2023-03-08 05:46:49] [INFO ] Implicit Places using invariants in 837 ms returned []
[2023-03-08 05:46:49] [INFO ] Invariant cache hit.
[2023-03-08 05:46:50] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2023-03-08 05:46:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:46:50] [INFO ] Invariant cache hit.
[2023-03-08 05:46:51] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2509 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)), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 493 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 203 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 126 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X 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 (NOT p0))), (X (X p0)), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 804 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 152 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2023-03-08 05:46:53] [INFO ] Invariant cache hit.
[2023-03-08 05:46:53] [INFO ] [Real]Absence check using 256 positive place invariants in 203 ms returned sat
[2023-03-08 05:46:53] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 56 ms returned sat
[2023-03-08 05:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:55] [INFO ] [Real]Absence check using state equation in 1505 ms returned sat
[2023-03-08 05:46:55] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-08 05:46:58] [INFO ] Added : 127 causal constraints over 26 iterations in 3284 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1016 reset in 2551 ms.
Product exploration explored 100000 steps with 1041 reset in 2181 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.
[2023-03-08 05:47:03] [INFO ] Invariant cache hit.
[2023-03-08 05:47:04] [INFO ] Implicit Places using invariants in 892 ms returned []
[2023-03-08 05:47:04] [INFO ] Invariant cache hit.
[2023-03-08 05:47:05] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2023-03-08 05:47:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:47:05] [INFO ] Invariant cache hit.
[2023-03-08 05:47:05] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2409 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-05 finished in 33576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 8 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 744 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 738 transition count 378
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 738 transition count 360
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 720 transition count 360
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 702 transition count 342
Applied a total of 84 rules in 86 ms. Remains 702 /744 variables (removed 42) and now considering 342/384 (removed 42) transitions.
// Phase 1: matrix 342 rows 702 cols
[2023-03-08 05:47:06] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-08 05:47:07] [INFO ] Implicit Places using invariants in 1286 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 104, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 286, 313, 316, 322, 328, 329, 332, 333, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 422, 423, 447, 456, 466, 473, 474, 476, 477, 491, 494, 505, 515, 534, 537, 538, 544, 562, 570, 573, 576, 578, 586, 591, 592, 595, 596, 610, 614, 620, 623, 644, 652, 658, 661, 665, 673, 676, 680, 684, 691, 694, 695, 698]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 1288 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 599/744 places, 342/384 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 599 transition count 262
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 161 place count 519 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 518 transition count 261
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 162 place count 518 transition count 258
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 168 place count 515 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 514 transition count 257
Applied a total of 170 rules in 52 ms. Remains 514 /599 variables (removed 85) and now considering 257/342 (removed 85) transitions.
// Phase 1: matrix 257 rows 514 cols
[2023-03-08 05:47:07] [INFO ] Computed 258 place invariants in 3 ms
[2023-03-08 05:47:08] [INFO ] Implicit Places using invariants in 823 ms returned []
[2023-03-08 05:47:08] [INFO ] Invariant cache hit.
[2023-03-08 05:47:09] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/744 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3320 ms. Remains : 514/744 places, 257/384 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s31 1) (GEQ s450 1) (GEQ s289 1) (GEQ s402 1)), p0:(AND (GEQ s12 1) (GEQ s100 1) (GEQ s148 1) (GEQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 245 reset in 1984 ms.
Product exploration explored 100000 steps with 240 reset in 1947 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)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 226 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 425 steps, including 0 resets, run visited all 2 properties in 27 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 354 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 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 05:47:14] [INFO ] Invariant cache hit.
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLFireability-06 finished in 9093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 744 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 738 transition count 378
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 738 transition count 360
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 720 transition count 360
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 702 transition count 342
Applied a total of 84 rules in 79 ms. Remains 702 /744 variables (removed 42) and now considering 342/384 (removed 42) transitions.
// Phase 1: matrix 342 rows 702 cols
[2023-03-08 05:47:15] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-08 05:47:16] [INFO ] Implicit Places using invariants in 1383 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 201, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 286, 313, 316, 322, 328, 329, 332, 333, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 422, 423, 447, 456, 466, 473, 474, 476, 477, 491, 494, 505, 515, 534, 537, 538, 544, 562, 570, 573, 576, 578, 586, 591, 592, 595, 596, 610, 614, 620, 623, 644, 652, 658, 661, 665, 673, 676, 680, 684, 691, 694, 695, 698]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 1392 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 599/744 places, 342/384 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 599 transition count 258
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 515 transition count 258
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 2 with 2 rules applied. Total rules applied 170 place count 514 transition count 257
Applied a total of 170 rules in 41 ms. Remains 514 /599 variables (removed 85) and now considering 257/342 (removed 85) transitions.
// Phase 1: matrix 257 rows 514 cols
[2023-03-08 05:47:16] [INFO ] Computed 258 place invariants in 3 ms
[2023-03-08 05:47:17] [INFO ] Implicit Places using invariants in 908 ms returned []
[2023-03-08 05:47:17] [INFO ] Invariant cache hit.
[2023-03-08 05:47:18] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/744 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3387 ms. Remains : 514/744 places, 257/384 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s82 1) (GEQ s252 1) (GEQ s77 1) (GEQ s148 1))) (NOT (AND (GEQ s77 1) (GEQ s148 1)))), p0:(AND (GEQ s77 1) (GEQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 583 reset in 2593 ms.
Product exploration explored 100000 steps with 545 reset in 2253 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 (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 3 factoid took 253 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 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:47:24] [INFO ] Invariant cache hit.
[2023-03-08 05:47:24] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
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 (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 378 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 103 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 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 23 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-08 05:47:24] [INFO ] Invariant cache hit.
[2023-03-08 05:47:25] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-08 05:47:25] [INFO ] Invariant cache hit.
[2023-03-08 05:47:26] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
[2023-03-08 05:47:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:47:26] [INFO ] Invariant cache hit.
[2023-03-08 05:47:26] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2011 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 163 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 102 ms :[(NOT p1), (NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 207 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 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 580 reset in 2597 ms.
Product exploration explored 100000 steps with 546 reset in 2354 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 23 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-08 05:47:32] [INFO ] Invariant cache hit.
[2023-03-08 05:47:33] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-08 05:47:33] [INFO ] Invariant cache hit.
[2023-03-08 05:47:34] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2023-03-08 05:47:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:47:34] [INFO ] Invariant cache hit.
[2023-03-08 05:47:35] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2287 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-08 finished in 19975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 744 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 738 transition count 378
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 738 transition count 360
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 720 transition count 360
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 82 place count 703 transition count 343
Applied a total of 82 rules in 51 ms. Remains 703 /744 variables (removed 41) and now considering 343/384 (removed 41) transitions.
// Phase 1: matrix 343 rows 703 cols
[2023-03-08 05:47:35] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-08 05:47:36] [INFO ] Implicit Places using invariants in 1043 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 104, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 201, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 286, 313, 316, 322, 328, 329, 332, 333, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 422, 423, 447, 456, 466, 473, 474, 476, 477, 491, 494, 505, 515, 534, 537, 538, 544, 563, 571, 574, 577, 579, 587, 592, 593, 596, 597, 611, 615, 621, 624, 645, 653, 659, 662, 666, 674, 677, 681, 685, 692, 695, 696, 699]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1045 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 599/744 places, 343/384 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 599 transition count 258
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 514 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 170 place count 514 transition count 256
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 174 place count 512 transition count 256
Applied a total of 174 rules in 18 ms. Remains 512 /599 variables (removed 87) and now considering 256/343 (removed 87) transitions.
// Phase 1: matrix 256 rows 512 cols
[2023-03-08 05:47:36] [INFO ] Computed 257 place invariants in 3 ms
[2023-03-08 05:47:37] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-08 05:47:37] [INFO ] Invariant cache hit.
[2023-03-08 05:47:38] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/744 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3029 ms. Remains : 512/744 places, 256/384 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s131 1) (GEQ s477 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 716 reset in 2517 ms.
Product exploration explored 100000 steps with 752 reset in 2126 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 161 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 48 ms :[(NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=20 )
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 191 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-08 05:47:43] [INFO ] Invariant cache hit.
[2023-03-08 05:47:44] [INFO ] [Real]Absence check using 255 positive place invariants in 212 ms returned sat
[2023-03-08 05:47:44] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 32 ms returned sat
[2023-03-08 05:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:47:45] [INFO ] [Real]Absence check using state equation in 1472 ms returned sat
[2023-03-08 05:47:45] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-08 05:47:49] [INFO ] Added : 126 causal constraints over 26 iterations in 3398 ms. Result :sat
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 19 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:47:49] [INFO ] Invariant cache hit.
[2023-03-08 05:47:50] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-08 05:47:50] [INFO ] Invariant cache hit.
[2023-03-08 05:47:51] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
[2023-03-08 05:47:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:47:51] [INFO ] Invariant cache hit.
[2023-03-08 05:47:51] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2707 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 163 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 49 ms :[(NOT p0)]
Finished random walk after 297 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=29 )
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 196 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 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-08 05:47:52] [INFO ] Invariant cache hit.
[2023-03-08 05:47:53] [INFO ] [Real]Absence check using 255 positive place invariants in 140 ms returned sat
[2023-03-08 05:47:53] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-08 05:47:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:47:54] [INFO ] [Real]Absence check using state equation in 1336 ms returned sat
[2023-03-08 05:47:54] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-08 05:47:57] [INFO ] Added : 126 causal constraints over 26 iterations in 3108 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Product exploration explored 100000 steps with 737 reset in 2222 ms.
Product exploration explored 100000 steps with 724 reset in 2097 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 11 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:48:02] [INFO ] Invariant cache hit.
[2023-03-08 05:48:03] [INFO ] Implicit Places using invariants in 897 ms returned []
[2023-03-08 05:48:03] [INFO ] Invariant cache hit.
[2023-03-08 05:48:04] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2023-03-08 05:48:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:48:04] [INFO ] Invariant cache hit.
[2023-03-08 05:48:04] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2252 ms. Remains : 512/512 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-09 finished in 29367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Applied a total of 0 rules in 27 ms. Remains 744 /744 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 744 cols
[2023-03-08 05:48:04] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-08 05:48:05] [INFO ] Implicit Places using invariants in 1324 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 60, 61, 68, 82, 83, 85, 95, 100, 104, 105, 129, 131, 133, 154, 158, 163, 170, 175, 181, 189, 194, 199, 211, 216, 217, 226, 241, 242, 250, 266, 272, 283, 289, 297, 299, 327, 330, 336, 342, 343, 346, 347, 351, 359, 383, 390, 396, 404, 405, 415, 419, 426, 440, 441, 466, 475, 486, 493, 494, 496, 497, 511, 514, 527, 538, 563, 566, 567, 573, 593, 605, 608, 611, 614, 624, 629, 630, 633, 634, 648, 652, 659, 662, 683, 691, 698, 701, 705, 714, 722, 726, 733, 736, 737, 740]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 1332 ms to find 103 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/744 places, 384/384 transitions.
Applied a total of 0 rules in 20 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 1379 ms. Remains : 641/744 places, 384/384 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s95 1) (GEQ s620 1)), p0:(AND (GEQ s355 1) (GEQ s504 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 243 steps with 3 reset in 9 ms.
FORMULA CircularTrains-PT-384-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 1528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 744 transition count 379
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 739 transition count 379
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 10 place count 739 transition count 360
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 48 place count 720 transition count 360
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 702 transition count 342
Applied a total of 84 rules in 75 ms. Remains 702 /744 variables (removed 42) and now considering 342/384 (removed 42) transitions.
// Phase 1: matrix 342 rows 702 cols
[2023-03-08 05:48:06] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-08 05:48:07] [INFO ] Implicit Places using invariants in 1223 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 104, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 201, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 286, 313, 316, 322, 328, 329, 332, 333, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 422, 423, 447, 456, 466, 473, 474, 476, 477, 491, 494, 505, 515, 534, 537, 538, 544, 562, 570, 573, 576, 578, 586, 591, 592, 595, 596, 610, 614, 620, 623, 644, 652, 658, 661, 665, 673, 676, 680, 684, 691, 694, 695, 698]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1225 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 598/744 places, 342/384 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 598 transition count 257
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 513 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 170 place count 513 transition count 256
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 512 transition count 256
Applied a total of 172 rules in 17 ms. Remains 512 /598 variables (removed 86) and now considering 256/342 (removed 86) transitions.
// Phase 1: matrix 256 rows 512 cols
[2023-03-08 05:48:07] [INFO ] Computed 257 place invariants in 3 ms
[2023-03-08 05:48:08] [INFO ] Implicit Places using invariants in 736 ms returned []
[2023-03-08 05:48:08] [INFO ] Invariant cache hit.
[2023-03-08 05:48:08] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/744 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2795 ms. Remains : 512/744 places, 256/384 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s331 1) (GEQ s416 1) (GEQ s22 1) (GEQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 250 reset in 1967 ms.
Product exploration explored 100000 steps with 253 reset in 1945 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 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 33 ms :[(NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 162 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-08 05:48:13] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLFireability-11 finished in 7874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(F(p2)&&F(p0)&&p1)))))'
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Applied a total of 0 rules in 26 ms. Remains 744 /744 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 744 cols
[2023-03-08 05:48:13] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-08 05:48:15] [INFO ] Implicit Places using invariants in 1134 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 60, 61, 68, 82, 83, 85, 95, 100, 104, 105, 129, 131, 133, 154, 158, 163, 170, 175, 181, 189, 194, 199, 211, 216, 217, 226, 241, 242, 250, 266, 272, 283, 289, 297, 327, 330, 336, 342, 343, 346, 347, 351, 359, 383, 390, 396, 404, 405, 415, 419, 426, 441, 466, 475, 486, 493, 494, 496, 497, 511, 514, 527, 538, 563, 566, 567, 573, 593, 605, 608, 611, 614, 624, 629, 630, 633, 634, 648, 652, 659, 662, 683, 691, 698, 701, 705, 714, 717, 722, 726, 733, 736, 737, 740]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 1136 ms to find 102 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/744 places, 384/384 transitions.
Applied a total of 0 rules in 12 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 1174 ms. Remains : 642/744 places, 384/384 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s168 1) (GEQ s381 1)), p0:(AND (GEQ s168 1) (GEQ s381 1)), p2:(AND (GEQ s257 1) (GEQ s418 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 422 reset in 2046 ms.
Product exploration explored 100000 steps with 418 reset in 2028 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) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 634 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 384 rows 642 cols
[2023-03-08 05:48:21] [INFO ] Computed 259 place invariants in 7 ms
[2023-03-08 05:48:21] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p2) p0)), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 966 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-08 05:48:22] [INFO ] Invariant cache hit.
[2023-03-08 05:48:23] [INFO ] [Real]Absence check using 255 positive place invariants in 144 ms returned sat
[2023-03-08 05:48:23] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 58 ms returned sat
[2023-03-08 05:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:48:25] [INFO ] [Real]Absence check using state equation in 2355 ms returned sat
[2023-03-08 05:48:25] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-08 05:48:37] [INFO ] Added : 245 causal constraints over 49 iterations in 11834 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 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 20 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 05:48:37] [INFO ] Invariant cache hit.
[2023-03-08 05:48:38] [INFO ] Implicit Places using invariants in 786 ms returned []
[2023-03-08 05:48:38] [INFO ] Invariant cache hit.
[2023-03-08 05:48:39] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2023-03-08 05:48:39] [INFO ] Invariant cache hit.
[2023-03-08 05:48:39] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2429 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 p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 281 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Finished random walk after 86 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 1 factoid took 425 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-08 05:48:41] [INFO ] Invariant cache hit.
[2023-03-08 05:48:42] [INFO ] [Real]Absence check using 255 positive place invariants in 234 ms returned sat
[2023-03-08 05:48:42] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 67 ms returned sat
[2023-03-08 05:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:48:44] [INFO ] [Real]Absence check using state equation in 2165 ms returned sat
[2023-03-08 05:48:44] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-08 05:48:56] [INFO ] Added : 253 causal constraints over 51 iterations in 11920 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 439 reset in 2306 ms.
Product exploration explored 100000 steps with 433 reset in 2192 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 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 642 transition count 384
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 642 transition count 384
Deduced a syphon composed of 126 places in 0 ms
Applied a total of 126 rules in 151 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 05:49:01] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 384 rows 642 cols
[2023-03-08 05:49:01] [INFO ] Computed 259 place invariants in 6 ms
[2023-03-08 05:49:01] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 642/642 places, 384/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 866 ms. Remains : 642/642 places, 384/384 transitions.
Support contains 4 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 27 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2023-03-08 05:49:02] [INFO ] Computed 259 place invariants in 10 ms
[2023-03-08 05:49:02] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-08 05:49:02] [INFO ] Invariant cache hit.
[2023-03-08 05:49:03] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2023-03-08 05:49:03] [INFO ] Invariant cache hit.
[2023-03-08 05:49:04] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2279 ms. Remains : 642/642 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 50428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&F(!p1))))))'
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Applied a total of 0 rules in 20 ms. Remains 744 /744 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 744 cols
[2023-03-08 05:49:04] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-08 05:49:05] [INFO ] Implicit Places using invariants in 985 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 60, 61, 68, 82, 83, 85, 95, 100, 104, 105, 129, 131, 133, 154, 158, 163, 170, 175, 181, 189, 194, 199, 211, 216, 226, 241, 242, 250, 266, 272, 283, 289, 297, 299, 327, 330, 336, 342, 343, 346, 347, 351, 359, 383, 390, 396, 404, 405, 415, 419, 426, 440, 441, 466, 475, 486, 493, 494, 496, 497, 511, 514, 527, 538, 563, 566, 567, 573, 593, 605, 608, 611, 614, 624, 629, 630, 633, 634, 648, 652, 659, 662, 683, 691, 698, 701, 705, 714, 717, 722, 726, 733, 736, 737, 740]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 987 ms to find 103 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/744 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.
Finished structural reductions in LTL mode , in 2 iterations and 1019 ms. Remains : 641/744 places, 384/384 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, p1, p0, (AND p1 p0), p0, p0]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s185 1) (GEQ s352 1)), p0:(AND (GEQ s193 1) (GEQ s368 1) (GEQ s436 1) (GEQ s506 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21157 reset in 2615 ms.
Product exploration explored 100000 steps with 21740 reset in 2788 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)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 220 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 253 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
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 21 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 641 cols
[2023-03-08 05:49:11] [INFO ] Computed 258 place invariants in 7 ms
[2023-03-08 05:49:12] [INFO ] Implicit Places using invariants in 931 ms returned []
[2023-03-08 05:49:12] [INFO ] Invariant cache hit.
[2023-03-08 05:49:14] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
[2023-03-08 05:49:14] [INFO ] Invariant cache hit.
[2023-03-08 05:49:14] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2570 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 p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 244 steps, including 0 resets, run visited all 3 properties in 21 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 1 factoid took 235 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 244 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 246 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 21037 reset in 2553 ms.
Product exploration explored 100000 steps with 20934 reset in 2978 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 165 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
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 122 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 641 transition count 384
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 122 place count 641 transition count 384
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 4 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 36 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 05:49:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 384 rows 641 cols
[2023-03-08 05:49:21] [INFO ] Computed 258 place invariants in 4 ms
[2023-03-08 05:49:22] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 641/641 places, 384/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 683 ms. Remains : 641/641 places, 384/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 18 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 641 cols
[2023-03-08 05:49:22] [INFO ] Computed 258 place invariants in 6 ms
[2023-03-08 05:49:23] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-08 05:49:23] [INFO ] Invariant cache hit.
[2023-03-08 05:49:24] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2023-03-08 05:49:24] [INFO ] Invariant cache hit.
[2023-03-08 05:49:24] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2239 ms. Remains : 641/641 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-13 finished in 20526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(!p0)))&&F(p1)))'
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 744 /744 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 744 cols
[2023-03-08 05:49:24] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-08 05:49:25] [INFO ] Implicit Places using invariants in 877 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 60, 61, 68, 82, 83, 85, 95, 100, 104, 105, 129, 131, 133, 154, 158, 163, 170, 175, 181, 189, 194, 199, 211, 216, 217, 226, 241, 242, 250, 266, 272, 283, 289, 297, 299, 327, 330, 336, 342, 343, 346, 347, 351, 359, 383, 390, 396, 404, 405, 415, 419, 426, 440, 441, 466, 475, 486, 493, 494, 496, 497, 511, 514, 527, 538, 563, 566, 567, 573, 593, 605, 608, 611, 624, 629, 630, 633, 634, 648, 652, 659, 662, 683, 691, 698, 701, 705, 714, 717, 722, 726, 733, 736, 737, 740]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 879 ms to find 103 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/744 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.
Finished structural reductions in LTL mode , in 2 iterations and 906 ms. Remains : 641/744 places, 384/384 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), false, (NOT p1), p0, true]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s11 1) (LT s533 1)), p0:(AND (GEQ s57 1) (GEQ s637 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 131 steps with 0 reset in 3 ms.
FORMULA CircularTrains-PT-384-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 1070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((p1&&(p0 U (p2||G(p0)))))))))'
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 744 /744 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 05:49:25] [INFO ] Invariant cache hit.
[2023-03-08 05:49:26] [INFO ] Implicit Places using invariants in 1081 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 60, 61, 68, 82, 83, 85, 95, 100, 104, 105, 129, 131, 133, 154, 158, 163, 170, 175, 181, 189, 194, 199, 211, 216, 217, 226, 241, 242, 250, 266, 272, 283, 289, 297, 299, 327, 330, 336, 342, 343, 346, 347, 351, 359, 390, 396, 404, 405, 415, 419, 426, 440, 441, 466, 475, 486, 493, 494, 496, 497, 511, 514, 527, 538, 563, 566, 567, 573, 593, 605, 608, 611, 614, 624, 629, 630, 633, 634, 648, 652, 659, 662, 683, 691, 698, 701, 705, 714, 717, 722, 726, 733, 736, 737, 740]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 1082 ms to find 103 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/744 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.
Finished structural reductions in LTL mode , in 2 iterations and 1111 ms. Remains : 641/744 places, 384/384 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s80 1) (GEQ s459 1)), p2:(AND (NOT (AND (GEQ s153 1) (GEQ s331 1))) (GEQ s80 1) (GEQ s459 1)), p1:(OR (LT s5 1) (LT s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-384-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-15 finished in 1230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(!p0)) U !p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||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 132 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 744 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 738 transition count 378
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 738 transition count 360
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 720 transition count 360
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 702 transition count 342
Applied a total of 84 rules in 73 ms. Remains 702 /744 variables (removed 42) and now considering 342/384 (removed 42) transitions.
// Phase 1: matrix 342 rows 702 cols
[2023-03-08 05:49:27] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-08 05:49:28] [INFO ] Implicit Places using invariants in 1155 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 104, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 201, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 286, 313, 316, 322, 328, 329, 332, 333, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 422, 423, 447, 456, 466, 473, 474, 476, 477, 491, 494, 505, 515, 534, 537, 538, 544, 562, 570, 573, 576, 578, 586, 591, 592, 595, 596, 610, 614, 620, 644, 652, 658, 661, 665, 673, 676, 680, 684, 694, 695, 698]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 1156 ms to find 102 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 600/744 places, 342/384 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 600 transition count 260
Reduce places removed 82 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 83 rules applied. Total rules applied 165 place count 518 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 517 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 516 transition count 258
Applied a total of 168 rules in 24 ms. Remains 516 /600 variables (removed 84) and now considering 258/342 (removed 84) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 05:49:28] [INFO ] Computed 259 place invariants in 3 ms
[2023-03-08 05:49:29] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-08 05:49:29] [INFO ] Invariant cache hit.
[2023-03-08 05:49:30] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 516/744 places, 258/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2892 ms. Remains : 516/744 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s203 1) (LT s509 1)), p2:(AND (GEQ s221 1) (GEQ s435 1)), p1:(AND (GEQ s302 1) (GEQ s455 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 892 reset in 2290 ms.
Product exploration explored 100000 steps with 884 reset in 2248 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 p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(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 (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT 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 (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 742 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)]
Finished random walk after 1912 steps, including 0 resets, run visited all 8 properties in 67 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(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 (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT 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 (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1284 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 175 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 169 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 13 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 05:49:37] [INFO ] Invariant cache hit.
[2023-03-08 05:49:38] [INFO ] Implicit Places using invariants in 882 ms returned []
[2023-03-08 05:49:38] [INFO ] Invariant cache hit.
[2023-03-08 05:49:39] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2023-03-08 05:49:39] [INFO ] Invariant cache hit.
[2023-03-08 05:49:39] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2058 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 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 1084 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 162 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1337 steps, including 0 resets, run visited all 8 properties in 56 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1286 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 168 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 838 reset in 2493 ms.
Product exploration explored 100000 steps with 859 reset in 2237 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.
[2023-03-08 05:49:47] [INFO ] Invariant cache hit.
[2023-03-08 05:49:48] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-08 05:49:48] [INFO ] Invariant cache hit.
[2023-03-08 05:49:49] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-08 05:49:49] [INFO ] Invariant cache hit.
[2023-03-08 05:49:49] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2046 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 22600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(F(p2)&&F(p0)&&p1)))))'
Found a Shortening insensitive property : CircularTrains-PT-384-LTLFireability-12
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 744/744 places, 384/384 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 744 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 738 transition count 378
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 738 transition count 360
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 720 transition count 360
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 702 transition count 342
Applied a total of 84 rules in 68 ms. Remains 702 /744 variables (removed 42) and now considering 342/384 (removed 42) transitions.
// Phase 1: matrix 342 rows 702 cols
[2023-03-08 05:49:50] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-08 05:49:51] [INFO ] Implicit Places using invariants in 1151 ms returned [1, 8, 19, 24, 30, 40, 44, 46, 59, 60, 67, 81, 82, 84, 94, 99, 103, 104, 125, 127, 129, 149, 152, 156, 163, 168, 172, 180, 184, 189, 201, 206, 207, 216, 231, 232, 239, 254, 260, 270, 276, 284, 313, 316, 322, 328, 329, 332, 333, 337, 344, 367, 374, 380, 386, 387, 397, 401, 408, 423, 447, 456, 466, 473, 474, 476, 477, 491, 494, 505, 515, 534, 537, 538, 544, 562, 570, 573, 576, 578, 586, 591, 592, 595, 596, 610, 614, 620, 623, 644, 652, 658, 661, 665, 673, 676, 680, 684, 691, 694, 695, 698]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 1155 ms to find 102 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 600/744 places, 342/384 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 600 transition count 260
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 518 transition count 260
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 516 transition count 258
Applied a total of 168 rules in 23 ms. Remains 516 /600 variables (removed 84) and now considering 258/342 (removed 84) transitions.
// Phase 1: matrix 258 rows 516 cols
[2023-03-08 05:49:51] [INFO ] Computed 259 place invariants in 3 ms
[2023-03-08 05:49:52] [INFO ] Implicit Places using invariants in 831 ms returned []
[2023-03-08 05:49:52] [INFO ] Invariant cache hit.
[2023-03-08 05:49:53] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 516/744 places, 258/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3159 ms. Remains : 516/744 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s139 1) (GEQ s308 1)), p0:(AND (GEQ s139 1) (GEQ s308 1)), p2:(AND (GEQ s210 1) (GEQ s340 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 552 reset in 2238 ms.
Product exploration explored 100000 steps with 528 reset in 2159 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) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 709 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:49:59] [INFO ] Invariant cache hit.
[2023-03-08 05:50:00] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p2) p0)), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 1041 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-08 05:50:01] [INFO ] Invariant cache hit.
[2023-03-08 05:50:02] [INFO ] [Real]Absence check using 255 positive place invariants in 211 ms returned sat
[2023-03-08 05:50:02] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 70 ms returned sat
[2023-03-08 05:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:50:03] [INFO ] [Real]Absence check using state equation in 1058 ms returned sat
[2023-03-08 05:50:03] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-08 05:50:06] [INFO ] Added : 127 causal constraints over 26 iterations in 3609 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 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 12 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 05:50:06] [INFO ] Invariant cache hit.
[2023-03-08 05:50:07] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-08 05:50:07] [INFO ] Invariant cache hit.
[2023-03-08 05:50:08] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
[2023-03-08 05:50:08] [INFO ] Invariant cache hit.
[2023-03-08 05:50:09] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2354 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 p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 361 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Finished random walk after 222 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 1 factoid took 439 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-08 05:50:10] [INFO ] Invariant cache hit.
[2023-03-08 05:50:11] [INFO ] [Real]Absence check using 255 positive place invariants in 209 ms returned sat
[2023-03-08 05:50:11] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 71 ms returned sat
[2023-03-08 05:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:50:12] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2023-03-08 05:50:12] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-08 05:50:16] [INFO ] Added : 127 causal constraints over 26 iterations in 3762 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 565 reset in 2174 ms.
Product exploration explored 100000 steps with 557 reset in 2060 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
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.
[2023-03-08 05:50:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:50:20] [INFO ] Invariant cache hit.
[2023-03-08 05:50:21] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 516/516 places, 258/258 transitions.
Support contains 4 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 12 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-08 05:50:21] [INFO ] Invariant cache hit.
[2023-03-08 05:50:22] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-08 05:50:22] [INFO ] Invariant cache hit.
[2023-03-08 05:50:22] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2023-03-08 05:50:22] [INFO ] Invariant cache hit.
[2023-03-08 05:50:23] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2146 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 33036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&F(!p1))))))'
[2023-03-08 05:50:23] [INFO ] Flatten gal took : 38 ms
[2023-03-08 05:50:23] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-08 05:50:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 744 places, 384 transitions and 1488 arcs took 11 ms.
Total runtime 296985 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircularTrains-PT-384
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability

FORMULA CircularTrains-PT-384-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-384-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-384-LTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-384-LTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-384-LTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678254801435

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:427
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CircularTrains-PT-384-LTLFireability-00
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 1 (type EXCL) for CircularTrains-PT-384-LTLFireability-00
lola: result : false
lola: markings : 58252
lola: fired transitions : 58382
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 22 (type EXCL) for 21 CircularTrains-PT-384-LTLFireability-13
lola: time limit : 514 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 LTL EXCL 4/514 5/32 CircularTrains-PT-384-LTLFireability-13 478893 m, 95778 m/sec, 926669 t fired, .

Time elapsed: 6 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 LTL EXCL 9/514 10/32 CircularTrains-PT-384-LTLFireability-13 1038672 m, 111955 m/sec, 2035541 t fired, .

Time elapsed: 11 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 LTL EXCL 14/514 14/32 CircularTrains-PT-384-LTLFireability-13 1530603 m, 98386 m/sec, 3151493 t fired, .

Time elapsed: 16 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 LTL EXCL 19/514 18/32 CircularTrains-PT-384-LTLFireability-13 1970988 m, 88077 m/sec, 4245220 t fired, .

Time elapsed: 21 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 LTL EXCL 24/514 22/32 CircularTrains-PT-384-LTLFireability-13 2413171 m, 88436 m/sec, 5327934 t fired, .

Time elapsed: 26 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 LTL EXCL 29/514 26/32 CircularTrains-PT-384-LTLFireability-13 2856354 m, 88636 m/sec, 6429414 t fired, .

Time elapsed: 31 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 LTL EXCL 34/514 30/32 CircularTrains-PT-384-LTLFireability-13 3297483 m, 88225 m/sec, 7523971 t fired, .

Time elapsed: 36 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 8
lola: CANCELED task # 22 (type EXCL) for CircularTrains-PT-384-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
lola: LAUNCH task # 19 (type EXCL) for 18 CircularTrains-PT-384-LTLFireability-12
lola: time limit : 593 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 5/593 3/32 CircularTrains-PT-384-LTLFireability-12 344642 m, 68928 m/sec, 1265412 t fired, .

Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 10/593 6/32 CircularTrains-PT-384-LTLFireability-12 675163 m, 66104 m/sec, 2573456 t fired, .

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 15/593 8/32 CircularTrains-PT-384-LTLFireability-12 1001861 m, 65339 m/sec, 3864359 t fired, .

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 20/593 11/32 CircularTrains-PT-384-LTLFireability-12 1332906 m, 66209 m/sec, 5170613 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 25/593 13/32 CircularTrains-PT-384-LTLFireability-12 1660387 m, 65496 m/sec, 6460288 t fired, .

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 30/593 15/32 CircularTrains-PT-384-LTLFireability-12 1985288 m, 64980 m/sec, 7728261 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 35/593 18/32 CircularTrains-PT-384-LTLFireability-12 2293504 m, 61643 m/sec, 9037523 t fired, .

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 40/593 20/32 CircularTrains-PT-384-LTLFireability-12 2551328 m, 51564 m/sec, 10314483 t fired, .

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 45/593 22/32 CircularTrains-PT-384-LTLFireability-12 2804854 m, 50705 m/sec, 11570026 t fired, .

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 50/593 23/32 CircularTrains-PT-384-LTLFireability-12 3055952 m, 50219 m/sec, 12811927 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 55/593 25/32 CircularTrains-PT-384-LTLFireability-12 3314325 m, 51674 m/sec, 14089238 t fired, .

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 60/593 27/32 CircularTrains-PT-384-LTLFireability-12 3569662 m, 51067 m/sec, 15349280 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 65/593 29/32 CircularTrains-PT-384-LTLFireability-12 3829957 m, 52059 m/sec, 16618098 t fired, .

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 70/593 31/32 CircularTrains-PT-384-LTLFireability-12 4073545 m, 48717 m/sec, 17820257 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
lola: CANCELED task # 19 (type EXCL) for CircularTrains-PT-384-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
lola: LAUNCH task # 7 (type EXCL) for 6 CircularTrains-PT-384-LTLFireability-02
lola: time limit : 696 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/696 4/32 CircularTrains-PT-384-LTLFireability-02 435739 m, 87147 m/sec, 1053887 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/696 6/32 CircularTrains-PT-384-LTLFireability-02 851263 m, 83104 m/sec, 2156745 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/696 9/32 CircularTrains-PT-384-LTLFireability-02 1270423 m, 83832 m/sec, 3263528 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/696 12/32 CircularTrains-PT-384-LTLFireability-02 1683491 m, 82613 m/sec, 4356955 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/696 15/32 CircularTrains-PT-384-LTLFireability-02 2094472 m, 82196 m/sec, 5436375 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/696 18/32 CircularTrains-PT-384-LTLFireability-02 2503462 m, 81798 m/sec, 6520878 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/696 21/32 CircularTrains-PT-384-LTLFireability-02 2917417 m, 82791 m/sec, 7610225 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/696 24/32 CircularTrains-PT-384-LTLFireability-02 3331340 m, 82784 m/sec, 8695453 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/696 27/32 CircularTrains-PT-384-LTLFireability-02 3741377 m, 82007 m/sec, 9770082 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/696 29/32 CircularTrains-PT-384-LTLFireability-02 4142173 m, 80159 m/sec, 10810416 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/696 32/32 CircularTrains-PT-384-LTLFireability-02 4559071 m, 83379 m/sec, 11887038 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
lola: CANCELED task # 7 (type EXCL) for CircularTrains-PT-384-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-384-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-09: F 0 1 0 0 1 0 0 0
CircularTrains-PT-384-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-384-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
lola: LAUNCH task # 24 (type EXCL) for 15 CircularTrains-PT-384-LTLFireability-09
lola: time limit : 856 sec
lola: memory limit: 32 pages
lola: FINISHED task # 24 (type EXCL) for CircularTrains-PT-384-LTLFireability-09
lola: result : false
lola: markings : 11659
lola: fired transitions : 11658
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 CircularTrains-PT-384-LTLFireability-08
lola: time limit : 1141 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for CircularTrains-PT-384-LTLFireability-08
lola: result : true
lola: markings : 38523
lola: fired transitions : 52057
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 CircularTrains-PT-384-LTLFireability-05
lola: time limit : 1712 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for CircularTrains-PT-384-LTLFireability-05
lola: result : true
lola: markings : 35596
lola: fired transitions : 47527
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CircularTrains-PT-384-LTLFireability-01
lola: time limit : 3423 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CircularTrains-PT-384-LTLFireability-01
lola: result : false
lola: markings : 11739
lola: fired transitions : 11740
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 8

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-384-LTLFireability-00: LTL false LTL model checker
CircularTrains-PT-384-LTLFireability-01: LTL false LTL model checker
CircularTrains-PT-384-LTLFireability-02: LTL unknown AGGR
CircularTrains-PT-384-LTLFireability-05: LTL true LTL model checker
CircularTrains-PT-384-LTLFireability-08: LTL true LTL model checker
CircularTrains-PT-384-LTLFireability-09: F true state space / EG
CircularTrains-PT-384-LTLFireability-12: LTL unknown AGGR
CircularTrains-PT-384-LTLFireability-13: LTL unknown AGGR

Time elapsed: 177 secs. Pages in use: 32

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
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 r071-smll-167814397700188"
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 ;