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-167814397600180.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-192, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397600180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 04:32 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.0K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 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 147K 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-192-LTLFireability-00
FORMULA_NAME CircularTrains-PT-192-LTLFireability-01
FORMULA_NAME CircularTrains-PT-192-LTLFireability-02
FORMULA_NAME CircularTrains-PT-192-LTLFireability-03
FORMULA_NAME CircularTrains-PT-192-LTLFireability-04
FORMULA_NAME CircularTrains-PT-192-LTLFireability-05
FORMULA_NAME CircularTrains-PT-192-LTLFireability-06
FORMULA_NAME CircularTrains-PT-192-LTLFireability-07
FORMULA_NAME CircularTrains-PT-192-LTLFireability-08
FORMULA_NAME CircularTrains-PT-192-LTLFireability-09
FORMULA_NAME CircularTrains-PT-192-LTLFireability-10
FORMULA_NAME CircularTrains-PT-192-LTLFireability-11
FORMULA_NAME CircularTrains-PT-192-LTLFireability-12
FORMULA_NAME CircularTrains-PT-192-LTLFireability-13
FORMULA_NAME CircularTrains-PT-192-LTLFireability-14
FORMULA_NAME CircularTrains-PT-192-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678251434235

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-192
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:57:17] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-08 04:57:17] [INFO ] Transformed 384 places.
[2023-03-08 04:57:17] [INFO ] Transformed 192 transitions.
[2023-03-08 04:57:17] [INFO ] Parsed PT model containing 384 places and 192 transitions and 768 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CircularTrains-PT-192-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 192/192 transitions.
Applied a total of 0 rules in 113 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2023-03-08 04:57:18] [INFO ] Computed 193 place invariants in 50 ms
[2023-03-08 04:57:19] [INFO ] Implicit Places using invariants in 1194 ms returned [1, 10, 18, 21, 28, 37, 47, 62, 64, 65, 75, 78, 89, 101, 102, 133, 138, 144, 146, 160, 163, 167, 196, 217, 230, 231, 244, 245, 247, 261, 283, 284, 285, 293, 298, 311, 313, 314, 324, 327, 330, 333, 350, 354, 357, 360, 366, 371, 374, 375, 376, 378, 380, 382]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 1281 ms to find 54 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 330/384 places, 192/192 transitions.
Applied a total of 0 rules in 24 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1421 ms. Remains : 330/384 places, 192/192 transitions.
Support contains 48 out of 330 places after structural reductions.
[2023-03-08 04:57:20] [INFO ] Flatten gal took : 104 ms
[2023-03-08 04:57:20] [INFO ] Flatten gal took : 44 ms
[2023-03-08 04:57:20] [INFO ] Input system was already deterministic with 192 transitions.
Finished random walk after 943 steps, including 0 resets, run visited all 21 properties in 142 ms. (steps per millisecond=6 )
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(p0)))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 330 transition count 146
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 284 transition count 146
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 92 place count 284 transition count 139
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 106 place count 277 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 269 transition count 131
Applied a total of 122 rules in 101 ms. Remains 269 /330 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 269 cols
[2023-03-08 04:57:21] [INFO ] Computed 139 place invariants in 15 ms
[2023-03-08 04:57:21] [INFO ] Implicit Places using invariants in 476 ms returned [5, 34, 37, 60, 79, 104, 234, 246, 262]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 479 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/330 places, 131/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 129
Applied a total of 4 rules in 26 ms. Remains 258 /260 variables (removed 2) and now considering 129/131 (removed 2) transitions.
// Phase 1: matrix 129 rows 258 cols
[2023-03-08 04:57:21] [INFO ] Computed 130 place invariants in 6 ms
[2023-03-08 04:57:22] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-08 04:57:22] [INFO ] Invariant cache hit.
[2023-03-08 04:57:22] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/330 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1645 ms. Remains : 258/330 places, 129/192 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s42 1) (LT s243 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 1132 ms.
Product exploration explored 100000 steps with 0 reset in 1055 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 176 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 48 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
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 196 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 50 ms :[(NOT p0)]
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 16 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:57:25] [INFO ] Invariant cache hit.
[2023-03-08 04:57:26] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-08 04:57:26] [INFO ] Invariant cache hit.
[2023-03-08 04:57:26] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-08 04:57:26] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 04:57:26] [INFO ] Invariant cache hit.
[2023-03-08 04:57:27] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1350 ms. Remains : 258/258 places, 129/129 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 349 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 50 ms :[(NOT p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=13 )
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 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1199 ms.
Product exploration explored 100000 steps with 0 reset in 1145 ms.
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:57:30] [INFO ] Invariant cache hit.
[2023-03-08 04:57:30] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-08 04:57:30] [INFO ] Invariant cache hit.
[2023-03-08 04:57:31] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-08 04:57:31] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 04:57:31] [INFO ] Invariant cache hit.
[2023-03-08 04:57:31] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1398 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-00 finished in 10736 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&&X(!p1))||G(!p1)))))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 330 cols
[2023-03-08 04:57:31] [INFO ] Computed 139 place invariants in 12 ms
[2023-03-08 04:57:32] [INFO ] Implicit Places using invariants in 436 ms returned [6, 38, 41, 69, 93, 124, 291, 304, 312]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 442 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/330 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 321/330 places, 192/192 transitions.
Stuttering acceptance computed with spot in 248 ms :[p1, p1, p1]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s68 1) (GEQ s230 1)), p1:(AND (GEQ s42 1) (GEQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 821 reset in 1368 ms.
Product exploration explored 100000 steps with 835 reset in 1021 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 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (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 (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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))))]
Knowledge based reduction with 2 factoid took 575 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[p1, p1, p1]
Finished random walk after 217 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (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 (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 729 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 168 ms :[p1, p1, p1]
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2023-03-08 04:57:36] [INFO ] Computed 130 place invariants in 5 ms
[2023-03-08 04:57:37] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-08 04:57:37] [INFO ] Invariant cache hit.
[2023-03-08 04:57:37] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2023-03-08 04:57:37] [INFO ] Invariant cache hit.
[2023-03-08 04:57:38] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1546 ms. Remains : 321/321 places, 192/192 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)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (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 (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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))))]
Knowledge based reduction with 2 factoid took 596 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p1, p1, p1]
Finished random walk after 132 steps, including 0 resets, run visited all 4 properties in 13 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (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 (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 724 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 170 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 178 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 834 reset in 1144 ms.
Product exploration explored 100000 steps with 857 reset in 1002 ms.
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:57:42] [INFO ] Invariant cache hit.
[2023-03-08 04:57:43] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-08 04:57:43] [INFO ] Invariant cache hit.
[2023-03-08 04:57:43] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-08 04:57:43] [INFO ] Invariant cache hit.
[2023-03-08 04:57:44] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1373 ms. Remains : 321/321 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-01 finished in 12479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1 U p2))||p0)))'
Support contains 8 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 330 cols
[2023-03-08 04:57:44] [INFO ] Computed 139 place invariants in 23 ms
[2023-03-08 04:57:44] [INFO ] Implicit Places using invariants in 468 ms returned [6, 69, 93, 291, 304, 312, 322]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 470 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 323/330 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 487 ms. Remains : 323/330 places, 192/192 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s229 1) (LT s37 1) (LT s289 1) (AND (GEQ s121 1) (GEQ s160 1))), p2:(AND (GEQ s2 1) (GEQ s229 1)), p1:(AND (GEQ s40 1) (GEQ s83 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]]
Product exploration explored 100000 steps with 50000 reset in 1521 ms.
Product exploration explored 100000 steps with 50000 reset in 1211 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 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), true]
False Knowledge obtained : [(X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))
Knowledge based reduction with 5 factoid took 429 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-192-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-192-LTLFireability-04 finished in 3953 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||G(!p0)))))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:57:48] [INFO ] Invariant cache hit.
[2023-03-08 04:57:48] [INFO ] Implicit Places using invariants in 517 ms returned [6, 38, 41, 69, 93, 124, 291, 304, 312, 322]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 523 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/330 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 538 ms. Remains : 320/330 places, 192/192 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (GEQ s32 1) (GEQ s144 1))) (NOT (AND (GEQ s134 1) (GEQ s189 1)))), p0:(AND (GEQ s134 1) (GEQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-192-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-05 finished in 687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G((F(p0) U p1)))))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:57:48] [INFO ] Invariant cache hit.
[2023-03-08 04:57:49] [INFO ] Implicit Places using invariants in 501 ms returned [6, 38, 41, 69, 124, 291, 304, 312, 322]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 504 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/330 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 321/330 places, 192/192 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s64 1) (GEQ s174 1)), p1:(AND (GEQ s89 1) (GEQ s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 738 reset in 1246 ms.
Product exploration explored 100000 steps with 734 reset in 1171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 289 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 280 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 518 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 192 rows 321 cols
[2023-03-08 04:57:53] [INFO ] Computed 130 place invariants in 4 ms
[2023-03-08 04:57:53] [INFO ] [Real]Absence check using 127 positive place invariants in 85 ms returned sat
[2023-03-08 04:57:53] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 27 ms returned sat
[2023-03-08 04:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:57:54] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-08 04:57:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:57:55] [INFO ] [Nat]Absence check using 127 positive place invariants in 76 ms returned sat
[2023-03-08 04:57:55] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-08 04:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:57:55] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-08 04:57:55] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-08 04:57:57] [INFO ] Added : 125 causal constraints over 25 iterations in 1151 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:57:57] [INFO ] Invariant cache hit.
[2023-03-08 04:57:57] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-08 04:57:57] [INFO ] Invariant cache hit.
[2023-03-08 04:57:58] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2023-03-08 04:57:58] [INFO ] Invariant cache hit.
[2023-03-08 04:57:58] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1410 ms. Remains : 321/321 places, 192/192 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 p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 347 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 224 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 446 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 04:57:59] [INFO ] Invariant cache hit.
[2023-03-08 04:58:00] [INFO ] [Real]Absence check using 127 positive place invariants in 60 ms returned sat
[2023-03-08 04:58:00] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 30 ms returned sat
[2023-03-08 04:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:58:00] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2023-03-08 04:58:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:58:01] [INFO ] [Nat]Absence check using 127 positive place invariants in 52 ms returned sat
[2023-03-08 04:58:01] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-08 04:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:58:01] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2023-03-08 04:58:01] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-08 04:58:02] [INFO ] Added : 125 causal constraints over 25 iterations in 1037 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 761 reset in 1472 ms.
Product exploration explored 100000 steps with 762 reset in 1030 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 321 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 60 place count 321 transition count 192
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 321 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 321 transition count 192
Deduced a syphon composed of 63 places in 1 ms
Applied a total of 63 rules in 88 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:58:05] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 192 rows 321 cols
[2023-03-08 04:58:05] [INFO ] Computed 130 place invariants in 7 ms
[2023-03-08 04:58:06] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/321 places, 192/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 321/321 places, 192/192 transitions.
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 31 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2023-03-08 04:58:06] [INFO ] Computed 130 place invariants in 4 ms
[2023-03-08 04:58:06] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-08 04:58:06] [INFO ] Invariant cache hit.
[2023-03-08 04:58:07] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2023-03-08 04:58:07] [INFO ] Invariant cache hit.
[2023-03-08 04:58:07] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1461 ms. Remains : 321/321 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 18751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Applied a total of 0 rules in 11 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 330 cols
[2023-03-08 04:58:07] [INFO ] Computed 139 place invariants in 4 ms
[2023-03-08 04:58:08] [INFO ] Implicit Places using invariants in 517 ms returned [6, 38, 41, 93, 124, 291, 304, 312, 322]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 525 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/330 places, 192/192 transitions.
Applied a total of 0 rules in 13 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 549 ms. Remains : 321/330 places, 192/192 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s255 1) (GEQ s314 1) (GEQ s66 1) (GEQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-192-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-07 finished in 771 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)||((p0||X(X(!p0))) U (!p0&&X(!p1)))))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:58:08] [INFO ] Invariant cache hit.
[2023-03-08 04:58:08] [INFO ] Implicit Places using invariants in 512 ms returned [38, 41, 69, 93, 124, 291, 304, 312, 322]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 514 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/330 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 529 ms. Remains : 321/330 places, 192/192 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) p1), p1, (OR p1 p0), true, (OR p1 p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=p0, acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s205 1) (GEQ s315 1)), p1:(AND (GEQ s6 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1190 steps with 16 reset in 19 ms.
FORMULA CircularTrains-PT-192-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-09 finished in 822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(F(p1)))||p0)))))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:58:09] [INFO ] Invariant cache hit.
[2023-03-08 04:58:09] [INFO ] Implicit Places using invariants in 509 ms returned [6, 38, 41, 69, 93, 124, 291, 304, 312, 322]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 511 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/330 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 526 ms. Remains : 320/330 places, 192/192 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (LT s125 1) (LT s184 1)), p1:(OR (LT s90 1) (LT s255 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1449 ms.
Product exploration explored 100000 steps with 33333 reset in 1324 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 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-192-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-192-LTLFireability-10 finished in 3680 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 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 330 transition count 146
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 284 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 92 place count 284 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 108 place count 276 transition count 138
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 122 place count 269 transition count 131
Applied a total of 122 rules in 23 ms. Remains 269 /330 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 269 cols
[2023-03-08 04:58:12] [INFO ] Computed 139 place invariants in 2 ms
[2023-03-08 04:58:13] [INFO ] Implicit Places using invariants in 460 ms returned [5, 34, 37, 59, 78, 103, 234, 253, 262]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 462 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/330 places, 131/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 260 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 259 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 259 transition count 129
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 4 place count 258 transition count 129
Applied a total of 4 rules in 21 ms. Remains 258 /260 variables (removed 2) and now considering 129/131 (removed 2) transitions.
// Phase 1: matrix 129 rows 258 cols
[2023-03-08 04:58:13] [INFO ] Computed 130 place invariants in 2 ms
[2023-03-08 04:58:13] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-08 04:58:13] [INFO ] Invariant cache hit.
[2023-03-08 04:58:14] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/330 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1585 ms. Remains : 258/330 places, 129/192 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s103 1) (GEQ s148 1)) (AND (GEQ s205 1) (GEQ s237 1) (OR (LT s205 1) (LT s237 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 1466 reset in 1351 ms.
Product exploration explored 100000 steps with 1461 reset in 1053 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 157 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 50 ms :[(NOT p0)]
Finished random walk after 144 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=36 )
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 194 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 42 ms :[(NOT p0)]
[2023-03-08 04:58:17] [INFO ] Invariant cache hit.
[2023-03-08 04:58:17] [INFO ] [Real]Absence check using 127 positive place invariants in 53 ms returned sat
[2023-03-08 04:58:17] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-08 04:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:58:17] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-08 04:58:17] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-08 04:58:18] [INFO ] Added : 63 causal constraints over 13 iterations in 369 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:58:18] [INFO ] Invariant cache hit.
[2023-03-08 04:58:18] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-08 04:58:18] [INFO ] Invariant cache hit.
[2023-03-08 04:58:19] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2023-03-08 04:58:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:58:19] [INFO ] Invariant cache hit.
[2023-03-08 04:58:19] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1325 ms. Remains : 258/258 places, 129/129 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 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
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 198 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-08 04:58:20] [INFO ] Invariant cache hit.
[2023-03-08 04:58:20] [INFO ] [Real]Absence check using 127 positive place invariants in 77 ms returned sat
[2023-03-08 04:58:20] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-08 04:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:58:20] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-03-08 04:58:20] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-08 04:58:21] [INFO ] Added : 63 causal constraints over 13 iterations in 491 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1446 reset in 1222 ms.
Product exploration explored 100000 steps with 1481 reset in 1054 ms.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 21 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:58:23] [INFO ] Invariant cache hit.
[2023-03-08 04:58:23] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-08 04:58:23] [INFO ] Invariant cache hit.
[2023-03-08 04:58:24] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2023-03-08 04:58:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:58:24] [INFO ] Invariant cache hit.
[2023-03-08 04:58:24] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1052 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-11 finished in 11812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 330 /330 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 330 cols
[2023-03-08 04:58:24] [INFO ] Computed 139 place invariants in 5 ms
[2023-03-08 04:58:25] [INFO ] Implicit Places using invariants in 481 ms returned [6, 38, 41, 69, 93, 124, 291, 304, 312, 322]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 483 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/330 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 497 ms. Remains : 320/330 places, 192/192 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s69 1) (GEQ s279 1)), p1:(AND (GEQ s48 1) (GEQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 961 ms.
Product exploration explored 100000 steps with 0 reset in 865 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 248 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 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1)]
Support contains 2 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 320 transition count 131
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 259 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 258 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 124 place count 258 transition count 128
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 256 transition count 128
Applied a total of 128 rules in 18 ms. Remains 256 /320 variables (removed 64) and now considering 128/192 (removed 64) transitions.
// Phase 1: matrix 128 rows 256 cols
[2023-03-08 04:58:27] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 04:58:28] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-08 04:58:28] [INFO ] Invariant cache hit.
[2023-03-08 04:58:28] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2023-03-08 04:58:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:58:28] [INFO ] Invariant cache hit.
[2023-03-08 04:58:29] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/320 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1308 ms. Remains : 256/320 places, 128/192 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 p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 246 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 48 ms :[(NOT p1)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 199 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 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1018 ms.
Product exploration explored 100000 steps with 0 reset in 911 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 04:58:31] [INFO ] Invariant cache hit.
[2023-03-08 04:58:32] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-08 04:58:32] [INFO ] Invariant cache hit.
[2023-03-08 04:58:32] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2023-03-08 04:58:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:58:32] [INFO ] Invariant cache hit.
[2023-03-08 04:58:32] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1243 ms. Remains : 256/256 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-13 finished in 8349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G((G(p2)||p1))))'
Support contains 8 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 330 transition count 151
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 289 transition count 151
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 82 place count 289 transition count 139
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 106 place count 277 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 269 transition count 131
Applied a total of 122 rules in 24 ms. Remains 269 /330 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 269 cols
[2023-03-08 04:58:33] [INFO ] Computed 139 place invariants in 2 ms
[2023-03-08 04:58:33] [INFO ] Implicit Places using invariants in 459 ms returned [5, 34, 37, 59, 78, 103, 246, 253, 262]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 471 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/330 places, 131/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 129
Applied a total of 4 rules in 12 ms. Remains 258 /260 variables (removed 2) and now considering 129/131 (removed 2) transitions.
// Phase 1: matrix 129 rows 258 cols
[2023-03-08 04:58:33] [INFO ] Computed 130 place invariants in 2 ms
[2023-03-08 04:58:33] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-08 04:58:34] [INFO ] Invariant cache hit.
[2023-03-08 04:58:34] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/330 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1515 ms. Remains : 258/330 places, 129/192 transitions.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NOT (AND (GEQ s197 1) (GEQ s250 1))) (AND (GEQ s191 1) (GEQ s226 1))), p2:(AND (GEQ s20 1) (GEQ s235 1)), p0:(AND (GEQ s5 1) (GEQ s47 1) (GEQ s197...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 668 reset in 1166 ms.
Product exploration explored 100000 steps with 717 reset in 1024 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 p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (OR p1 p2)), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 1303 ms. Reduced automaton from 5 states, 19 edges and 3 AP (stutter insensitive) to 5 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 274 steps, including 0 resets, run visited all 9 properties in 23 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (OR p1 p2)), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p0), (F (AND (NOT p1) p2)), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 12 factoid took 1745 ms. Reduced automaton from 5 states, 19 edges and 3 AP (stutter insensitive) to 5 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:58:41] [INFO ] Invariant cache hit.
[2023-03-08 04:58:41] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-08 04:58:41] [INFO ] Invariant cache hit.
[2023-03-08 04:58:41] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2023-03-08 04:58:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:58:41] [INFO ] Invariant cache hit.
[2023-03-08 04:58:42] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1175 ms. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (OR p1 p2)), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 1319 ms. Reduced automaton from 5 states, 19 edges and 3 AP (stutter insensitive) to 5 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 166 steps, including 0 resets, run visited all 9 properties in 13 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (OR p1 p2)), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p0), (F (AND (NOT p1) p2)), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 12 factoid took 1768 ms. Reduced automaton from 5 states, 19 edges and 3 AP (stutter insensitive) to 5 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 720 reset in 1303 ms.
Product exploration explored 100000 steps with 686 reset in 1018 ms.
Support contains 8 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:58:48] [INFO ] Invariant cache hit.
[2023-03-08 04:58:49] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-08 04:58:49] [INFO ] Invariant cache hit.
[2023-03-08 04:58:49] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
[2023-03-08 04:58:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:58:49] [INFO ] Invariant cache hit.
[2023-03-08 04:58:50] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1297 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-15 finished in 17173 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)))'
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&&X(!p1))||G(!p1)))))'
Found a Shortening insensitive property : CircularTrains-PT-192-LTLFireability-01
Stuttering acceptance computed with spot in 162 ms :[p1, p1, p1]
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 330 transition count 147
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 285 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 284 transition count 146
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 92 place count 284 transition count 139
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 106 place count 277 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 122 place count 269 transition count 131
Applied a total of 122 rules in 33 ms. Remains 269 /330 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 269 cols
[2023-03-08 04:58:50] [INFO ] Computed 139 place invariants in 2 ms
[2023-03-08 04:58:51] [INFO ] Implicit Places using invariants in 469 ms returned [5, 34, 37, 60, 79, 104, 234, 246, 253]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 472 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 260/330 places, 131/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 129
Applied a total of 4 rules in 12 ms. Remains 258 /260 variables (removed 2) and now considering 129/131 (removed 2) transitions.
// Phase 1: matrix 129 rows 258 cols
[2023-03-08 04:58:51] [INFO ] Computed 130 place invariants in 2 ms
[2023-03-08 04:58:51] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-08 04:58:51] [INFO ] Invariant cache hit.
[2023-03-08 04:58:52] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 258/330 places, 129/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1524 ms. Remains : 258/330 places, 129/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s59 1) (GEQ s184 1)), p1:(AND (GEQ s38 1) (GEQ s251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 928 reset in 1478 ms.
Product exploration explored 100000 steps with 957 reset in 1047 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 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (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 (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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))))]
Knowledge based reduction with 2 factoid took 609 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p1, p1, p1]
Finished random walk after 229 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (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 (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 688 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1]
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:58:56] [INFO ] Invariant cache hit.
[2023-03-08 04:58:56] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-08 04:58:56] [INFO ] Invariant cache hit.
[2023-03-08 04:58:57] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2023-03-08 04:58:57] [INFO ] Invariant cache hit.
[2023-03-08 04:58:57] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1275 ms. Remains : 258/258 places, 129/129 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)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (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 (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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))))]
Knowledge based reduction with 2 factoid took 581 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p1]
Finished random walk after 226 steps, including 0 resets, run visited all 4 properties in 11 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (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 (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 788 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 185 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 169 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 923 reset in 1636 ms.
Product exploration explored 100000 steps with 951 reset in 1403 ms.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:59:03] [INFO ] Invariant cache hit.
[2023-03-08 04:59:03] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-08 04:59:03] [INFO ] Invariant cache hit.
[2023-03-08 04:59:04] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2023-03-08 04:59:04] [INFO ] Invariant cache hit.
[2023-03-08 04:59:04] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1349 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-01 finished in 14142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G((F(p0) U p1)))))'
Found a Lengthening insensitive property : CircularTrains-PT-192-LTLFireability-06
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 330 transition count 148
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 286 transition count 148
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 88 place count 286 transition count 139
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 106 place count 277 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 269 transition count 131
Applied a total of 122 rules in 27 ms. Remains 269 /330 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 269 cols
[2023-03-08 04:59:04] [INFO ] Computed 139 place invariants in 3 ms
[2023-03-08 04:59:05] [INFO ] Implicit Places using invariants in 470 ms returned [5, 34, 37, 59, 103, 234, 246, 253, 262]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 472 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 260/330 places, 131/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 260 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 259 transition count 130
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 4 place count 258 transition count 129
Applied a total of 4 rules in 18 ms. Remains 258 /260 variables (removed 2) and now considering 129/131 (removed 2) transitions.
// Phase 1: matrix 129 rows 258 cols
[2023-03-08 04:59:05] [INFO ] Computed 130 place invariants in 2 ms
[2023-03-08 04:59:05] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-08 04:59:05] [INFO ] Invariant cache hit.
[2023-03-08 04:59:06] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 258/330 places, 129/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1476 ms. Remains : 258/330 places, 129/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s55 1) (GEQ s141 1)), p1:(AND (GEQ s74 1) (GEQ s135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1493 reset in 1259 ms.
Product exploration explored 100000 steps with 1439 reset in 1498 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 395 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 134 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 456 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 04:59:10] [INFO ] Invariant cache hit.
[2023-03-08 04:59:10] [INFO ] [Real]Absence check using 127 positive place invariants in 79 ms returned sat
[2023-03-08 04:59:10] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-08 04:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:59:11] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2023-03-08 04:59:11] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-08 04:59:11] [INFO ] Added : 63 causal constraints over 13 iterations in 600 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:59:11] [INFO ] Invariant cache hit.
[2023-03-08 04:59:12] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-08 04:59:12] [INFO ] Invariant cache hit.
[2023-03-08 04:59:12] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2023-03-08 04:59:12] [INFO ] Invariant cache hit.
[2023-03-08 04:59:13] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1305 ms. Remains : 258/258 places, 129/129 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 p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 368 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 448 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 04:59:14] [INFO ] Invariant cache hit.
[2023-03-08 04:59:14] [INFO ] [Real]Absence check using 127 positive place invariants in 77 ms returned sat
[2023-03-08 04:59:14] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-08 04:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:59:15] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-08 04:59:15] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-08 04:59:16] [INFO ] Added : 63 causal constraints over 13 iterations in 557 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1449 reset in 1252 ms.
Product exploration explored 100000 steps with 1440 reset in 1021 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:59:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:59:18] [INFO ] Invariant cache hit.
[2023-03-08 04:59:19] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 258/258 places, 129/129 transitions.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 18 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:59:19] [INFO ] Invariant cache hit.
[2023-03-08 04:59:19] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-08 04:59:19] [INFO ] Invariant cache hit.
[2023-03-08 04:59:20] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2023-03-08 04:59:20] [INFO ] Invariant cache hit.
[2023-03-08 04:59:20] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1284 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 15837 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Found a Lengthening insensitive property : CircularTrains-PT-192-LTLFireability-13
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 330/330 places, 192/192 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 330 transition count 149
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 287 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 286 transition count 148
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 88 place count 286 transition count 138
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 108 place count 276 transition count 138
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 124 place count 268 transition count 130
Applied a total of 124 rules in 25 ms. Remains 268 /330 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 268 cols
[2023-03-08 04:59:20] [INFO ] Computed 139 place invariants in 3 ms
[2023-03-08 04:59:21] [INFO ] Implicit Places using invariants in 482 ms returned [5, 34, 37, 59, 78, 103, 233, 245, 252, 261]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 483 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 258/330 places, 130/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 256 transition count 128
Applied a total of 4 rules in 10 ms. Remains 256 /258 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 256 cols
[2023-03-08 04:59:21] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 04:59:21] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-08 04:59:21] [INFO ] Invariant cache hit.
[2023-03-08 04:59:22] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 256/330 places, 128/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1517 ms. Remains : 256/330 places, 128/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s59 1) (GEQ s220 1)), p1:(AND (GEQ s42 1) (GEQ s199 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1313 ms.
Product exploration explored 100000 steps with 0 reset in 1162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 242 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 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Support contains 2 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 04:59:25] [INFO ] Invariant cache hit.
[2023-03-08 04:59:25] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-08 04:59:25] [INFO ] Invariant cache hit.
[2023-03-08 04:59:26] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2023-03-08 04:59:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:59:26] [INFO ] Invariant cache hit.
[2023-03-08 04:59:26] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1240 ms. Remains : 256/256 places, 128/128 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 p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 171 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 32 ms :[(NOT p1)]
Finished random walk after 77 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 186 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 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1046 ms.
Product exploration explored 100000 steps with 0 reset in 1189 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 04:59:29] [INFO ] Invariant cache hit.
[2023-03-08 04:59:29] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-08 04:59:29] [INFO ] Invariant cache hit.
[2023-03-08 04:59:30] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2023-03-08 04:59:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:59:30] [INFO ] Invariant cache hit.
[2023-03-08 04:59:30] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1332 ms. Remains : 256/256 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-13 finished in 10388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G((G(p2)||p1))))'
[2023-03-08 04:59:31] [INFO ] Flatten gal took : 33 ms
[2023-03-08 04:59:31] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-08 04:59:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 330 places, 192 transitions and 660 arcs took 6 ms.
Total runtime 133584 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircularTrains-PT-192
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLFireability

FORMULA CircularTrains-PT-192-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CircularTrains-PT-192-LTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CircularTrains-PT-192-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251597754

--------------------
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/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:430
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: LAUNCH task # 7 (type EXCL) for 6 CircularTrains-PT-192-LTLFireability-06
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-11: F 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/600 7/32 CircularTrains-PT-192-LTLFireability-06 949542 m, 189908 m/sec, 1812287 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-11: F 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/600 15/32 CircularTrains-PT-192-LTLFireability-06 2018538 m, 213799 m/sec, 3914758 t fired, .

Time elapsed: 10 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-11: F 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/600 23/32 CircularTrains-PT-192-LTLFireability-06 3131144 m, 222521 m/sec, 6114767 t fired, .

Time elapsed: 15 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-11: F 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/600 30/32 CircularTrains-PT-192-LTLFireability-06 4049977 m, 183766 m/sec, 8236107 t fired, .

Time elapsed: 20 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 7 (type EXCL) for CircularTrains-PT-192-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-192-LTLFireability-11: F 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 13 (type EXCL) for 12 CircularTrains-PT-192-LTLFireability-13
lola: time limit : 715 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for CircularTrains-PT-192-LTLFireability-13
lola: result : false
lola: markings : 3138
lola: fired transitions : 3138
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CircularTrains-PT-192-LTLFireability-01
lola: time limit : 893 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CircularTrains-PT-192-LTLFireability-01
lola: result : false
lola: markings : 6230
lola: fired transitions : 6340
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 18 (type EXCL) for 9 CircularTrains-PT-192-LTLFireability-11
lola: time limit : 1191 sec
lola: memory limit: 32 pages
lola: FINISHED task # 18 (type EXCL) for CircularTrains-PT-192-LTLFireability-11
lola: result : false
lola: markings : 21496
lola: fired transitions : 21915
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 CircularTrains-PT-192-LTLFireability-00
lola: time limit : 1787 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CircularTrains-PT-192-LTLFireability-00
lola: result : false
lola: markings : 2161
lola: fired transitions : 2162
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 16 (type EXCL) for 15 CircularTrains-PT-192-LTLFireability-15
lola: time limit : 3575 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for CircularTrains-PT-192-LTLFireability-15
lola: result : false
lola: markings : 2418
lola: fired transitions : 2418
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 6

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-192-LTLFireability-00: LTL false LTL model checker
CircularTrains-PT-192-LTLFireability-01: LTL false LTL model checker
CircularTrains-PT-192-LTLFireability-06: LTL unknown AGGR
CircularTrains-PT-192-LTLFireability-11: F true state space / EG
CircularTrains-PT-192-LTLFireability-13: LTL false LTL model checker
CircularTrains-PT-192-LTLFireability-15: LTL false LTL model checker


Time elapsed: 25 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-192"
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-192, 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-167814397600180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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