Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 67M
-rw-r--r-- 1 mcc users 2.8M Apr 12 23:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8M Apr 12 23:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2M Apr 12 21:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 12 21:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.4M Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Apr 13 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Apr 13 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Apr 13 00:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 13 00:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 333K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 671K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.5M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-040-LTLFireability-00
FORMULA_NAME BART-PT-040-LTLFireability-01
FORMULA_NAME BART-PT-040-LTLFireability-02
FORMULA_NAME BART-PT-040-LTLFireability-03
FORMULA_NAME BART-PT-040-LTLFireability-04
FORMULA_NAME BART-PT-040-LTLFireability-05
FORMULA_NAME BART-PT-040-LTLFireability-06
FORMULA_NAME BART-PT-040-LTLFireability-07
FORMULA_NAME BART-PT-040-LTLFireability-08
FORMULA_NAME BART-PT-040-LTLFireability-09
FORMULA_NAME BART-PT-040-LTLFireability-10
FORMULA_NAME BART-PT-040-LTLFireability-11
FORMULA_NAME BART-PT-040-LTLFireability-12
FORMULA_NAME BART-PT-040-LTLFireability-13
FORMULA_NAME BART-PT-040-LTLFireability-14
FORMULA_NAME BART-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716349859262

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 03:51:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:51:03] [INFO ] Load time of PNML (sax parser for PT used): 914 ms
[2024-05-22 03:51:03] [INFO ] Transformed 5490 places.
[2024-05-22 03:51:03] [INFO ] Transformed 8080 transitions.
[2024-05-22 03:51:03] [INFO ] Found NUPN structural information;
[2024-05-22 03:51:03] [INFO ] Parsed PT model containing 5490 places and 8080 transitions and 64800 arcs in 1165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 204 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-040-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5280 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 83 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
// Phase 1: matrix 8080 rows 5280 cols
[2024-05-22 03:51:05] [INFO ] Computed 40 invariants in 110 ms
[2024-05-22 03:51:07] [INFO ] Implicit Places using invariants in 1804 ms returned []
[2024-05-22 03:51:07] [INFO ] Invariant cache hit.
[2024-05-22 03:51:08] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 3149 ms to find 0 implicit places.
[2024-05-22 03:51:08] [INFO ] Invariant cache hit.
[2024-05-22 03:51:10] [INFO ] Dead Transitions using invariants and state equation in 1314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4552 ms. Remains : 5280/5280 places, 8080/8080 transitions.
Support contains 5280 out of 5280 places after structural reductions.
[2024-05-22 03:51:11] [INFO ] Flatten gal took : 573 ms
[2024-05-22 03:51:12] [INFO ] Flatten gal took : 409 ms
[2024-05-22 03:51:14] [INFO ] Input system was already deterministic with 8080 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=10 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2062 ms. (steps per millisecond=4 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 03:51:17] [INFO ] Invariant cache hit.
[2024-05-22 03:51:19] [INFO ] [Real]Absence check using 40 positive place invariants in 111 ms returned sat
[2024-05-22 03:51:27] [INFO ] After 7030ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-22 03:51:30] [INFO ] After 9762ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1050 ms.
[2024-05-22 03:51:31] [INFO ] After 13522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 239 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=26 )
Parikh walk visited 3 properties in 23 ms.
FORMULA BART-PT-040-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((G(p1)||p0) U !p2))))'
Support contains 3880 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 284 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
[2024-05-22 03:51:32] [INFO ] Invariant cache hit.
[2024-05-22 03:51:33] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2024-05-22 03:51:33] [INFO ] Invariant cache hit.
[2024-05-22 03:51:34] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 2600 ms to find 0 implicit places.
[2024-05-22 03:51:34] [INFO ] Invariant cache hit.
[2024-05-22 03:51:36] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4102 ms. Remains : 5280/5280 places, 8080/8080 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 398 ms :[p2, p2, true, (NOT p1), p2]
Running random walk in product with property : BART-PT-040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s237 1) (EQ s621 1) (EQ s1494 1) (EQ s318 1) (EQ s518 1) (EQ s1480 1) (EQ s607 1) (EQ s1340 1) (EQ s1004 1) (EQ s1172 1) (EQ s208 1) (EQ s1033 ...], 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 0 reset in 2868 ms.
Product exploration explored 100000 steps with 0 reset in 2089 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (OR (NOT p2) p0 p1)), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0) p1))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (OR (NOT p2) p0 p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 268 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[p2, true, (NOT p1), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1375 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1373 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1339 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 03:53:10] [INFO ] Invariant cache hit.
[2024-05-22 03:53:18] [INFO ] After 1688ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (OR (NOT p2) p0 p1)), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0) p1))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (OR (NOT p2) p0 p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (G (OR p0 p1 (NOT p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (F p1), (F (OR (AND p0 p2) (AND p1 p2)))]
Knowledge based reduction with 12 factoid took 404 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[p2, p2]
Stuttering acceptance computed with spot in 98 ms :[p2, p2]
Support contains 360 out of 5280 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 : 5280/5280 places, 8080/8080 transitions.
Graph (trivial) has 1040 edges and 5280 vertex of which 240 / 5280 are part of one of the 40 SCC in 16 ms
Free SCC test removed 200 places
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 321 place count 5080 transition count 7560
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 1 with 320 rules applied. Total rules applied 641 place count 4760 transition count 7560
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 3 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 1601 place count 4280 transition count 7080
Applied a total of 1601 rules in 952 ms. Remains 4280 /5280 variables (removed 1000) and now considering 7080/8080 (removed 1000) transitions.
[2024-05-22 03:53:20] [INFO ] Flow matrix only has 7041 transitions (discarded 39 similar events)
// Phase 1: matrix 7041 rows 4280 cols
[2024-05-22 03:53:20] [INFO ] Computed 40 invariants in 36 ms
[2024-05-22 03:53:20] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-22 03:53:20] [INFO ] Flow matrix only has 7041 transitions (discarded 39 similar events)
[2024-05-22 03:53:20] [INFO ] Invariant cache hit.
[2024-05-22 03:53:21] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2024-05-22 03:53:22] [INFO ] Redundant transitions in 924 ms returned []
[2024-05-22 03:53:22] [INFO ] Flow matrix only has 7041 transitions (discarded 39 similar events)
[2024-05-22 03:53:22] [INFO ] Invariant cache hit.
[2024-05-22 03:53:23] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4280/5280 places, 7080/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4660 ms. Remains : 4280/5280 places, 7080/8080 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 p2), (X (NOT p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[p2, p2]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2)]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p2, p2]
Stuttering acceptance computed with spot in 78 ms :[p2, p2]
Stuttering acceptance computed with spot in 101 ms :[p2, p2]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 11 ms.
FORMULA BART-PT-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-00 finished in 114738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 3520 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Graph (trivial) has 1760 edges and 5280 vertex of which 240 / 5280 are part of one of the 40 SCC in 9 ms
Free SCC test removed 200 places
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 5080 transition count 7840
Reduce places removed 40 places and 0 transitions.
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Iterating post reduction 1 with 400 rules applied. Total rules applied 441 place count 5040 transition count 7480
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 2 with 360 rules applied. Total rules applied 801 place count 4680 transition count 7480
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 801 place count 4680 transition count 7400
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 961 place count 4600 transition count 7400
Discarding 200 places :
Symmetric choice reduction at 3 with 200 rule applications. Total rules 1161 place count 4400 transition count 7200
Iterating global reduction 3 with 200 rules applied. Total rules applied 1361 place count 4400 transition count 7200
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 1481 place count 4280 transition count 7080
Iterating global reduction 3 with 120 rules applied. Total rules applied 1601 place count 4280 transition count 7080
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 1721 place count 4160 transition count 6960
Iterating global reduction 3 with 120 rules applied. Total rules applied 1841 place count 4160 transition count 6960
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 1961 place count 4040 transition count 6840
Iterating global reduction 3 with 120 rules applied. Total rules applied 2081 place count 4040 transition count 6840
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 2161 place count 3960 transition count 6760
Iterating global reduction 3 with 80 rules applied. Total rules applied 2241 place count 3960 transition count 6760
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 2321 place count 3880 transition count 6680
Iterating global reduction 3 with 80 rules applied. Total rules applied 2401 place count 3880 transition count 6680
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2441 place count 3840 transition count 6640
Iterating global reduction 3 with 40 rules applied. Total rules applied 2481 place count 3840 transition count 6640
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 1 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 3 with 560 rules applied. Total rules applied 3041 place count 3560 transition count 6360
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 3081 place count 3560 transition count 6320
Applied a total of 3081 rules in 1320 ms. Remains 3560 /5280 variables (removed 1720) and now considering 6320/8080 (removed 1760) transitions.
[2024-05-22 03:53:28] [INFO ] Flow matrix only has 6281 transitions (discarded 39 similar events)
// Phase 1: matrix 6281 rows 3560 cols
[2024-05-22 03:53:28] [INFO ] Computed 40 invariants in 38 ms
[2024-05-22 03:53:28] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-22 03:53:28] [INFO ] Flow matrix only has 6281 transitions (discarded 39 similar events)
[2024-05-22 03:53:28] [INFO ] Invariant cache hit.
[2024-05-22 03:53:29] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2024-05-22 03:53:29] [INFO ] Redundant transitions in 635 ms returned []
[2024-05-22 03:53:29] [INFO ] Flow matrix only has 6281 transitions (discarded 39 similar events)
[2024-05-22 03:53:29] [INFO ] Invariant cache hit.
[2024-05-22 03:53:35] [INFO ] Dead Transitions using invariants and state equation in 5096 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3560/5280 places, 6320/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8279 ms. Remains : 3560/5280 places, 6320/8080 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : BART-PT-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s298 1) (EQ s2789 1) (EQ s2439 1) (EQ s3512 1) (EQ s3042 1) (EQ s3416 1) (EQ s374 1) (EQ s2956 1) (EQ s1760 1) (EQ s840 1) (EQ s425 1) (EQ s117...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-01 finished in 8371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 360 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 920 places :
Symmetric choice reduction at 0 with 920 rule applications. Total rules 920 place count 4360 transition count 7160
Iterating global reduction 0 with 920 rules applied. Total rules applied 1840 place count 4360 transition count 7160
Discarding 760 places :
Symmetric choice reduction at 0 with 760 rule applications. Total rules 2600 place count 3600 transition count 6400
Iterating global reduction 0 with 760 rules applied. Total rules applied 3360 place count 3600 transition count 6400
Applied a total of 3360 rules in 1372 ms. Remains 3600 /5280 variables (removed 1680) and now considering 6400/8080 (removed 1680) transitions.
// Phase 1: matrix 6400 rows 3600 cols
[2024-05-22 03:53:36] [INFO ] Computed 40 invariants in 46 ms
[2024-05-22 03:53:37] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-22 03:53:37] [INFO ] Invariant cache hit.
[2024-05-22 03:53:37] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2024-05-22 03:53:37] [INFO ] Invariant cache hit.
[2024-05-22 03:53:43] [INFO ] Dead Transitions using invariants and state equation in 5490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3600/5280 places, 6400/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8192 ms. Remains : 3600/5280 places, 6400/8080 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s237 0) (EQ s621 0) (EQ s1334 0) (EQ s318 0) (EQ s518 0) (EQ s1320 0) (EQ s607 0) (EQ s1220 0) (EQ s964 0) (EQ s1092 0) (EQ s208 0) (EQ s993 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 6 ms.
FORMULA BART-PT-040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-02 finished in 8341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)&&X((G(p2)&&(p3 U p0)))))))'
Support contains 5200 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 14 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
// Phase 1: matrix 8080 rows 5280 cols
[2024-05-22 03:53:43] [INFO ] Computed 40 invariants in 32 ms
[2024-05-22 03:53:44] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2024-05-22 03:53:44] [INFO ] Invariant cache hit.
[2024-05-22 03:53:45] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
[2024-05-22 03:53:45] [INFO ] Invariant cache hit.
[2024-05-22 03:53:46] [INFO ] Dead Transitions using invariants and state equation in 1196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3526 ms. Remains : 5280/5280 places, 8080/8080 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BART-PT-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s330 1) (EQ s524 1) (EQ s4724 1) (EQ s1970 1) (EQ s2768 1) (EQ s3566 1) (EQ s4364 1) (EQ s1306 1) (EQ s539 1) (EQ s2327 1) (EQ s2783 1) (EQ s43...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-03 finished in 3949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 3120 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Performed 920 Post agglomeration using F-continuation condition.Transition count delta: 920
Iterating post reduction 0 with 920 rules applied. Total rules applied 920 place count 5280 transition count 7160
Reduce places removed 920 places and 0 transitions.
Iterating post reduction 1 with 920 rules applied. Total rules applied 1840 place count 4360 transition count 7160
Applied a total of 1840 rules in 547 ms. Remains 4360 /5280 variables (removed 920) and now considering 7160/8080 (removed 920) transitions.
// Phase 1: matrix 7160 rows 4360 cols
[2024-05-22 03:53:48] [INFO ] Computed 40 invariants in 49 ms
[2024-05-22 03:53:48] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-05-22 03:53:48] [INFO ] Invariant cache hit.
[2024-05-22 03:53:49] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
[2024-05-22 03:53:50] [INFO ] Redundant transitions in 1078 ms returned []
[2024-05-22 03:53:50] [INFO ] Invariant cache hit.
[2024-05-22 03:53:51] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4360/5280 places, 7160/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4435 ms. Remains : 4360/5280 places, 7160/8080 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : BART-PT-040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s65 1) (EQ s64 1) (EQ s67 1) (EQ s66 1) (EQ s69 1) (EQ s68 1) (EQ s71 1) (EQ s70 1) (EQ s73 1) (EQ s72 1) (EQ s75 1) (EQ s74 1) (EQ s77 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 633 reset in 6513 ms.
Product exploration explored 100000 steps with 657 reset in 6312 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))))]
False Knowledge obtained : [(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)))))]
Knowledge based reduction with 9 factoid took 270 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Finished random walk after 46 steps, including 0 resets, run visited all 5 properties in 19 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))))]
False Knowledge obtained : [(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))))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND p1 (NOT p2) p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))]
Knowledge based reduction with 9 factoid took 597 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-05-22 03:58:23] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-22 03:58:38] [INFO ] Invariant cache hit.
[2024-05-22 03:58:45] [INFO ] [Real]Absence check using 40 positive place invariants in 56 ms returned sat
[2024-05-22 03:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 03:58:49] [INFO ] [Real]Absence check using state equation in 4331 ms returned sat
[2024-05-22 03:58:50] [INFO ] Computed and/alt/rep : 5720/9880/5720 causal constraints (skipped 0 transitions) in 559 ms.
[2024-05-22 03:58:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:58:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 45 ms returned sat
[2024-05-22 03:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 03:59:03] [INFO ] [Nat]Absence check using state equation in 4103 ms returned sat
[2024-05-22 03:59:04] [INFO ] Computed and/alt/rep : 5720/9880/5720 causal constraints (skipped 0 transitions) in 610 ms.
[2024-05-22 03:59:13] [INFO ] Deduced a trap composed of 109 places in 5868 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-22 03:59:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 3120 out of 4360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4360/4360 places, 7160/7160 transitions.
Applied a total of 0 rules in 98 ms. Remains 4360 /4360 variables (removed 0) and now considering 7160/7160 (removed 0) transitions.
[2024-05-22 03:59:13] [INFO ] Invariant cache hit.
[2024-05-22 03:59:14] [INFO ] Implicit Places using invariants in 1111 ms returned []
[2024-05-22 03:59:14] [INFO ] Invariant cache hit.
[2024-05-22 03:59:15] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2024-05-22 03:59:16] [INFO ] Redundant transitions in 827 ms returned []
[2024-05-22 03:59:16] [INFO ] Invariant cache hit.
[2024-05-22 03:59:17] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4195 ms. Remains : 4360/4360 places, 7160/7160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 309 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Finished random walk after 49 steps, including 0 resets, run visited all 5 properties in 19 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND p1 (NOT p2) p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))]
Knowledge based reduction with 9 factoid took 764 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-05-22 04:00:58] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-22 04:01:13] [INFO ] Invariant cache hit.
[2024-05-22 04:01:20] [INFO ] [Real]Absence check using 40 positive place invariants in 55 ms returned sat
[2024-05-22 04:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 04:01:24] [INFO ] [Real]Absence check using state equation in 4552 ms returned sat
[2024-05-22 04:01:26] [INFO ] Computed and/alt/rep : 5720/9880/5720 causal constraints (skipped 0 transitions) in 592 ms.
[2024-05-22 04:01:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 04:01:33] [INFO ] [Nat]Absence check using 40 positive place invariants in 44 ms returned sat
[2024-05-22 04:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 04:01:38] [INFO ] [Nat]Absence check using state equation in 4253 ms returned sat
[2024-05-22 04:01:39] [INFO ] Computed and/alt/rep : 5720/9880/5720 causal constraints (skipped 0 transitions) in 438 ms.
[2024-05-22 04:01:49] [INFO ] Deduced a trap composed of 109 places in 6966 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-22 04:01:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 656 reset in 5185 ms.
Product exploration explored 100000 steps with 640 reset in 5215 ms.
Built C files in :
/tmp/ltsmin5806116785601906982
[2024-05-22 04:02:00] [INFO ] Too many transitions (7160) to apply POR reductions. Disabling POR matrices.
[2024-05-22 04:02:00] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5806116785601906982
Running compilation step : cd /tmp/ltsmin5806116785601906982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5806116785601906982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5806116785601906982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3120 out of 4360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4360/4360 places, 7160/7160 transitions.
Applied a total of 0 rules in 195 ms. Remains 4360 /4360 variables (removed 0) and now considering 7160/7160 (removed 0) transitions.
[2024-05-22 04:02:03] [INFO ] Invariant cache hit.
[2024-05-22 04:02:04] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2024-05-22 04:02:04] [INFO ] Invariant cache hit.
[2024-05-22 04:02:05] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 2118 ms to find 0 implicit places.
[2024-05-22 04:02:06] [INFO ] Redundant transitions in 1025 ms returned []
[2024-05-22 04:02:06] [INFO ] Invariant cache hit.
[2024-05-22 04:02:07] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4441 ms. Remains : 4360/4360 places, 7160/7160 transitions.
Built C files in :
/tmp/ltsmin17948270764120450157
[2024-05-22 04:02:07] [INFO ] Too many transitions (7160) to apply POR reductions. Disabling POR matrices.
[2024-05-22 04:02:07] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17948270764120450157
Running compilation step : cd /tmp/ltsmin17948270764120450157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17948270764120450157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17948270764120450157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 04:02:11] [INFO ] Flatten gal took : 212 ms
[2024-05-22 04:02:11] [INFO ] Flatten gal took : 191 ms
[2024-05-22 04:02:11] [INFO ] Time to serialize gal into /tmp/LTL17383084617311913216.gal : 55 ms
[2024-05-22 04:02:11] [INFO ] Time to serialize properties into /tmp/LTL3664863008984136541.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17383084617311913216.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1880346401486852827.hoa' '-atoms' '/tmp/LTL3664863008984136541.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3664863008984136541.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1880346401486852827.hoa
Detected timeout of ITS tools.
[2024-05-22 04:02:27] [INFO ] Flatten gal took : 156 ms
[2024-05-22 04:02:27] [INFO ] Flatten gal took : 151 ms
[2024-05-22 04:02:27] [INFO ] Time to serialize gal into /tmp/LTL9351598547085572727.gal : 33 ms
[2024-05-22 04:02:27] [INFO ] Time to serialize properties into /tmp/LTL14282898023324060254.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9351598547085572727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14282898023324060254.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((TrainState_38_2_4==1)||(TrainState_22_3_8==1))||((TrainState_15_4_14==1)||(TrainState_39_2_5==1)))||(((TrainState_...82855
Formula 0 simplified : GF(!"(((((((((((((TrainState_11_1_6==1)||(TrainState_5_1_8==1))||((TrainState_5_1_35==1)||(TrainState_11_4_17==1)))||(((TrainState_9...82850
Detected timeout of ITS tools.
[2024-05-22 04:02:42] [INFO ] Flatten gal took : 138 ms
[2024-05-22 04:02:42] [INFO ] Applying decomposition
[2024-05-22 04:02:43] [INFO ] Flatten gal took : 166 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8874419785109185447.txt' '-o' '/tmp/graph8874419785109185447.bin' '-w' '/tmp/graph8874419785109185447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8874419785109185447.bin' '-l' '-1' '-v' '-w' '/tmp/graph8874419785109185447.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:02:43] [INFO ] Decomposing Gal with order
[2024-05-22 04:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:02:46] [INFO ] Removed a total of 464 redundant transitions.
[2024-05-22 04:02:46] [INFO ] Flatten gal took : 573 ms
[2024-05-22 04:02:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 44 ms.
[2024-05-22 04:02:47] [INFO ] Time to serialize gal into /tmp/LTL1104773428814598368.gal : 64 ms
[2024-05-22 04:02:47] [INFO ] Time to serialize properties into /tmp/LTL4494942243636414181.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1104773428814598368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4494942243636414181.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((i13.u37.TrainState_38_2_4==1)||(i5.u245.TrainState_22_3_8==1))||((i3.i1.u632.TrainState_15_4_14==1)||(i22.i0.u51.T...113573
Formula 0 simplified : GF(!"(((((((((((((i32.u407.TrainState_11_1_6==1)||(i18.u83.TrainState_5_1_8==1))||((i18.u83.TrainState_5_1_35==1)||(i32.u739.TrainSt...113568
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1122 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.247,231128,1,0,341781,14253,40805,1.13251e+06,2515,32757,763953
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-LTLFireability-05 finished in 553931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4840 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 5280 transition count 8000
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 5200 transition count 8000
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 3 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 480 place count 5040 transition count 7840
Applied a total of 480 rules in 265 ms. Remains 5040 /5280 variables (removed 240) and now considering 7840/8080 (removed 240) transitions.
// Phase 1: matrix 7840 rows 5040 cols
[2024-05-22 04:03:01] [INFO ] Computed 40 invariants in 48 ms
[2024-05-22 04:03:03] [INFO ] Implicit Places using invariants in 1452 ms returned []
[2024-05-22 04:03:03] [INFO ] Invariant cache hit.
[2024-05-22 04:03:04] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2024-05-22 04:03:05] [INFO ] Redundant transitions in 1421 ms returned []
[2024-05-22 04:03:05] [INFO ] Invariant cache hit.
[2024-05-22 04:03:06] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5040/5280 places, 7840/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5641 ms. Remains : 5040/5280 places, 7840/8080 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s778 1) (EQ s4189 1) (EQ s3719 1) (EQ s4992 1) (EQ s4522 1) (EQ s4896 1) (EQ s894 1) (EQ s4396 1) (EQ s2800 1) (EQ s1600 1) (EQ s945 1) (EQ s20...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2806 ms.
Product exploration explored 100000 steps with 0 reset in 2570 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Finished Best-First random walk after 1441 steps, including 0 resets, run visited all 1 properties in 464 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Support contains 4840 out of 5040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5040/5040 places, 7840/7840 transitions.
Applied a total of 0 rules in 43 ms. Remains 5040 /5040 variables (removed 0) and now considering 7840/7840 (removed 0) transitions.
[2024-05-22 04:03:16] [INFO ] Invariant cache hit.
[2024-05-22 04:03:17] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2024-05-22 04:03:17] [INFO ] Invariant cache hit.
[2024-05-22 04:03:18] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
[2024-05-22 04:03:19] [INFO ] Redundant transitions in 1186 ms returned []
[2024-05-22 04:03:19] [INFO ] Invariant cache hit.
[2024-05-22 04:03:20] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4723 ms. Remains : 5040/5040 places, 7840/7840 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Finished Best-First random walk after 1441 steps, including 0 resets, run visited all 1 properties in 482 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 264 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2676 ms.
Product exploration explored 100000 steps with 0 reset in 2620 ms.
Built C files in :
/tmp/ltsmin12261846752273352588
[2024-05-22 04:03:29] [INFO ] Too many transitions (7840) to apply POR reductions. Disabling POR matrices.
[2024-05-22 04:03:29] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12261846752273352588
Running compilation step : cd /tmp/ltsmin12261846752273352588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12261846752273352588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12261846752273352588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4840 out of 5040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5040/5040 places, 7840/7840 transitions.
Applied a total of 0 rules in 37 ms. Remains 5040 /5040 variables (removed 0) and now considering 7840/7840 (removed 0) transitions.
[2024-05-22 04:03:33] [INFO ] Invariant cache hit.
[2024-05-22 04:03:34] [INFO ] Implicit Places using invariants in 992 ms returned []
[2024-05-22 04:03:34] [INFO ] Invariant cache hit.
[2024-05-22 04:03:34] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2024-05-22 04:03:35] [INFO ] Redundant transitions in 989 ms returned []
[2024-05-22 04:03:35] [INFO ] Invariant cache hit.
[2024-05-22 04:03:37] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4121 ms. Remains : 5040/5040 places, 7840/7840 transitions.
Built C files in :
/tmp/ltsmin4913694197702702667
[2024-05-22 04:03:37] [INFO ] Too many transitions (7840) to apply POR reductions. Disabling POR matrices.
[2024-05-22 04:03:37] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4913694197702702667
Running compilation step : cd /tmp/ltsmin4913694197702702667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4913694197702702667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4913694197702702667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 04:03:40] [INFO ] Flatten gal took : 168 ms
[2024-05-22 04:03:40] [INFO ] Flatten gal took : 228 ms
[2024-05-22 04:03:40] [INFO ] Time to serialize gal into /tmp/LTL5150900244939424310.gal : 40 ms
[2024-05-22 04:03:40] [INFO ] Time to serialize properties into /tmp/LTL2034816034838972576.prop : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5150900244939424310.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9898636884272525839.hoa' '-atoms' '/tmp/LTL2034816034838972576.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2034816034838972576.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9898636884272525839.hoa
Detected timeout of ITS tools.
[2024-05-22 04:03:56] [INFO ] Flatten gal took : 237 ms
[2024-05-22 04:03:56] [INFO ] Flatten gal took : 217 ms
[2024-05-22 04:03:56] [INFO ] Time to serialize gal into /tmp/LTL8994611522476387677.gal : 27 ms
[2024-05-22 04:03:56] [INFO ] Time to serialize properties into /tmp/LTL4516044890487227643.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8994611522476387677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4516044890487227643.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((((TrainState_19_1_11==1)||(TrainState_30_1_33==1))||((TrainState_40_1_30==1)||(TrainState_33_2_39==1)))||(((TrainSt...166466
Formula 0 simplified : FG!"(((((((((((((TrainState_19_1_11==1)||(TrainState_30_1_33==1))||((TrainState_40_1_30==1)||(TrainState_33_2_39==1)))||(((TrainStat...166460
Detected timeout of ITS tools.
[2024-05-22 04:04:11] [INFO ] Flatten gal took : 145 ms
[2024-05-22 04:04:11] [INFO ] Applying decomposition
[2024-05-22 04:04:12] [INFO ] Flatten gal took : 157 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8114108705193150101.txt' '-o' '/tmp/graph8114108705193150101.bin' '-w' '/tmp/graph8114108705193150101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8114108705193150101.bin' '-l' '-1' '-v' '-w' '/tmp/graph8114108705193150101.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:04:12] [INFO ] Decomposing Gal with order
[2024-05-22 04:04:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:04:14] [INFO ] Removed a total of 964 redundant transitions.
[2024-05-22 04:04:14] [INFO ] Flatten gal took : 342 ms
[2024-05-22 04:04:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 28 ms.
[2024-05-22 04:04:18] [INFO ] Time to serialize gal into /tmp/LTL14262396760326224787.gal : 47 ms
[2024-05-22 04:04:18] [INFO ] Time to serialize properties into /tmp/LTL9919160358046022803.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14262396760326224787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9919160358046022803.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((((i12.i0.u351.TrainState_19_1_11==1)||(i37.i0.u1483.TrainState_30_1_33==1))||((i9.i0.u83.TrainState_40_1_30==1)||(i...240289
Formula 0 simplified : FG!"(((((((((((((i12.i0.u351.TrainState_19_1_11==1)||(i37.i0.u1483.TrainState_30_1_33==1))||((i9.i0.u83.TrainState_40_1_30==1)||(i35...240283
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13020521225965470862
[2024-05-22 04:04:33] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13020521225965470862
Running compilation step : cd /tmp/ltsmin13020521225965470862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13020521225965470862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13020521225965470862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BART-PT-040-LTLFireability-06 finished in 95005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U X(G(p2))))))'
Support contains 3920 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 85 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
// Phase 1: matrix 8080 rows 5280 cols
[2024-05-22 04:04:36] [INFO ] Computed 40 invariants in 36 ms
[2024-05-22 04:04:37] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2024-05-22 04:04:37] [INFO ] Invariant cache hit.
[2024-05-22 04:04:38] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2024-05-22 04:04:38] [INFO ] Invariant cache hit.
[2024-05-22 04:04:39] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3596 ms. Remains : 5280/5280 places, 8080/8080 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s237 1) (EQ s621 1) (EQ s1494 1) (EQ s318 1) (EQ s518 1) (EQ s1480 1) (EQ s607 1) (EQ s1340 1) (EQ s1004 1) (EQ s1172 1) (EQ s208 1) (EQ s1033 ...], 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 timeout after 31140 steps with 0 reset in 10003 ms.
Product exploration timeout after 32020 steps with 0 reset in 10005 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 (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))))]
Knowledge based reduction with 14 factoid took 1499 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 996 ms. (steps per millisecond=10 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2645 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1260 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2280 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 04:09:47] [INFO ] Invariant cache hit.
[2024-05-22 04:09:55] [INFO ] [Real]Absence check using 40 positive place invariants in 95 ms returned sat
[2024-05-22 04:09:55] [INFO ] After 2327ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-22 04:09:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 89 ms returned sat
[2024-05-22 04:10:03] [INFO ] After 5918ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-22 04:10:04] [INFO ] After 6803ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 456 ms.
[2024-05-22 04:10:04] [INFO ] After 8995ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 495 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 24 ms.
Support contains 3880 out of 5280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Graph (trivial) has 1040 edges and 5280 vertex of which 240 / 5280 are part of one of the 40 SCC in 2 ms
Free SCC test removed 200 places
Drop transitions removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 321 place count 5080 transition count 7520
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 1 with 320 rules applied. Total rules applied 641 place count 4760 transition count 7520
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 1 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 1601 place count 4280 transition count 7040
Drop transitions removed 1400 transitions
Redundant transition composition rules discarded 1400 transitions
Iterating global reduction 2 with 1400 rules applied. Total rules applied 3001 place count 4280 transition count 5640
Applied a total of 3001 rules in 639 ms. Remains 4280 /5280 variables (removed 1000) and now considering 5640/8080 (removed 2440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 639 ms. Remains : 4280/5280 places, 5640/8080 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Finished Best-First random walk after 290 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (F (AND (NOT p1) p2)), (F (AND p1 p0 (NOT p2))), (F (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p0 p2)), (F (AND (NOT p1) p0 (NOT p2))), (F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0 (NOT p2)))
Knowledge based reduction with 15 factoid took 2399 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-040-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-07 finished in 331704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p1)||(p2 U (p3||G(p2))))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 4879 place count 2761 transition count 5561
Iterating global reduction 0 with 159 rules applied. Total rules applied 5038 place count 2761 transition count 5561
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5158 place count 2641 transition count 5441
Iterating global reduction 0 with 120 rules applied. Total rules applied 5278 place count 2641 transition count 5441
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5398 place count 2521 transition count 5321
Iterating global reduction 0 with 120 rules applied. Total rules applied 5518 place count 2521 transition count 5321
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5638 place count 2401 transition count 5201
Iterating global reduction 0 with 120 rules applied. Total rules applied 5758 place count 2401 transition count 5201
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5878 place count 2281 transition count 5081
Iterating global reduction 0 with 120 rules applied. Total rules applied 5998 place count 2281 transition count 5081
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6118 place count 2161 transition count 4961
Iterating global reduction 0 with 120 rules applied. Total rules applied 6238 place count 2161 transition count 4961
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6318 place count 2081 transition count 4881
Iterating global reduction 0 with 80 rules applied. Total rules applied 6398 place count 2081 transition count 4881
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6478 place count 2001 transition count 4801
Iterating global reduction 0 with 80 rules applied. Total rules applied 6558 place count 2001 transition count 4801
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6598 place count 1961 transition count 4761
Iterating global reduction 0 with 40 rules applied. Total rules applied 6638 place count 1961 transition count 4761
Applied a total of 6638 rules in 3295 ms. Remains 1961 /5280 variables (removed 3319) and now considering 4761/8080 (removed 3319) transitions.
// Phase 1: matrix 4761 rows 1961 cols
[2024-05-22 04:10:11] [INFO ] Computed 40 invariants in 23 ms
[2024-05-22 04:10:11] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-22 04:10:11] [INFO ] Invariant cache hit.
[2024-05-22 04:10:12] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
[2024-05-22 04:10:12] [INFO ] Invariant cache hit.
[2024-05-22 04:10:17] [INFO ] Dead Transitions using invariants and state equation in 4542 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1961/5280 places, 4761/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9337 ms. Remains : 1961/5280 places, 4761/8080 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1)), true, (AND (NOT p3) (NOT p2))]
Running random walk in product with property : BART-PT-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s794 1), p3:(AND (NEQ s53 1) (NEQ s746 1)), p2:(NEQ s746 1), p1:(EQ s794 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 1125 ms.
Product exploration explored 100000 steps with 6 reset in 866 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) p3 p2 p1), (X p1), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 272 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 298765 steps, run visited all 1 properties in 1031 ms. (steps per millisecond=289 )
Probabilistic random walk after 298765 steps, saw 298327 distinct states, run finished after 1031 ms. (steps per millisecond=289 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p3 p2 p1), (X p1), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 7 factoid took 274 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2024-05-22 04:10:24] [INFO ] Invariant cache hit.
[2024-05-22 04:10:27] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p3 p2 p1), (X p1), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-040-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-10 finished in 19576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(G(p1)) U G((!p1 U X(p2))))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1278 places :
Symmetric choice reduction at 0 with 1278 rule applications. Total rules 1278 place count 4002 transition count 6802
Iterating global reduction 0 with 1278 rules applied. Total rules applied 2556 place count 4002 transition count 6802
Discarding 1078 places :
Symmetric choice reduction at 0 with 1078 rule applications. Total rules 3634 place count 2924 transition count 5724
Iterating global reduction 0 with 1078 rules applied. Total rules applied 4712 place count 2924 transition count 5724
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4872 place count 2764 transition count 5564
Iterating global reduction 0 with 160 rules applied. Total rules applied 5032 place count 2764 transition count 5564
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5150 place count 2646 transition count 5446
Iterating global reduction 0 with 118 rules applied. Total rules applied 5268 place count 2646 transition count 5446
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5386 place count 2528 transition count 5328
Iterating global reduction 0 with 118 rules applied. Total rules applied 5504 place count 2528 transition count 5328
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5622 place count 2410 transition count 5210
Iterating global reduction 0 with 118 rules applied. Total rules applied 5740 place count 2410 transition count 5210
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5858 place count 2292 transition count 5092
Iterating global reduction 0 with 118 rules applied. Total rules applied 5976 place count 2292 transition count 5092
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 6094 place count 2174 transition count 4974
Iterating global reduction 0 with 118 rules applied. Total rules applied 6212 place count 2174 transition count 4974
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6292 place count 2094 transition count 4894
Iterating global reduction 0 with 80 rules applied. Total rules applied 6372 place count 2094 transition count 4894
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 6450 place count 2016 transition count 4816
Iterating global reduction 0 with 78 rules applied. Total rules applied 6528 place count 2016 transition count 4816
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6568 place count 1976 transition count 4776
Iterating global reduction 0 with 40 rules applied. Total rules applied 6608 place count 1976 transition count 4776
Applied a total of 6608 rules in 2500 ms. Remains 1976 /5280 variables (removed 3304) and now considering 4776/8080 (removed 3304) transitions.
// Phase 1: matrix 4776 rows 1976 cols
[2024-05-22 04:10:30] [INFO ] Computed 40 invariants in 12 ms
[2024-05-22 04:10:30] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-22 04:10:30] [INFO ] Invariant cache hit.
[2024-05-22 04:10:31] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2024-05-22 04:10:31] [INFO ] Invariant cache hit.
[2024-05-22 04:10:35] [INFO ] Dead Transitions using invariants and state equation in 4002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1976/5280 places, 4776/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8159 ms. Remains : 1976/5280 places, 4776/8080 transitions.
Stuttering acceptance computed with spot in 511 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, (AND (NOT p1) p2)]
Running random walk in product with property : BART-PT-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 7}, { cond=(NOT p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 11}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=p1, acceptance={} source=8 dest: 8}, { cond=p1, acceptance={} source=8 dest: 9}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 10}, { cond=(AND p1 p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(EQ s680 1), p1:(NEQ s474 1), p2:(EQ s681 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5890 steps with 714 reset in 702 ms.
FORMULA BART-PT-040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-11 finished in 9419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||F(p2)))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1278 places :
Symmetric choice reduction at 0 with 1278 rule applications. Total rules 1278 place count 4002 transition count 6802
Iterating global reduction 0 with 1278 rules applied. Total rules applied 2556 place count 4002 transition count 6802
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 3633 place count 2925 transition count 5725
Iterating global reduction 0 with 1077 rules applied. Total rules applied 4710 place count 2925 transition count 5725
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4870 place count 2765 transition count 5565
Iterating global reduction 0 with 160 rules applied. Total rules applied 5030 place count 2765 transition count 5565
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5150 place count 2645 transition count 5445
Iterating global reduction 0 with 120 rules applied. Total rules applied 5270 place count 2645 transition count 5445
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5390 place count 2525 transition count 5325
Iterating global reduction 0 with 120 rules applied. Total rules applied 5510 place count 2525 transition count 5325
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5630 place count 2405 transition count 5205
Iterating global reduction 0 with 120 rules applied. Total rules applied 5750 place count 2405 transition count 5205
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5870 place count 2285 transition count 5085
Iterating global reduction 0 with 120 rules applied. Total rules applied 5990 place count 2285 transition count 5085
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6110 place count 2165 transition count 4965
Iterating global reduction 0 with 120 rules applied. Total rules applied 6230 place count 2165 transition count 4965
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6310 place count 2085 transition count 4885
Iterating global reduction 0 with 80 rules applied. Total rules applied 6390 place count 2085 transition count 4885
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6470 place count 2005 transition count 4805
Iterating global reduction 0 with 80 rules applied. Total rules applied 6550 place count 2005 transition count 4805
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6590 place count 1965 transition count 4765
Iterating global reduction 0 with 40 rules applied. Total rules applied 6630 place count 1965 transition count 4765
Applied a total of 6630 rules in 2437 ms. Remains 1965 /5280 variables (removed 3315) and now considering 4765/8080 (removed 3315) transitions.
// Phase 1: matrix 4765 rows 1965 cols
[2024-05-22 04:10:39] [INFO ] Computed 40 invariants in 13 ms
[2024-05-22 04:10:39] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-22 04:10:39] [INFO ] Invariant cache hit.
[2024-05-22 04:10:40] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2024-05-22 04:10:40] [INFO ] Invariant cache hit.
[2024-05-22 04:10:45] [INFO ] Dead Transitions using invariants and state equation in 4613 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1965/5280 places, 4765/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8050 ms. Remains : 1965/5280 places, 4765/8080 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BART-PT-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(EQ s560 0), p1:(EQ s1284 0), p0:(EQ s802 0)], 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 50000 reset in 6596 ms.
Product exploration explored 100000 steps with 50000 reset in 6740 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 p2 p1 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-040-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-12 finished in 24634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 2 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1279 places :
Symmetric choice reduction at 0 with 1279 rule applications. Total rules 1279 place count 4001 transition count 6801
Iterating global reduction 0 with 1279 rules applied. Total rules applied 2558 place count 4001 transition count 6801
Discarding 1079 places :
Symmetric choice reduction at 0 with 1079 rule applications. Total rules 3637 place count 2922 transition count 5722
Iterating global reduction 0 with 1079 rules applied. Total rules applied 4716 place count 2922 transition count 5722
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4876 place count 2762 transition count 5562
Iterating global reduction 0 with 160 rules applied. Total rules applied 5036 place count 2762 transition count 5562
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5156 place count 2642 transition count 5442
Iterating global reduction 0 with 120 rules applied. Total rules applied 5276 place count 2642 transition count 5442
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5395 place count 2523 transition count 5323
Iterating global reduction 0 with 119 rules applied. Total rules applied 5514 place count 2523 transition count 5323
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5633 place count 2404 transition count 5204
Iterating global reduction 0 with 119 rules applied. Total rules applied 5752 place count 2404 transition count 5204
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5871 place count 2285 transition count 5085
Iterating global reduction 0 with 119 rules applied. Total rules applied 5990 place count 2285 transition count 5085
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6109 place count 2166 transition count 4966
Iterating global reduction 0 with 119 rules applied. Total rules applied 6228 place count 2166 transition count 4966
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6307 place count 2087 transition count 4887
Iterating global reduction 0 with 79 rules applied. Total rules applied 6386 place count 2087 transition count 4887
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6465 place count 2008 transition count 4808
Iterating global reduction 0 with 79 rules applied. Total rules applied 6544 place count 2008 transition count 4808
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6584 place count 1968 transition count 4768
Iterating global reduction 0 with 40 rules applied. Total rules applied 6624 place count 1968 transition count 4768
Applied a total of 6624 rules in 2460 ms. Remains 1968 /5280 variables (removed 3312) and now considering 4768/8080 (removed 3312) transitions.
// Phase 1: matrix 4768 rows 1968 cols
[2024-05-22 04:11:04] [INFO ] Computed 40 invariants in 21 ms
[2024-05-22 04:11:04] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-22 04:11:04] [INFO ] Invariant cache hit.
[2024-05-22 04:11:05] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2024-05-22 04:11:05] [INFO ] Invariant cache hit.
[2024-05-22 04:11:08] [INFO ] Dead Transitions using invariants and state equation in 3913 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1968/5280 places, 4768/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7316 ms. Remains : 1968/5280 places, 4768/8080 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s640 1), p0:(EQ s1 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 1087 reset in 1039 ms.
Product exploration explored 100000 steps with 1619 reset in 1019 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 7841 steps, including 2 resets, run visited all 2 properties in 81 ms. (steps per millisecond=96 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 4768/4768 transitions.
Applied a total of 0 rules in 183 ms. Remains 1968 /1968 variables (removed 0) and now considering 4768/4768 (removed 0) transitions.
[2024-05-22 04:11:14] [INFO ] Invariant cache hit.
[2024-05-22 04:11:14] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-22 04:11:14] [INFO ] Invariant cache hit.
[2024-05-22 04:11:16] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2024-05-22 04:11:16] [INFO ] Invariant cache hit.
[2024-05-22 04:11:21] [INFO ] Dead Transitions using invariants and state equation in 5022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6906 ms. Remains : 1968/1968 places, 4768/4768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 2860 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=114 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1703 reset in 1349 ms.
Product exploration explored 100000 steps with 1301 reset in 1333 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 4768/4768 transitions.
Graph (trivial) has 4729 edges and 1968 vertex of which 1911 / 1968 are part of one of the 39 SCC in 2 ms
Free SCC test removed 1872 places
Ensure Unique test removed 4596 transitions
Reduce isomorphic transitions removed 4596 transitions.
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 58 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 58 transition count 134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 58 transition count 134
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 58 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 56 transition count 132
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 56 transition count 132
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 62 place count 56 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 69 place count 56 transition count 126
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 81 place count 44 transition count 114
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 93 place count 44 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 44 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 44 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 43 transition count 111
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 43 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 43 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 43 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 42 transition count 108
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 42 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 42 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 106 place count 42 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 107 place count 41 transition count 105
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 108 place count 41 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 109 place count 41 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 111 place count 41 transition count 103
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 112 place count 40 transition count 102
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 113 place count 40 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 114 place count 40 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 116 place count 40 transition count 100
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 117 place count 39 transition count 99
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 118 place count 39 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 119 place count 39 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 121 place count 39 transition count 97
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 122 place count 38 transition count 96
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 123 place count 38 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 124 place count 38 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 126 place count 38 transition count 94
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 127 place count 37 transition count 93
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 128 place count 37 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 129 place count 37 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 131 place count 37 transition count 91
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 132 place count 36 transition count 90
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 133 place count 36 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 134 place count 36 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 136 place count 36 transition count 88
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 137 place count 35 transition count 87
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 138 place count 35 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 139 place count 35 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 141 place count 35 transition count 85
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 142 place count 34 transition count 84
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 143 place count 34 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 144 place count 34 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 146 place count 34 transition count 82
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 147 place count 33 transition count 81
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 148 place count 33 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 149 place count 33 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 151 place count 33 transition count 79
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 152 place count 32 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 153 place count 32 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 154 place count 32 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 156 place count 32 transition count 76
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 157 place count 31 transition count 75
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 158 place count 31 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 159 place count 31 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 161 place count 31 transition count 73
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 162 place count 30 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 163 place count 30 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 164 place count 30 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 166 place count 30 transition count 70
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 167 place count 29 transition count 69
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 168 place count 29 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 169 place count 29 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 171 place count 29 transition count 67
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 172 place count 28 transition count 66
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 173 place count 28 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 174 place count 28 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 176 place count 28 transition count 64
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 177 place count 27 transition count 63
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 178 place count 27 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 179 place count 27 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 181 place count 27 transition count 61
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 182 place count 26 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 183 place count 26 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 184 place count 26 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 186 place count 26 transition count 58
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 187 place count 25 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 188 place count 25 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 189 place count 25 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 191 place count 25 transition count 55
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 192 place count 24 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 193 place count 24 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 194 place count 24 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 196 place count 24 transition count 52
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 197 place count 23 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 198 place count 23 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 199 place count 23 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 201 place count 23 transition count 49
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 202 place count 22 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 203 place count 22 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 204 place count 22 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 206 place count 22 transition count 46
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 207 place count 21 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 208 place count 21 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 209 place count 21 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 211 place count 21 transition count 43
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 212 place count 20 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 213 place count 20 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 214 place count 20 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 216 place count 20 transition count 40
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 217 place count 19 transition count 39
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 218 place count 19 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 219 place count 19 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 221 place count 19 transition count 37
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 222 place count 18 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 223 place count 18 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 224 place count 18 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 226 place count 18 transition count 34
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 227 place count 17 transition count 33
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 228 place count 17 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 229 place count 17 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 231 place count 17 transition count 31
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 232 place count 16 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 233 place count 16 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 234 place count 16 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 236 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 237 place count 15 transition count 27
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 238 place count 15 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 239 place count 15 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 241 place count 15 transition count 25
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 242 place count 14 transition count 24
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 243 place count 14 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 244 place count 14 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 246 place count 14 transition count 22
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 247 place count 13 transition count 21
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 248 place count 13 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 249 place count 13 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 251 place count 13 transition count 19
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 252 place count 12 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 253 place count 12 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 254 place count 12 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 256 place count 12 transition count 16
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 257 place count 11 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 258 place count 11 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 259 place count 11 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 261 place count 11 transition count 13
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 263 place count 9 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 265 place count 9 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 37 with 1 rules applied. Total rules applied 266 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 266 place count 9 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 267 place count 9 transition count 10
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 269 place count 7 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 271 place count 7 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 271 rules in 106 ms. Remains 7 /1968 variables (removed 1961) and now considering 8/4768 (removed 4760) transitions.
[2024-05-22 04:11:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2024-05-22 04:11:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 04:11:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/1968 places, 8/4768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 7/1968 places, 8/4768 transitions.
Built C files in :
/tmp/ltsmin8116946865823964861
[2024-05-22 04:11:27] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8116946865823964861
Running compilation step : cd /tmp/ltsmin8116946865823964861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8116946865823964861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8116946865823964861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 4768/4768 transitions.
Applied a total of 0 rules in 206 ms. Remains 1968 /1968 variables (removed 0) and now considering 4768/4768 (removed 0) transitions.
// Phase 1: matrix 4768 rows 1968 cols
[2024-05-22 04:11:30] [INFO ] Computed 40 invariants in 19 ms
[2024-05-22 04:11:31] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-22 04:11:31] [INFO ] Invariant cache hit.
[2024-05-22 04:11:32] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
[2024-05-22 04:11:32] [INFO ] Invariant cache hit.
[2024-05-22 04:11:36] [INFO ] Dead Transitions using invariants and state equation in 3867 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5681 ms. Remains : 1968/1968 places, 4768/4768 transitions.
Built C files in :
/tmp/ltsmin277777529230893920
[2024-05-22 04:11:36] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin277777529230893920
Running compilation step : cd /tmp/ltsmin277777529230893920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin277777529230893920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin277777529230893920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 04:11:39] [INFO ] Flatten gal took : 66 ms
[2024-05-22 04:11:39] [INFO ] Flatten gal took : 81 ms
[2024-05-22 04:11:39] [INFO ] Time to serialize gal into /tmp/LTL16664511894620334230.gal : 14 ms
[2024-05-22 04:11:39] [INFO ] Time to serialize properties into /tmp/LTL8252999021548013352.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16664511894620334230.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4956796751942479734.hoa' '-atoms' '/tmp/LTL8252999021548013352.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8252999021548013352.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4956796751942479734.hoa
Detected timeout of ITS tools.
[2024-05-22 04:11:54] [INFO ] Flatten gal took : 69 ms
[2024-05-22 04:11:54] [INFO ] Flatten gal took : 74 ms
[2024-05-22 04:11:54] [INFO ] Time to serialize gal into /tmp/LTL3919208562048771849.gal : 14 ms
[2024-05-22 04:11:54] [INFO ] Time to serialize properties into /tmp/LTL15488089799876285413.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3919208562048771849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15488089799876285413.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(TrainState_2_0_0==1)")||(F("(TrainState_21_4_13==1)")))))
Formula 0 simplified : X(!"(TrainState_2_0_0==1)" & G!"(TrainState_21_4_13==1)")
Detected timeout of ITS tools.
[2024-05-22 04:12:10] [INFO ] Flatten gal took : 66 ms
[2024-05-22 04:12:10] [INFO ] Applying decomposition
[2024-05-22 04:12:10] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5240912950532462790.txt' '-o' '/tmp/graph5240912950532462790.bin' '-w' '/tmp/graph5240912950532462790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5240912950532462790.bin' '-l' '-1' '-v' '-w' '/tmp/graph5240912950532462790.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:12:10] [INFO ] Decomposing Gal with order
[2024-05-22 04:12:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:12:10] [INFO ] Removed a total of 1548 redundant transitions.
[2024-05-22 04:12:10] [INFO ] Flatten gal took : 235 ms
[2024-05-22 04:12:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 856 labels/synchronizations in 28 ms.
[2024-05-22 04:12:10] [INFO ] Time to serialize gal into /tmp/LTL8800986722461108646.gal : 29 ms
[2024-05-22 04:12:10] [INFO ] Time to serialize properties into /tmp/LTL6167484865116080193.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8800986722461108646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6167484865116080193.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("(i33.u211.TrainState_2_0_0==1)")||(F("(i16.i0.u178.TrainState_21_4_13==1)")))))
Formula 0 simplified : X(!"(i33.u211.TrainState_2_0_0==1)" & G!"(i16.i0.u178.TrainState_21_4_13==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
126 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.61509,37888,1,0,3222,1391,2813,3261,570,2631,10077
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-LTLFireability-14 finished in 70921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4880 place count 2760 transition count 5560
Iterating global reduction 0 with 160 rules applied. Total rules applied 5040 place count 2760 transition count 5560
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5160 place count 2640 transition count 5440
Iterating global reduction 0 with 120 rules applied. Total rules applied 5280 place count 2640 transition count 5440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5400 place count 2520 transition count 5320
Iterating global reduction 0 with 120 rules applied. Total rules applied 5520 place count 2520 transition count 5320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5640 place count 2400 transition count 5200
Iterating global reduction 0 with 120 rules applied. Total rules applied 5760 place count 2400 transition count 5200
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5880 place count 2280 transition count 5080
Iterating global reduction 0 with 120 rules applied. Total rules applied 6000 place count 2280 transition count 5080
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6120 place count 2160 transition count 4960
Iterating global reduction 0 with 120 rules applied. Total rules applied 6240 place count 2160 transition count 4960
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6320 place count 2080 transition count 4880
Iterating global reduction 0 with 80 rules applied. Total rules applied 6400 place count 2080 transition count 4880
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6480 place count 2000 transition count 4800
Iterating global reduction 0 with 80 rules applied. Total rules applied 6560 place count 2000 transition count 4800
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6600 place count 1960 transition count 4760
Iterating global reduction 0 with 40 rules applied. Total rules applied 6640 place count 1960 transition count 4760
Applied a total of 6640 rules in 3085 ms. Remains 1960 /5280 variables (removed 3320) and now considering 4760/8080 (removed 3320) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2024-05-22 04:12:15] [INFO ] Computed 40 invariants in 21 ms
[2024-05-22 04:12:16] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-22 04:12:16] [INFO ] Invariant cache hit.
[2024-05-22 04:12:17] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2024-05-22 04:12:17] [INFO ] Invariant cache hit.
[2024-05-22 04:12:21] [INFO ] Dead Transitions using invariants and state equation in 3723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1960/5280 places, 4760/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8671 ms. Remains : 1960/5280 places, 4760/8080 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1362 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 48736 reset in 6717 ms.
Product exploration explored 100000 steps with 49006 reset in 6592 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Finished Best-First random walk after 1441 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=480 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 302 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1960/1960 places, 4760/4760 transitions.
Applied a total of 0 rules in 202 ms. Remains 1960 /1960 variables (removed 0) and now considering 4760/4760 (removed 0) transitions.
[2024-05-22 04:12:37] [INFO ] Invariant cache hit.
[2024-05-22 04:12:38] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-22 04:12:38] [INFO ] Invariant cache hit.
[2024-05-22 04:12:39] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1627 ms to find 0 implicit places.
[2024-05-22 04:12:39] [INFO ] Invariant cache hit.
[2024-05-22 04:12:42] [INFO ] Dead Transitions using invariants and state equation in 3656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5486 ms. Remains : 1960/1960 places, 4760/4760 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1142 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 48781 reset in 6654 ms.
Product exploration explored 100000 steps with 49075 reset in 6325 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1960/1960 places, 4760/4760 transitions.
Graph (trivial) has 4756 edges and 1960 vertex of which 1959 / 1960 are part of one of the 40 SCC in 2 ms
Free SCC test removed 1919 places
Ensure Unique test removed 4718 transitions
Reduce isomorphic transitions removed 4718 transitions.
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 2 transition count 3
Applied a total of 40 rules in 14 ms. Remains 2 /1960 variables (removed 1958) and now considering 3/4760 (removed 4757) transitions.
[2024-05-22 04:12:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 04:12:58] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 04:12:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1960 places, 3/4760 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37 ms. Remains : 2/1960 places, 3/4760 transitions.
Built C files in :
/tmp/ltsmin6438297842816886835
[2024-05-22 04:12:58] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6438297842816886835
Running compilation step : cd /tmp/ltsmin6438297842816886835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6438297842816886835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6438297842816886835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1960/1960 places, 4760/4760 transitions.
Applied a total of 0 rules in 124 ms. Remains 1960 /1960 variables (removed 0) and now considering 4760/4760 (removed 0) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2024-05-22 04:13:01] [INFO ] Computed 40 invariants in 13 ms
[2024-05-22 04:13:02] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-22 04:13:02] [INFO ] Invariant cache hit.
[2024-05-22 04:13:03] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2024-05-22 04:13:03] [INFO ] Invariant cache hit.
[2024-05-22 04:13:08] [INFO ] Dead Transitions using invariants and state equation in 4967 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6566 ms. Remains : 1960/1960 places, 4760/4760 transitions.
Built C files in :
/tmp/ltsmin4912809297598669308
[2024-05-22 04:13:08] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4912809297598669308
Running compilation step : cd /tmp/ltsmin4912809297598669308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4912809297598669308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4912809297598669308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 04:13:11] [INFO ] Flatten gal took : 77 ms
[2024-05-22 04:13:11] [INFO ] Flatten gal took : 82 ms
[2024-05-22 04:13:11] [INFO ] Time to serialize gal into /tmp/LTL31003414012078263.gal : 24 ms
[2024-05-22 04:13:11] [INFO ] Time to serialize properties into /tmp/LTL15681452298675659631.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL31003414012078263.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7045435736473704297.hoa' '-atoms' '/tmp/LTL15681452298675659631.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL15681452298675659631.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7045435736473704297.hoa
Detected timeout of ITS tools.
[2024-05-22 04:13:26] [INFO ] Flatten gal took : 66 ms
[2024-05-22 04:13:27] [INFO ] Flatten gal took : 114 ms
[2024-05-22 04:13:27] [INFO ] Time to serialize gal into /tmp/LTL5751690827084252397.gal : 35 ms
[2024-05-22 04:13:27] [INFO ] Time to serialize properties into /tmp/LTL4853479815171875469.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5751690827084252397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4853479815171875469.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F("(TrainState_3_1_29!=1)"))))
Formula 0 simplified : XG!"(TrainState_3_1_29!=1)"
Detected timeout of ITS tools.
[2024-05-22 04:13:42] [INFO ] Flatten gal took : 110 ms
[2024-05-22 04:13:42] [INFO ] Applying decomposition
[2024-05-22 04:13:42] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11192136281641129889.txt' '-o' '/tmp/graph11192136281641129889.bin' '-w' '/tmp/graph11192136281641129889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11192136281641129889.bin' '-l' '-1' '-v' '-w' '/tmp/graph11192136281641129889.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:13:42] [INFO ] Decomposing Gal with order
[2024-05-22 04:13:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:13:43] [INFO ] Removed a total of 1515 redundant transitions.
[2024-05-22 04:13:43] [INFO ] Flatten gal took : 127 ms
[2024-05-22 04:13:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 881 labels/synchronizations in 13 ms.
[2024-05-22 04:13:43] [INFO ] Time to serialize gal into /tmp/LTL16999227654654297527.gal : 20 ms
[2024-05-22 04:13:43] [INFO ] Time to serialize properties into /tmp/LTL2474049416944297910.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16999227654654297527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2474049416944297910.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("(i14.u279.TrainState_3_1_29!=1)"))))
Formula 0 simplified : XG!"(i14.u279.TrainState_3_1_29!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
100 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.52028,37492,1,0,2569,1050,2745,2536,572,2158,8576
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-LTLFireability-15 finished in 92200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-22 04:13:45] [INFO ] Flatten gal took : 169 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2776739743484290697
[2024-05-22 04:13:45] [INFO ] Too many transitions (8080) to apply POR reductions. Disabling POR matrices.
[2024-05-22 04:13:45] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2776739743484290697
Running compilation step : cd /tmp/ltsmin2776739743484290697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 04:13:45] [INFO ] Applying decomposition
[2024-05-22 04:13:45] [INFO ] Flatten gal took : 227 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2067508299807486828.txt' '-o' '/tmp/graph2067508299807486828.bin' '-w' '/tmp/graph2067508299807486828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2067508299807486828.bin' '-l' '-1' '-v' '-w' '/tmp/graph2067508299807486828.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:13:46] [INFO ] Decomposing Gal with order
[2024-05-22 04:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:13:47] [INFO ] Removed a total of 592 redundant transitions.
[2024-05-22 04:13:48] [INFO ] Flatten gal took : 356 ms
[2024-05-22 04:13:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 19 ms.
[2024-05-22 04:13:52] [INFO ] Time to serialize gal into /tmp/LTLFireability8758572282213783615.gal : 41 ms
[2024-05-22 04:13:52] [INFO ] Time to serialize properties into /tmp/LTLFireability3276719726561294612.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8758572282213783615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3276719726561294612.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((((i24.i0.u86.TrainState_19_1_11==1)||(i13.i0.u112.TrainState_30_1_33==1))||((i22.i1.u388.TrainState_40_1_30==1)||(i...240967
Formula 0 simplified : FG!"(((((((((((((i24.i0.u86.TrainState_19_1_11==1)||(i13.i0.u112.TrainState_30_1_33==1))||((i22.i1.u388.TrainState_40_1_30==1)||(i7....240961
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1966 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.646,330876,1,0,559215,11402,70138,1.35937e+06,5805,26065,943205
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1392658 ms.

BK_STOP 1716351256628

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BART-PT-040, 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 r043-smll-171620180500303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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