Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689600644.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689600644
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 2.9M Apr 29 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 11M Apr 29 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9M Apr 29 21:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 17M Apr 29 21:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.0M May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 5.6M May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 274K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 553K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 12M May 10 09:33 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-050-LTLFireability-00
FORMULA_NAME BART-PT-050-LTLFireability-01
FORMULA_NAME BART-PT-050-LTLFireability-02
FORMULA_NAME BART-PT-050-LTLFireability-03
FORMULA_NAME BART-PT-050-LTLFireability-04
FORMULA_NAME BART-PT-050-LTLFireability-05
FORMULA_NAME BART-PT-050-LTLFireability-06
FORMULA_NAME BART-PT-050-LTLFireability-07
FORMULA_NAME BART-PT-050-LTLFireability-08
FORMULA_NAME BART-PT-050-LTLFireability-09
FORMULA_NAME BART-PT-050-LTLFireability-10
FORMULA_NAME BART-PT-050-LTLFireability-11
FORMULA_NAME BART-PT-050-LTLFireability-12
FORMULA_NAME BART-PT-050-LTLFireability-13
FORMULA_NAME BART-PT-050-LTLFireability-14
FORMULA_NAME BART-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652668142201

Running Version 202205111006
[2022-05-16 02:29:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:29:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:29:05] [INFO ] Load time of PNML (sax parser for PT used): 876 ms
[2022-05-16 02:29:05] [INFO ] Transformed 6810 places.
[2022-05-16 02:29:06] [INFO ] Transformed 10100 transitions.
[2022-05-16 02:29:06] [INFO ] Found NUPN structural information;
[2022-05-16 02:29:06] [INFO ] Parsed PT model containing 6810 places and 10100 transitions in 1237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 228 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 210 places and 0 transitions.
Support contains 6600 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 73 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
// Phase 1: matrix 10100 rows 6600 cols
[2022-05-16 02:29:07] [INFO ] Computed 50 place invariants in 95 ms
[2022-05-16 02:29:09] [INFO ] Implicit Places using invariants in 2395 ms returned []
Implicit Place search using SMT only with invariants took 2429 ms to find 0 implicit places.
// Phase 1: matrix 10100 rows 6600 cols
[2022-05-16 02:29:09] [INFO ] Computed 50 place invariants in 44 ms
[2022-05-16 02:29:11] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6600/6600 places, 10100/10100 transitions.
Support contains 6600 out of 6600 places after structural reductions.
[2022-05-16 02:29:13] [INFO ] Flatten gal took : 725 ms
[2022-05-16 02:29:14] [INFO ] Flatten gal took : 665 ms
[2022-05-16 02:29:16] [INFO ] Input system was already deterministic with 10100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 796 ms. (steps per millisecond=12 ) properties (out of 25) seen :23
Finished Best-First random walk after 1801 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=225 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)||F(p1)))))'
Support contains 3450 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 6600 transition count 9950
Reduce places removed 150 places and 0 transitions.
Performed 1300 Post agglomeration using F-continuation condition.Transition count delta: 1300
Iterating post reduction 1 with 1450 rules applied. Total rules applied 1600 place count 6450 transition count 8650
Reduce places removed 1300 places and 0 transitions.
Iterating post reduction 2 with 1300 rules applied. Total rules applied 2900 place count 5150 transition count 8650
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 2950 place count 5100 transition count 8600
Iterating global reduction 3 with 50 rules applied. Total rules applied 3000 place count 5100 transition count 8600
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 3400 place count 4900 transition count 8400
Applied a total of 3400 rules in 1724 ms. Remains 4900 /6600 variables (removed 1700) and now considering 8400/10100 (removed 1700) transitions.
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:29:20] [INFO ] Computed 50 place invariants in 58 ms
[2022-05-16 02:29:21] [INFO ] Implicit Places using invariants in 824 ms returned []
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:29:21] [INFO ] Computed 50 place invariants in 33 ms
[2022-05-16 02:29:22] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2022-05-16 02:29:23] [INFO ] Redundant transitions in 995 ms returned []
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:29:23] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-16 02:29:27] [INFO ] Dead Transitions using invariants and state equation in 4792 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4900/6600 places, 8400/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 4900/6600 places, 8400/10100 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s64 1) (EQ s66 1) (EQ s68 1) (EQ s70 1) (EQ s72 1) (EQ s74 1) (EQ s76 1) (EQ s78 1) (EQ s80 1) (EQ s82 1) (EQ s84 1) (EQ s86 1) (EQ s88 1) (EQ ...], 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 614 reset in 3214 ms.
Product exploration explored 100000 steps with 623 reset in 2873 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3450 out of 4900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4900/4900 places, 8400/8400 transitions.
Applied a total of 0 rules in 229 ms. Remains 4900 /4900 variables (removed 0) and now considering 8400/8400 (removed 0) transitions.
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:29:40] [INFO ] Computed 50 place invariants in 36 ms
[2022-05-16 02:29:41] [INFO ] Implicit Places using invariants in 832 ms returned []
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:29:41] [INFO ] Computed 50 place invariants in 38 ms
[2022-05-16 02:29:42] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2022-05-16 02:29:42] [INFO ] Redundant transitions in 627 ms returned []
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:29:42] [INFO ] Computed 50 place invariants in 63 ms
[2022-05-16 02:29:55] [INFO ] Dead Transitions using invariants and state equation in 12886 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4900/4900 places, 8400/8400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 612 reset in 3180 ms.
Product exploration explored 100000 steps with 608 reset in 3043 ms.
Built C files in :
/tmp/ltsmin469526976818521711
[2022-05-16 02:30:09] [INFO ] Too many transitions (8400) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:30:09] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin469526976818521711
Running compilation step : cd /tmp/ltsmin469526976818521711;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin469526976818521711;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin469526976818521711;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3450 out of 4900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4900/4900 places, 8400/8400 transitions.
Applied a total of 0 rules in 158 ms. Remains 4900 /4900 variables (removed 0) and now considering 8400/8400 (removed 0) transitions.
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:30:12] [INFO ] Computed 50 place invariants in 61 ms
[2022-05-16 02:30:13] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:30:13] [INFO ] Computed 50 place invariants in 37 ms
[2022-05-16 02:30:13] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2022-05-16 02:30:14] [INFO ] Redundant transitions in 952 ms returned []
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:30:14] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-16 02:30:19] [INFO ] Dead Transitions using invariants and state equation in 4845 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4900/4900 places, 8400/8400 transitions.
Built C files in :
/tmp/ltsmin3820549890937155578
[2022-05-16 02:30:19] [INFO ] Too many transitions (8400) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:30:19] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3820549890937155578
Running compilation step : cd /tmp/ltsmin3820549890937155578;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3820549890937155578;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3820549890937155578;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:30:23] [INFO ] Flatten gal took : 298 ms
[2022-05-16 02:30:23] [INFO ] Flatten gal took : 180 ms
[2022-05-16 02:30:23] [INFO ] Time to serialize gal into /tmp/LTL12018433837982326516.gal : 45 ms
[2022-05-16 02:30:23] [INFO ] Time to serialize properties into /tmp/LTL7813688175393599146.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12018433837982326516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7813688175393599146.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1201843...267
Read 1 LTL properties
Checking formula 0 : !((G(X((F("(((((((TrainState_15_1_1==1)||(TrainState_17_1_1==1))||((TrainState_19_1_1==1)||(TrainState_21_1_1==1)))||(((TrainState_23_...91919
Formula 0 simplified : !GX(F"(((((((TrainState_15_1_1==1)||(TrainState_17_1_1==1))||((TrainState_19_1_1==1)||(TrainState_21_1_1==1)))||(((TrainState_23_1_1...91908
Detected timeout of ITS tools.
[2022-05-16 02:30:39] [INFO ] Flatten gal took : 280 ms
[2022-05-16 02:30:39] [INFO ] Applying decomposition
[2022-05-16 02:30:39] [INFO ] Flatten gal took : 265 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph855276328377643667.txt' '-o' '/tmp/graph855276328377643667.bin' '-w' '/tmp/graph855276328377643667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph855276328377643667.bin' '-l' '-1' '-v' '-w' '/tmp/graph855276328377643667.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:30:40] [INFO ] Decomposing Gal with order
[2022-05-16 02:30:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:30:42] [INFO ] Removed a total of 440 redundant transitions.
[2022-05-16 02:30:42] [INFO ] Flatten gal took : 608 ms
[2022-05-16 02:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 98 ms.
[2022-05-16 02:30:43] [INFO ] Time to serialize gal into /tmp/LTL2287190293215051584.gal : 59 ms
[2022-05-16 02:30:43] [INFO ] Time to serialize properties into /tmp/LTL7775940143468194868.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2287190293215051584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7775940143468194868.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2287190...245
Read 1 LTL properties
Checking formula 0 : !((G(X((F("(((((((i39.u34.TrainState_15_1_1==1)||(i14.u35.TrainState_17_1_1==1))||((i5.u8.TrainState_19_1_1==1)||(i29.u10.TrainState_2...122457
Formula 0 simplified : !GX(F"(((((((i39.u34.TrainState_15_1_1==1)||(i14.u35.TrainState_17_1_1==1))||((i5.u8.TrainState_19_1_1==1)||(i29.u10.TrainState_21_1...122446
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10832699883937819433
[2022-05-16 02:30:58] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10832699883937819433
Running compilation step : cd /tmp/ltsmin10832699883937819433;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10832699883937819433;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10832699883937819433;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BART-PT-050-LTLFireability-00 finished in 103311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((p0&&(F((G(X(p1)) U p2))||p3)))))'
Support contains 3500 out of 6600 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 : 6600/6600 places, 10100/10100 transitions.
Performed 1150 Post agglomeration using F-continuation condition.Transition count delta: 1150
Iterating post reduction 0 with 1150 rules applied. Total rules applied 1150 place count 6600 transition count 8950
Reduce places removed 1150 places and 0 transitions.
Iterating post reduction 1 with 1150 rules applied. Total rules applied 2300 place count 5450 transition count 8950
Applied a total of 2300 rules in 1094 ms. Remains 5450 /6600 variables (removed 1150) and now considering 8950/10100 (removed 1150) transitions.
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:31:02] [INFO ] Computed 50 place invariants in 37 ms
[2022-05-16 02:31:03] [INFO ] Implicit Places using invariants in 780 ms returned []
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:31:03] [INFO ] Computed 50 place invariants in 55 ms
[2022-05-16 02:31:04] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2022-05-16 02:31:05] [INFO ] Redundant transitions in 755 ms returned []
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:31:05] [INFO ] Computed 50 place invariants in 59 ms
[2022-05-16 02:31:06] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5450/6600 places, 8950/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 5450/6600 places, 8950/10100 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : BART-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s444 1) (EQ s5384 1) (EQ s4707 1) (EQ s5000 1) (EQ s5369 1) (EQ s898 1) (EQ s228 1) (EQ s1410 1) (EQ s1607 1) (EQ s5015 1) (EQ s562 1) (EQ s414...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1656 reset in 5950 ms.
Product exploration explored 100000 steps with 1656 reset in 5244 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2)), (X (AND p0 (NOT p3) (NOT p2))), (X p0), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 492 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Finished random walk after 58 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2)), (X (AND p0 (NOT p3) (NOT p2))), (X p0), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))))), (F p0), (F (AND p0 (NOT p2) (NOT p3)))]
Knowledge based reduction with 5 factoid took 406 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:33:21] [INFO ] Computed 50 place invariants in 65 ms
Could not prove EG (NOT p0)
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:33:36] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-16 02:33:44] [INFO ] [Real]Absence check using 50 positive place invariants in 106 ms returned sat
[2022-05-16 02:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:33:51] [INFO ] [Real]Absence check using state equation in 6964 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 3500 out of 5450 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 : 5450/5450 places, 8950/8950 transitions.
Applied a total of 0 rules in 141 ms. Remains 5450 /5450 variables (removed 0) and now considering 8950/8950 (removed 0) transitions.
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:33:51] [INFO ] Computed 50 place invariants in 36 ms
[2022-05-16 02:33:53] [INFO ] Implicit Places using invariants in 1573 ms returned []
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:33:53] [INFO ] Computed 50 place invariants in 57 ms
[2022-05-16 02:33:54] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 2632 ms to find 0 implicit places.
[2022-05-16 02:33:55] [INFO ] Redundant transitions in 906 ms returned []
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:33:55] [INFO ] Computed 50 place invariants in 55 ms
[2022-05-16 02:33:56] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5450/5450 places, 8950/8950 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X p0), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 63 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Finished random walk after 54 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X p0), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))))), (F p0), (F (AND p0 (NOT p2) (NOT p3)))]
Knowledge based reduction with 5 factoid took 389 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:36:00] [INFO ] Computed 50 place invariants in 71 ms
Could not prove EG (NOT p0)
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:36:16] [INFO ] Computed 50 place invariants in 45 ms
[2022-05-16 02:36:26] [INFO ] [Real]Absence check using 50 positive place invariants in 152 ms returned sat
[2022-05-16 02:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-16 02:36:31] [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: Broken pipe ... while checking expression EG (AND (NOT p2) (NOT p3))
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 1662 reset in 5413 ms.
Product exploration explored 100000 steps with 1655 reset in 5361 ms.
Built C files in :
/tmp/ltsmin7372663797895055132
[2022-05-16 02:36:42] [INFO ] Too many transitions (8950) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:36:42] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7372663797895055132
Running compilation step : cd /tmp/ltsmin7372663797895055132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7372663797895055132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7372663797895055132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3500 out of 5450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5450/5450 places, 8950/8950 transitions.
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 5450 transition count 8650
Reduce places removed 300 places and 0 transitions.
Iterating post reduction 1 with 300 rules applied. Total rules applied 600 place count 5150 transition count 8650
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 650 place count 5100 transition count 8600
Iterating global reduction 2 with 50 rules applied. Total rules applied 700 place count 5100 transition count 8600
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 1100 place count 4900 transition count 8400
Applied a total of 1100 rules in 641 ms. Remains 4900 /5450 variables (removed 550) and now considering 8400/8950 (removed 550) transitions.
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:36:45] [INFO ] Computed 50 place invariants in 33 ms
[2022-05-16 02:36:46] [INFO ] Implicit Places using invariants in 705 ms returned []
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:36:46] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-16 02:36:48] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
[2022-05-16 02:36:48] [INFO ] Redundant transitions in 625 ms returned []
// Phase 1: matrix 8400 rows 4900 cols
[2022-05-16 02:36:48] [INFO ] Computed 50 place invariants in 57 ms
[2022-05-16 02:36:53] [INFO ] Dead Transitions using invariants and state equation in 4837 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4900/5450 places, 8400/8950 transitions.
Finished structural reductions, in 1 iterations. Remains : 4900/5450 places, 8400/8950 transitions.
Built C files in :
/tmp/ltsmin9154983274048560188
[2022-05-16 02:36:53] [INFO ] Too many transitions (8400) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:36:53] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9154983274048560188
Running compilation step : cd /tmp/ltsmin9154983274048560188;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9154983274048560188;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9154983274048560188;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:36:57] [INFO ] Flatten gal took : 442 ms
[2022-05-16 02:36:58] [INFO ] Flatten gal took : 390 ms
[2022-05-16 02:36:58] [INFO ] Time to serialize gal into /tmp/LTL6224982604662756653.gal : 24 ms
[2022-05-16 02:36:58] [INFO ] Time to serialize properties into /tmp/LTL16213804635433921043.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6224982604662756653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16213804635433921043.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6224982...267
Read 1 LTL properties
Checking formula 0 : !((F(F(("(((((((((((((TrainState_45_1_6==1)||(TrainState_35_1_39==1))||((TrainState_8_1_33==1)||(TrainState_1_1_35==1)))||(((TrainStat...105039
Formula 0 simplified : !F("(((((((((((((TrainState_45_1_6==1)||(TrainState_35_1_39==1))||((TrainState_8_1_33==1)||(TrainState_1_1_35==1)))||(((TrainState_2...105024
Detected timeout of ITS tools.
[2022-05-16 02:37:13] [INFO ] Flatten gal took : 291 ms
[2022-05-16 02:37:13] [INFO ] Applying decomposition
[2022-05-16 02:37:13] [INFO ] Flatten gal took : 203 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14287472327859547005.txt' '-o' '/tmp/graph14287472327859547005.bin' '-w' '/tmp/graph14287472327859547005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14287472327859547005.bin' '-l' '-1' '-v' '-w' '/tmp/graph14287472327859547005.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:37:14] [INFO ] Decomposing Gal with order
[2022-05-16 02:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:37:17] [INFO ] Removed a total of 718 redundant transitions.
[2022-05-16 02:37:17] [INFO ] Flatten gal took : 333 ms
[2022-05-16 02:37:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 157 ms.
[2022-05-16 02:37:18] [INFO ] Time to serialize gal into /tmp/LTL12110036495281245305.gal : 137 ms
[2022-05-16 02:37:18] [INFO ] Time to serialize properties into /tmp/LTL3714130545055486275.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12110036495281245305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3714130545055486275.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1211003...246
Read 1 LTL properties
Checking formula 0 : !((F(F(("(((((((((((((i15.u127.TrainState_45_1_6==1)||(i31.u1688.TrainState_35_1_39==1))||((i5.u114.TrainState_8_1_33==1)||(i46.u1755....145055
Formula 0 simplified : !F("(((((((((((((i15.u127.TrainState_45_1_6==1)||(i31.u1688.TrainState_35_1_39==1))||((i5.u114.TrainState_8_1_33==1)||(i46.u1755.Tra...145040
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11813752644499110247
[2022-05-16 02:37:33] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11813752644499110247
Running compilation step : cd /tmp/ltsmin11813752644499110247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin11813752644499110247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin11813752644499110247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BART-PT-050-LTLFireability-01 finished in 395139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 4450 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 450 places :
Symmetric choice reduction at 0 with 450 rule applications. Total rules 450 place count 6150 transition count 9650
Iterating global reduction 0 with 450 rules applied. Total rules applied 900 place count 6150 transition count 9650
Discarding 300 places :
Symmetric choice reduction at 0 with 300 rule applications. Total rules 1200 place count 5850 transition count 9350
Iterating global reduction 0 with 300 rules applied. Total rules applied 1500 place count 5850 transition count 9350
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 1650 place count 5700 transition count 9200
Iterating global reduction 0 with 150 rules applied. Total rules applied 1800 place count 5700 transition count 9200
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 1950 place count 5550 transition count 9050
Iterating global reduction 0 with 150 rules applied. Total rules applied 2100 place count 5550 transition count 9050
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 2250 place count 5400 transition count 8900
Iterating global reduction 0 with 150 rules applied. Total rules applied 2400 place count 5400 transition count 8900
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 2550 place count 5250 transition count 8750
Iterating global reduction 0 with 150 rules applied. Total rules applied 2700 place count 5250 transition count 8750
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 2800 place count 5150 transition count 8650
Iterating global reduction 0 with 100 rules applied. Total rules applied 2900 place count 5150 transition count 8650
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 3000 place count 5050 transition count 8550
Iterating global reduction 0 with 100 rules applied. Total rules applied 3100 place count 5050 transition count 8550
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 3150 place count 5000 transition count 8500
Iterating global reduction 0 with 50 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Applied a total of 3200 rules in 894 ms. Remains 5000 /6600 variables (removed 1600) and now considering 8500/10100 (removed 1600) transitions.
// Phase 1: matrix 8500 rows 5000 cols
[2022-05-16 02:37:37] [INFO ] Computed 50 place invariants in 52 ms
[2022-05-16 02:37:38] [INFO ] Implicit Places using invariants in 655 ms returned []
// Phase 1: matrix 8500 rows 5000 cols
[2022-05-16 02:37:38] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-16 02:37:39] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
// Phase 1: matrix 8500 rows 5000 cols
[2022-05-16 02:37:39] [INFO ] Computed 50 place invariants in 53 ms
[2022-05-16 02:37:51] [INFO ] Dead Transitions using invariants and state equation in 11963 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5000/6600 places, 8500/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/6600 places, 8500/10100 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-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:(OR (EQ s64 1) (EQ s66 1) (EQ s68 1) (EQ s70 1) (EQ s72 1) (EQ s74 1) (EQ s76 1) (EQ s78 1) (EQ s80 1) (EQ s82 1) (EQ s84 1) (EQ s86 1) (EQ s88 1) (EQ ...], 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 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-02 finished in 14418 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 50 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions removed 3200 transitions
Trivial Post-agglo rules discarded 3200 transitions
Performed 3200 trivial Post agglomeration. Transition count delta: 3200
Iterating post reduction 0 with 3200 rules applied. Total rules applied 3200 place count 6600 transition count 6900
Reduce places removed 3200 places and 0 transitions.
Iterating post reduction 1 with 3200 rules applied. Total rules applied 6400 place count 3400 transition count 6900
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 6400 place count 3400 transition count 6650
Deduced a syphon composed of 250 places in 1 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 6900 place count 3150 transition count 6650
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 7200 place count 2850 transition count 6350
Iterating global reduction 2 with 300 rules applied. Total rules applied 7500 place count 2850 transition count 6350
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 7550 place count 2850 transition count 6300
Discarding 200 places :
Symmetric choice reduction at 3 with 200 rule applications. Total rules 7750 place count 2650 transition count 6100
Iterating global reduction 3 with 200 rules applied. Total rules applied 7950 place count 2650 transition count 6100
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 8100 place count 2500 transition count 5950
Iterating global reduction 3 with 150 rules applied. Total rules applied 8250 place count 2500 transition count 5950
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 8400 place count 2350 transition count 5800
Iterating global reduction 3 with 150 rules applied. Total rules applied 8550 place count 2350 transition count 5800
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8650 place count 2250 transition count 5700
Iterating global reduction 3 with 100 rules applied. Total rules applied 8750 place count 2250 transition count 5700
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8850 place count 2150 transition count 5600
Iterating global reduction 3 with 100 rules applied. Total rules applied 8950 place count 2150 transition count 5600
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 9000 place count 2100 transition count 5550
Iterating global reduction 3 with 50 rules applied. Total rules applied 9050 place count 2100 transition count 5550
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Deduced a syphon composed of 350 places in 0 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 700 rules applied. Total rules applied 9750 place count 1750 transition count 5200
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 3 with 200 rules applied. Total rules applied 9950 place count 1750 transition count 5000
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 10150 place count 1650 transition count 4900
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 4 with 200 rules applied. Total rules applied 10350 place count 1650 transition count 4700
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 10550 place count 1550 transition count 4600
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 5 with 200 rules applied. Total rules applied 10750 place count 1550 transition count 4400
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 13 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 6 with 200 rules applied. Total rules applied 10950 place count 1450 transition count 4300
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 6 with 200 rules applied. Total rules applied 11150 place count 1450 transition count 4100
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 7 with 200 rules applied. Total rules applied 11350 place count 1350 transition count 4000
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 7 with 200 rules applied. Total rules applied 11550 place count 1350 transition count 3800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 8 with 200 rules applied. Total rules applied 11750 place count 1250 transition count 3700
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 8 with 200 rules applied. Total rules applied 11950 place count 1250 transition count 3500
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 9 with 200 rules applied. Total rules applied 12150 place count 1150 transition count 3400
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 9 with 200 rules applied. Total rules applied 12350 place count 1150 transition count 3200
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 10 with 200 rules applied. Total rules applied 12550 place count 1050 transition count 3100
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 10 with 200 rules applied. Total rules applied 12750 place count 1050 transition count 2900
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 11 with 200 rules applied. Total rules applied 12950 place count 950 transition count 2800
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 11 with 200 rules applied. Total rules applied 13150 place count 950 transition count 2600
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 12 with 200 rules applied. Total rules applied 13350 place count 850 transition count 2500
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 12 with 200 rules applied. Total rules applied 13550 place count 850 transition count 2300
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 13 with 200 rules applied. Total rules applied 13750 place count 750 transition count 2200
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 13 with 200 rules applied. Total rules applied 13950 place count 750 transition count 2000
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 14 with 200 rules applied. Total rules applied 14150 place count 650 transition count 1900
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 14 with 200 rules applied. Total rules applied 14350 place count 650 transition count 1700
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 15 with 200 rules applied. Total rules applied 14550 place count 550 transition count 1600
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 15 with 200 rules applied. Total rules applied 14750 place count 550 transition count 1400
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 16 with 200 rules applied. Total rules applied 14950 place count 450 transition count 1300
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 16 with 200 rules applied. Total rules applied 15150 place count 450 transition count 1100
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 17 with 200 rules applied. Total rules applied 15350 place count 350 transition count 1000
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 17 with 200 rules applied. Total rules applied 15550 place count 350 transition count 800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 18 with 200 rules applied. Total rules applied 15750 place count 250 transition count 700
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 18 with 200 rules applied. Total rules applied 15950 place count 250 transition count 500
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 19 with 200 rules applied. Total rules applied 16150 place count 150 transition count 400
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 19 with 250 rules applied. Total rules applied 16400 place count 150 transition count 150
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 20 with 100 rules applied. Total rules applied 16500 place count 100 transition count 100
Applied a total of 16500 rules in 4885 ms. Remains 100 /6600 variables (removed 6500) and now considering 100/10100 (removed 10000) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-16 02:37:56] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:37:56] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-16 02:37:56] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-16 02:37:56] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-05-16 02:37:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-16 02:37:56] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:37:56] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/6600 places, 100/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/6600 places, 100/10100 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s11 1) (NEQ s22 1) (NEQ s46 1) (NEQ s32 1) (NEQ s18 1) (NEQ s12 1) (NEQ s45 1) (NEQ s8 1) (NEQ s10 1) (NEQ s31 1) (NEQ s42 1) (NEQ s43 1) (NE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 766 ms.
Stack based approach found an accepted trace after 236 steps with 0 reset with depth 237 and stack size 237 in 4 ms.
FORMULA BART-PT-050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-050-LTLFireability-03 finished in 6027 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G(p2)&&p1))))'
Support contains 4450 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 450 places :
Symmetric choice reduction at 0 with 450 rule applications. Total rules 450 place count 6150 transition count 9650
Iterating global reduction 0 with 450 rules applied. Total rules applied 900 place count 6150 transition count 9650
Discarding 300 places :
Symmetric choice reduction at 0 with 300 rule applications. Total rules 1200 place count 5850 transition count 9350
Iterating global reduction 0 with 300 rules applied. Total rules applied 1500 place count 5850 transition count 9350
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 1650 place count 5700 transition count 9200
Iterating global reduction 0 with 150 rules applied. Total rules applied 1800 place count 5700 transition count 9200
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 1950 place count 5550 transition count 9050
Iterating global reduction 0 with 150 rules applied. Total rules applied 2100 place count 5550 transition count 9050
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 2250 place count 5400 transition count 8900
Iterating global reduction 0 with 150 rules applied. Total rules applied 2400 place count 5400 transition count 8900
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 2550 place count 5250 transition count 8750
Iterating global reduction 0 with 150 rules applied. Total rules applied 2700 place count 5250 transition count 8750
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 2800 place count 5150 transition count 8650
Iterating global reduction 0 with 100 rules applied. Total rules applied 2900 place count 5150 transition count 8650
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 3000 place count 5050 transition count 8550
Iterating global reduction 0 with 100 rules applied. Total rules applied 3100 place count 5050 transition count 8550
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 3150 place count 5000 transition count 8500
Iterating global reduction 0 with 50 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Applied a total of 3200 rules in 778 ms. Remains 5000 /6600 variables (removed 1600) and now considering 8500/10100 (removed 1600) transitions.
// Phase 1: matrix 8500 rows 5000 cols
[2022-05-16 02:37:58] [INFO ] Computed 50 place invariants in 61 ms
[2022-05-16 02:37:58] [INFO ] Implicit Places using invariants in 755 ms returned []
// Phase 1: matrix 8500 rows 5000 cols
[2022-05-16 02:37:58] [INFO ] Computed 50 place invariants in 33 ms
[2022-05-16 02:38:00] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
// Phase 1: matrix 8500 rows 5000 cols
[2022-05-16 02:38:00] [INFO ] Computed 50 place invariants in 34 ms
[2022-05-16 02:38:05] [INFO ] Dead Transitions using invariants and state equation in 4350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5000/6600 places, 8500/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/6600 places, 8500/10100 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (OR (EQ s4430 1) (EQ s1782 1) (EQ s3617 1) (EQ s2704 1) (EQ s2363 1) (EQ s1491 1) (EQ s3276 1) (EQ s449 1) (EQ s4952 1) (EQ s3838 1) (EQ s3908 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 4 ms.
FORMULA BART-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-04 finished in 8069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&F(G(p0)))))'
Support contains 50 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 1600 place count 5000 transition count 8500
Iterating global reduction 0 with 1600 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Discarding 1350 places :
Symmetric choice reduction at 0 with 1350 rule applications. Total rules 4550 place count 3650 transition count 7150
Iterating global reduction 0 with 1350 rules applied. Total rules applied 5900 place count 3650 transition count 7150
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6100 place count 3450 transition count 6950
Iterating global reduction 0 with 200 rules applied. Total rules applied 6300 place count 3450 transition count 6950
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6450 place count 3300 transition count 6800
Iterating global reduction 0 with 150 rules applied. Total rules applied 6600 place count 3300 transition count 6800
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6750 place count 3150 transition count 6650
Iterating global reduction 0 with 150 rules applied. Total rules applied 6900 place count 3150 transition count 6650
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7050 place count 3000 transition count 6500
Iterating global reduction 0 with 150 rules applied. Total rules applied 7200 place count 3000 transition count 6500
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7350 place count 2850 transition count 6350
Iterating global reduction 0 with 150 rules applied. Total rules applied 7500 place count 2850 transition count 6350
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7650 place count 2700 transition count 6200
Iterating global reduction 0 with 150 rules applied. Total rules applied 7800 place count 2700 transition count 6200
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7900 place count 2600 transition count 6100
Iterating global reduction 0 with 100 rules applied. Total rules applied 8000 place count 2600 transition count 6100
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8100 place count 2500 transition count 6000
Iterating global reduction 0 with 100 rules applied. Total rules applied 8200 place count 2500 transition count 6000
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8250 place count 2450 transition count 5950
Iterating global reduction 0 with 50 rules applied. Total rules applied 8300 place count 2450 transition count 5950
Applied a total of 8300 rules in 3095 ms. Remains 2450 /6600 variables (removed 4150) and now considering 5950/10100 (removed 4150) transitions.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:38:08] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-16 02:38:09] [INFO ] Implicit Places using invariants in 524 ms returned []
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:38:09] [INFO ] Computed 50 place invariants in 33 ms
[2022-05-16 02:38:10] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:38:10] [INFO ] Computed 50 place invariants in 17 ms
[2022-05-16 02:38:13] [INFO ] Dead Transitions using invariants and state equation in 3259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2450/6600 places, 5950/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 2450/6600 places, 5950/10100 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-05 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:(OR (EQ s11 1) (EQ s22 1) (EQ s46 1) (EQ s32 1) (EQ s18 1) (EQ s12 1) (EQ s45 1) (EQ s8 1) (EQ s10 1) (EQ s31 1) (EQ s42 1) (EQ s43 1) (EQ s23 1) (EQ s...], 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 61 steps with 0 reset in 4 ms.
FORMULA BART-PT-050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-05 finished in 8303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F((X(p0) U F(p1))) U G((p0 U p2))))'
Support contains 3900 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Performed 1150 Post agglomeration using F-continuation condition.Transition count delta: 1150
Iterating post reduction 0 with 1150 rules applied. Total rules applied 1150 place count 6600 transition count 8950
Reduce places removed 1150 places and 0 transitions.
Iterating post reduction 1 with 1150 rules applied. Total rules applied 2300 place count 5450 transition count 8950
Applied a total of 2300 rules in 407 ms. Remains 5450 /6600 variables (removed 1150) and now considering 8950/10100 (removed 1150) transitions.
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:38:14] [INFO ] Computed 50 place invariants in 39 ms
[2022-05-16 02:38:15] [INFO ] Implicit Places using invariants in 889 ms returned []
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:38:15] [INFO ] Computed 50 place invariants in 25 ms
[2022-05-16 02:38:15] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1685 ms to find 0 implicit places.
[2022-05-16 02:38:16] [INFO ] Redundant transitions in 778 ms returned []
// Phase 1: matrix 8950 rows 5450 cols
[2022-05-16 02:38:16] [INFO ] Computed 50 place invariants in 56 ms
[2022-05-16 02:38:17] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5450/6600 places, 8950/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 5450/6600 places, 8950/10100 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), true, (OR (AND p1 p2) (AND p0 p1)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(OR p2 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s444 1) (EQ s5384 1) (EQ s4707 1) (EQ s5000 1) (EQ s5369 1) (EQ s898 1) (EQ s228 1) (EQ s1410 1) (EQ s1607 1) (EQ s5015 1) (EQ s562 1) (EQ s414...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2285 ms.
Product exploration explored 100000 steps with 0 reset in 2037 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 p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (OR (AND p2 p1) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), true, (X (X (NOT (OR (AND p2 p1) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (OR p2 p0))), (X (X (NOT (OR p2 p0))))]
Property proved to be false thanks to negative knowledge :(X (X (AND (NOT p2) (NOT p0) p1)))
Knowledge based reduction with 15 factoid took 322 ms. Reduced automaton from 6 states, 20 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-050-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-050-LTLFireability-06 finished in 443512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(X(X(p0)))))&&F(p1))))'
Support contains 500 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1150 places :
Symmetric choice reduction at 0 with 1150 rule applications. Total rules 1150 place count 5450 transition count 8950
Iterating global reduction 0 with 1150 rules applied. Total rules applied 2300 place count 5450 transition count 8950
Discarding 950 places :
Symmetric choice reduction at 0 with 950 rule applications. Total rules 3250 place count 4500 transition count 8000
Iterating global reduction 0 with 950 rules applied. Total rules applied 4200 place count 4500 transition count 8000
Applied a total of 4200 rules in 1443 ms. Remains 4500 /6600 variables (removed 2100) and now considering 8000/10100 (removed 2100) transitions.
// Phase 1: matrix 8000 rows 4500 cols
[2022-05-16 02:45:38] [INFO ] Computed 50 place invariants in 46 ms
[2022-05-16 02:45:39] [INFO ] Implicit Places using invariants in 693 ms returned []
// Phase 1: matrix 8000 rows 4500 cols
[2022-05-16 02:45:39] [INFO ] Computed 50 place invariants in 37 ms
[2022-05-16 02:45:40] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
// Phase 1: matrix 8000 rows 4500 cols
[2022-05-16 02:45:40] [INFO ] Computed 50 place invariants in 43 ms
[2022-05-16 02:45:45] [INFO ] Dead Transitions using invariants and state equation in 5302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4500/6600 places, 8000/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 4500/6600 places, 8000/10100 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BART-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s1695 1) (EQ s1505 1) (EQ s1652 1) (EQ s1358 1) (EQ s389 1) (EQ s764 1) (EQ s792 1) (EQ s1373 1) (EQ s603 1) (EQ s1667 1) (EQ s618 1) (EQ s251 ...], 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA BART-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-07 finished in 8674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 1 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 10063 edges and 6600 vertex of which 6468 / 6600 are part of one of the 49 SCC in 10 ms
Free SCC test removed 6419 places
Ensure Unique test removed 9849 transitions
Reduce isomorphic transitions removed 9849 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 177 place count 68 transition count 139
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 177 place count 68 transition count 134
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 187 place count 63 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 193 place count 57 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 199 place count 57 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 57 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 204 place count 53 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 208 place count 53 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 211 place count 50 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 214 place count 50 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 217 place count 47 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 220 place count 47 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 222 place count 45 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 45 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 226 place count 43 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 43 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 229 place count 42 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 42 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 244 place count 35 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 248 place count 35 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 33 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 256 place count 33 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 260 place count 31 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 264 place count 31 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 268 place count 29 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 272 place count 29 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 276 place count 27 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 280 place count 27 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 284 place count 25 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 288 place count 25 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 292 place count 23 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 296 place count 23 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 300 place count 21 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 304 place count 21 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 308 place count 19 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 312 place count 19 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 316 place count 17 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 320 place count 17 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 324 place count 15 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 328 place count 15 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 332 place count 13 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 336 place count 13 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 340 place count 11 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 344 place count 11 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 348 place count 9 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 352 place count 9 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 356 place count 7 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 360 place count 7 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 364 place count 5 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 368 place count 5 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 372 place count 3 transition count 9
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 377 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 379 place count 2 transition count 3
Applied a total of 379 rules in 77 ms. Remains 2 /6600 variables (removed 6598) and now considering 3/10100 (removed 10097) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:45:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:45:46] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:45:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:45:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-16 02:45:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:45:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:45:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/6600 places, 3/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/6600 places, 3/10100 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s0 1), p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-08 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(F((G(p1)||p0)))))))'
Support contains 3 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 10057 edges and 6600 vertex of which 6312 / 6600 are part of one of the 48 SCC in 3 ms
Free SCC test removed 6264 places
Ensure Unique test removed 9615 transitions
Reduce isomorphic transitions removed 9615 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 190 rules applied. Total rules applied 191 place count 289 transition count 295
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 338 place count 145 transition count 292
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 341 place count 144 transition count 290
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 344 place count 143 transition count 288
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 347 place count 142 transition count 286
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 349 place count 141 transition count 285
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 349 place count 141 transition count 276
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 367 place count 132 transition count 276
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 381 place count 118 transition count 262
Iterating global reduction 6 with 14 rules applied. Total rules applied 395 place count 118 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 399 place count 118 transition count 258
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 407 place count 110 transition count 250
Iterating global reduction 7 with 8 rules applied. Total rules applied 415 place count 110 transition count 250
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 421 place count 104 transition count 244
Iterating global reduction 7 with 6 rules applied. Total rules applied 427 place count 104 transition count 244
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 433 place count 98 transition count 238
Iterating global reduction 7 with 6 rules applied. Total rules applied 439 place count 98 transition count 238
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 443 place count 94 transition count 234
Iterating global reduction 7 with 4 rules applied. Total rules applied 447 place count 94 transition count 234
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 451 place count 90 transition count 230
Iterating global reduction 7 with 4 rules applied. Total rules applied 455 place count 90 transition count 230
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 457 place count 88 transition count 228
Iterating global reduction 7 with 2 rules applied. Total rules applied 459 place count 88 transition count 228
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 487 place count 74 transition count 214
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 495 place count 74 transition count 206
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 503 place count 70 transition count 202
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 511 place count 70 transition count 194
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 519 place count 66 transition count 190
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 527 place count 66 transition count 182
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 535 place count 62 transition count 178
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 543 place count 62 transition count 170
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 551 place count 58 transition count 166
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 559 place count 58 transition count 158
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 567 place count 54 transition count 154
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 575 place count 54 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 583 place count 50 transition count 142
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 591 place count 50 transition count 134
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 599 place count 46 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 607 place count 46 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 615 place count 42 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 623 place count 42 transition count 110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 631 place count 38 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 639 place count 38 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 647 place count 34 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 655 place count 34 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 663 place count 30 transition count 82
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 671 place count 30 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 679 place count 26 transition count 70
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 19 with 8 rules applied. Total rules applied 687 place count 26 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 695 place count 22 transition count 58
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 20 with 8 rules applied. Total rules applied 703 place count 22 transition count 50
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 711 place count 18 transition count 46
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 719 place count 18 transition count 38
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 727 place count 14 transition count 34
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 22 with 8 rules applied. Total rules applied 735 place count 14 transition count 26
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 743 place count 10 transition count 22
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 23 with 9 rules applied. Total rules applied 752 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 24 with 3 rules applied. Total rules applied 755 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 757 place count 8 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 757 place count 8 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 759 place count 7 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 760 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 760 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 762 place count 6 transition count 7
Applied a total of 762 rules in 74 ms. Remains 6 /6600 variables (removed 6594) and now considering 7/10100 (removed 10093) transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 02:45:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 02:45:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 02:45:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 02:45:46] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-16 02:45:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 02:45:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 02:45:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/6600 places, 7/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6600 places, 7/10100 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 0), p0:(OR (EQ s1 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-09 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(X(p0))))||G(F(p1))))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 1600 place count 5000 transition count 8500
Iterating global reduction 0 with 1600 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Discarding 1350 places :
Symmetric choice reduction at 0 with 1350 rule applications. Total rules 4550 place count 3650 transition count 7150
Iterating global reduction 0 with 1350 rules applied. Total rules applied 5900 place count 3650 transition count 7150
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6100 place count 3450 transition count 6950
Iterating global reduction 0 with 200 rules applied. Total rules applied 6300 place count 3450 transition count 6950
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6450 place count 3300 transition count 6800
Iterating global reduction 0 with 150 rules applied. Total rules applied 6600 place count 3300 transition count 6800
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6750 place count 3150 transition count 6650
Iterating global reduction 0 with 150 rules applied. Total rules applied 6900 place count 3150 transition count 6650
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7050 place count 3000 transition count 6500
Iterating global reduction 0 with 150 rules applied. Total rules applied 7200 place count 3000 transition count 6500
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7350 place count 2850 transition count 6350
Iterating global reduction 0 with 150 rules applied. Total rules applied 7500 place count 2850 transition count 6350
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7650 place count 2700 transition count 6200
Iterating global reduction 0 with 150 rules applied. Total rules applied 7800 place count 2700 transition count 6200
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7900 place count 2600 transition count 6100
Iterating global reduction 0 with 100 rules applied. Total rules applied 8000 place count 2600 transition count 6100
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8100 place count 2500 transition count 6000
Iterating global reduction 0 with 100 rules applied. Total rules applied 8200 place count 2500 transition count 6000
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8250 place count 2450 transition count 5950
Iterating global reduction 0 with 50 rules applied. Total rules applied 8300 place count 2450 transition count 5950
Applied a total of 8300 rules in 3506 ms. Remains 2450 /6600 variables (removed 4150) and now considering 5950/10100 (removed 4150) transitions.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:45:50] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-16 02:45:50] [INFO ] Implicit Places using invariants in 428 ms returned []
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:45:50] [INFO ] Computed 50 place invariants in 19 ms
[2022-05-16 02:45:51] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:45:51] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-16 02:45:54] [INFO ] Dead Transitions using invariants and state equation in 3290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2450/6600 places, 5950/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 2450/6600 places, 5950/10100 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s89 0), p1:(EQ s1125 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 5017 ms.
Product exploration explored 100000 steps with 25000 reset in 4619 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:46:08] [INFO ] Computed 50 place invariants in 27 ms
[2022-05-16 02:46:08] [INFO ] After 827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:46:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 55 ms returned sat
[2022-05-16 02:46:11] [INFO ] After 1656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 02:46:11] [INFO ] After 1955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-05-16 02:46:11] [INFO ] After 2666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 381 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 5950/5950 transitions.
Applied a total of 0 rules in 156 ms. Remains 2450 /2450 variables (removed 0) and now considering 5950/5950 (removed 0) transitions.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:46:12] [INFO ] Computed 50 place invariants in 16 ms
[2022-05-16 02:46:12] [INFO ] Implicit Places using invariants in 653 ms returned []
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:46:13] [INFO ] Computed 50 place invariants in 12 ms
[2022-05-16 02:46:14] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:46:14] [INFO ] Computed 50 place invariants in 16 ms
[2022-05-16 02:46:16] [INFO ] Dead Transitions using invariants and state equation in 2667 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2450/2450 places, 5950/5950 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) 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 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:46:20] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-16 02:46:20] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:46:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2022-05-16 02:46:22] [INFO ] After 1588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 02:46:23] [INFO ] After 1946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-05-16 02:46:23] [INFO ] After 2581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 418 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 4907 ms.
Product exploration explored 100000 steps with 25000 reset in 5102 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2450/2450 places, 5950/5950 transitions.
Graph (trivial) has 5944 edges and 2450 vertex of which 2400 / 2450 are part of one of the 49 SCC in 6 ms
Free SCC test removed 2351 places
Ensure Unique test removed 5780 transitions
Reduce isomorphic transitions removed 5780 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 51 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 49 place count 51 transition count 123
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 51 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 50 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 50 transition count 122
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 50 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 50 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 42 transition count 112
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 42 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 42 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 42 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 41 transition count 109
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 41 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 41 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 41 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 40 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 40 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 40 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 40 transition count 104
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 39 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 39 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 39 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 99 place count 39 transition count 101
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 100 place count 38 transition count 100
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 101 place count 38 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 102 place count 38 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 104 place count 38 transition count 98
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 105 place count 37 transition count 97
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 106 place count 37 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 107 place count 37 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 109 place count 37 transition count 95
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 110 place count 36 transition count 94
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 111 place count 36 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 112 place count 36 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 114 place count 36 transition count 92
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 115 place count 35 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 116 place count 35 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 117 place count 35 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 119 place count 35 transition count 89
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 120 place count 34 transition count 88
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 121 place count 34 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 122 place count 34 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 124 place count 34 transition count 86
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 125 place count 33 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 126 place count 33 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 127 place count 33 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 129 place count 33 transition count 83
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 130 place count 32 transition count 82
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 131 place count 32 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 132 place count 32 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 134 place count 32 transition count 80
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 135 place count 31 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 136 place count 31 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 137 place count 31 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 139 place count 31 transition count 77
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 140 place count 30 transition count 76
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 141 place count 30 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 142 place count 30 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 144 place count 30 transition count 74
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 145 place count 29 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 146 place count 29 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 147 place count 29 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 149 place count 29 transition count 71
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 150 place count 28 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 151 place count 28 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 152 place count 28 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 154 place count 28 transition count 68
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 155 place count 27 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 156 place count 27 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 157 place count 27 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 159 place count 27 transition count 65
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 160 place count 26 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 161 place count 26 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 162 place count 26 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 164 place count 26 transition count 62
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 165 place count 25 transition count 61
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 166 place count 25 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 167 place count 25 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 169 place count 25 transition count 59
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 170 place count 24 transition count 58
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 171 place count 24 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 172 place count 24 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 174 place count 24 transition count 56
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 175 place count 23 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 176 place count 23 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 177 place count 23 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 179 place count 23 transition count 53
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 180 place count 22 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 181 place count 22 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 182 place count 22 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 184 place count 22 transition count 50
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 185 place count 21 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 186 place count 21 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 187 place count 21 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 189 place count 21 transition count 47
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 190 place count 20 transition count 46
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 191 place count 20 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 192 place count 20 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 194 place count 20 transition count 44
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 195 place count 19 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 196 place count 19 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 197 place count 19 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 199 place count 19 transition count 41
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 200 place count 18 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 201 place count 18 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 202 place count 18 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 204 place count 18 transition count 38
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 205 place count 17 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 206 place count 17 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 207 place count 17 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 209 place count 17 transition count 35
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 210 place count 16 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 211 place count 16 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 212 place count 16 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 214 place count 16 transition count 32
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 215 place count 15 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 216 place count 15 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 217 place count 15 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 219 place count 15 transition count 29
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 220 place count 14 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 221 place count 14 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 222 place count 14 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 224 place count 14 transition count 26
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 225 place count 13 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 226 place count 13 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 227 place count 13 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 229 place count 13 transition count 23
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 230 place count 12 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 231 place count 12 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 232 place count 12 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 234 place count 12 transition count 20
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 235 place count 11 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 236 place count 11 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 237 place count 11 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 239 place count 11 transition count 17
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 240 place count 10 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 241 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 242 place count 10 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 244 place count 10 transition count 14
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 245 place count 9 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 246 place count 9 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 247 place count 9 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 249 place count 9 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 249 place count 9 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 250 place count 9 transition count 11
Discarding 4 places :
Symmetric choice reduction at 36 with 4 rule applications. Total rules 254 place count 5 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 36 with 4 rules applied. Total rules applied 258 place count 5 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 259 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 259 rules in 100 ms. Remains 5 /2450 variables (removed 2445) and now considering 6/5950 (removed 5944) transitions.
[2022-05-16 02:46:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 02:46:34] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:46:34] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2450 places, 6/5950 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2450 places, 6/5950 transitions.
Product exploration explored 100000 steps with 25000 reset in 3606 ms.
Product exploration explored 100000 steps with 25000 reset in 3263 ms.
Built C files in :
/tmp/ltsmin10497341633813647934
[2022-05-16 02:46:41] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10497341633813647934
Running compilation step : cd /tmp/ltsmin10497341633813647934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10497341633813647934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10497341633813647934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 5950/5950 transitions.
Applied a total of 0 rules in 511 ms. Remains 2450 /2450 variables (removed 0) and now considering 5950/5950 (removed 0) transitions.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:46:45] [INFO ] Computed 50 place invariants in 15 ms
[2022-05-16 02:46:45] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:46:45] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-16 02:46:47] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
// Phase 1: matrix 5950 rows 2450 cols
[2022-05-16 02:46:47] [INFO ] Computed 50 place invariants in 10 ms
[2022-05-16 02:46:51] [INFO ] Dead Transitions using invariants and state equation in 4132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2450/2450 places, 5950/5950 transitions.
Built C files in :
/tmp/ltsmin9513608475695735982
[2022-05-16 02:46:51] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9513608475695735982
Running compilation step : cd /tmp/ltsmin9513608475695735982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9513608475695735982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9513608475695735982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:46:55] [INFO ] Flatten gal took : 80 ms
[2022-05-16 02:46:55] [INFO ] Flatten gal took : 228 ms
[2022-05-16 02:46:55] [INFO ] Time to serialize gal into /tmp/LTL8760766749724235105.gal : 10 ms
[2022-05-16 02:46:55] [INFO ] Time to serialize properties into /tmp/LTL10209277153399452914.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8760766749724235105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10209277153399452914.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8760766...267
Read 1 LTL properties
Checking formula 0 : !(((X(F(X(X("(TrainState_40_1_1==0)")))))||(G(F("(TrainState_26_1_19==0)")))))
Formula 0 simplified : !(XFXX"(TrainState_40_1_1==0)" | GF"(TrainState_26_1_19==0)")
Detected timeout of ITS tools.
[2022-05-16 02:47:10] [INFO ] Flatten gal took : 86 ms
[2022-05-16 02:47:10] [INFO ] Applying decomposition
[2022-05-16 02:47:10] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3966954292189138766.txt' '-o' '/tmp/graph3966954292189138766.bin' '-w' '/tmp/graph3966954292189138766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3966954292189138766.bin' '-l' '-1' '-v' '-w' '/tmp/graph3966954292189138766.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:47:10] [INFO ] Decomposing Gal with order
[2022-05-16 02:47:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:47:10] [INFO ] Removed a total of 1889 redundant transitions.
[2022-05-16 02:47:11] [INFO ] Flatten gal took : 196 ms
[2022-05-16 02:47:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1079 labels/synchronizations in 17 ms.
[2022-05-16 02:47:11] [INFO ] Time to serialize gal into /tmp/LTL7555824773822461942.gal : 31 ms
[2022-05-16 02:47:11] [INFO ] Time to serialize properties into /tmp/LTL1206013339004175597.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7555824773822461942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1206013339004175597.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7555824...245
Read 1 LTL properties
Checking formula 0 : !(((X(F(X(X("(i26.u41.TrainState_40_1_1==0)")))))||(G(F("(i33.u244.TrainState_26_1_19==0)")))))
Formula 0 simplified : !(XFXX"(i26.u41.TrainState_40_1_1==0)" | GF"(i33.u244.TrainState_26_1_19==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
69 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.0303,45224,1,0,4509,1011,2303,3932,545,2004,9866
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-050-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-050-LTLFireability-10 finished in 85658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X((F(p1)&&p0)) U (p2 U p3)))'
Support contains 3 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 6095 place count 3453 transition count 6953
Iterating global reduction 0 with 199 rules applied. Total rules applied 6294 place count 3453 transition count 6953
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6444 place count 3303 transition count 6803
Iterating global reduction 0 with 150 rules applied. Total rules applied 6594 place count 3303 transition count 6803
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6744 place count 3153 transition count 6653
Iterating global reduction 0 with 150 rules applied. Total rules applied 6894 place count 3153 transition count 6653
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7044 place count 3003 transition count 6503
Iterating global reduction 0 with 150 rules applied. Total rules applied 7194 place count 3003 transition count 6503
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7343 place count 2854 transition count 6354
Iterating global reduction 0 with 149 rules applied. Total rules applied 7492 place count 2854 transition count 6354
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7641 place count 2705 transition count 6205
Iterating global reduction 0 with 149 rules applied. Total rules applied 7790 place count 2705 transition count 6205
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7889 place count 2606 transition count 6106
Iterating global reduction 0 with 99 rules applied. Total rules applied 7988 place count 2606 transition count 6106
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8087 place count 2507 transition count 6007
Iterating global reduction 0 with 99 rules applied. Total rules applied 8186 place count 2507 transition count 6007
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 8235 place count 2458 transition count 5958
Iterating global reduction 0 with 49 rules applied. Total rules applied 8284 place count 2458 transition count 5958
Applied a total of 8284 rules in 2897 ms. Remains 2458 /6600 variables (removed 4142) and now considering 5958/10100 (removed 4142) transitions.
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:15] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-16 02:47:15] [INFO ] Implicit Places using invariants in 441 ms returned []
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:15] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-16 02:47:16] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:16] [INFO ] Computed 50 place invariants in 37 ms
[2022-05-16 02:47:19] [INFO ] Dead Transitions using invariants and state equation in 2540 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2458/6600 places, 5958/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 2458/6600 places, 5958/10100 transitions.
Stuttering acceptance computed with spot in 222 ms :[p3, true, p3, (AND p0 p1 p3), p1, (AND p1 p3)]
Running random walk in product with property : BART-PT-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(AND p3 p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p3 p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s700 1), p2:(NEQ s731 1), p0:(AND (EQ s731 1) (EQ s48 1)), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1330 steps with 2 reset in 11 ms.
FORMULA BART-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-11 finished in 7307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U G(!p1)))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 10096 edges and 6600 vertex of which 6336 / 6600 are part of one of the 48 SCC in 5 ms
Free SCC test removed 6288 places
Ensure Unique test removed 9648 transitions
Reduce isomorphic transitions removed 9648 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 175 rules applied. Total rules applied 176 place count 264 transition count 277
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 304 place count 136 transition count 277
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 304 place count 136 transition count 269
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 320 place count 128 transition count 269
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 332 place count 116 transition count 257
Iterating global reduction 2 with 12 rules applied. Total rules applied 344 place count 116 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 346 place count 116 transition count 255
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 354 place count 108 transition count 247
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 108 transition count 247
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 368 place count 102 transition count 241
Iterating global reduction 3 with 6 rules applied. Total rules applied 374 place count 102 transition count 241
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 380 place count 96 transition count 235
Iterating global reduction 3 with 6 rules applied. Total rules applied 386 place count 96 transition count 235
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 390 place count 92 transition count 231
Iterating global reduction 3 with 4 rules applied. Total rules applied 394 place count 92 transition count 231
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 398 place count 88 transition count 227
Iterating global reduction 3 with 4 rules applied. Total rules applied 402 place count 88 transition count 227
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 404 place count 86 transition count 225
Iterating global reduction 3 with 2 rules applied. Total rules applied 406 place count 86 transition count 225
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 434 place count 72 transition count 211
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 442 place count 72 transition count 203
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 450 place count 68 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 458 place count 68 transition count 191
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 466 place count 64 transition count 187
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 474 place count 64 transition count 179
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 482 place count 60 transition count 175
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 490 place count 60 transition count 167
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 498 place count 56 transition count 163
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 506 place count 56 transition count 155
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 514 place count 52 transition count 151
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 522 place count 52 transition count 143
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 530 place count 48 transition count 139
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 538 place count 48 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 546 place count 44 transition count 127
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 554 place count 44 transition count 119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 562 place count 40 transition count 115
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 570 place count 40 transition count 107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 578 place count 36 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 586 place count 36 transition count 95
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 594 place count 32 transition count 91
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 602 place count 32 transition count 83
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 610 place count 28 transition count 79
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 618 place count 28 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 626 place count 24 transition count 67
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 634 place count 24 transition count 59
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 642 place count 20 transition count 55
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 650 place count 20 transition count 47
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 658 place count 16 transition count 43
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 666 place count 16 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 674 place count 12 transition count 31
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 682 place count 12 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 690 place count 8 transition count 19
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 19 with 10 rules applied. Total rules applied 700 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 704 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 2 Pre rules applied. Total rules applied 704 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 708 place count 4 transition count 5
Applied a total of 708 rules in 66 ms. Remains 4 /6600 variables (removed 6596) and now considering 5/10100 (removed 10095) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:47:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:47:19] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:47:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:47:19] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-05-16 02:47:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:47:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:47:19] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/6600 places, 5/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/6600 places, 5/10100 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, true, p1]
Running random walk in product with property : BART-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BART-PT-050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-12 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(F((F(p0)||p0)))))'
Support contains 1 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6096 place count 3452 transition count 6952
Iterating global reduction 0 with 200 rules applied. Total rules applied 6296 place count 3452 transition count 6952
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6446 place count 3302 transition count 6802
Iterating global reduction 0 with 150 rules applied. Total rules applied 6596 place count 3302 transition count 6802
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6745 place count 3153 transition count 6653
Iterating global reduction 0 with 149 rules applied. Total rules applied 6894 place count 3153 transition count 6653
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7043 place count 3004 transition count 6504
Iterating global reduction 0 with 149 rules applied. Total rules applied 7192 place count 3004 transition count 6504
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7341 place count 2855 transition count 6355
Iterating global reduction 0 with 149 rules applied. Total rules applied 7490 place count 2855 transition count 6355
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7639 place count 2706 transition count 6206
Iterating global reduction 0 with 149 rules applied. Total rules applied 7788 place count 2706 transition count 6206
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7887 place count 2607 transition count 6107
Iterating global reduction 0 with 99 rules applied. Total rules applied 7986 place count 2607 transition count 6107
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8085 place count 2508 transition count 6008
Iterating global reduction 0 with 99 rules applied. Total rules applied 8184 place count 2508 transition count 6008
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8234 place count 2458 transition count 5958
Iterating global reduction 0 with 50 rules applied. Total rules applied 8284 place count 2458 transition count 5958
Applied a total of 8284 rules in 2953 ms. Remains 2458 /6600 variables (removed 4142) and now considering 5958/10100 (removed 4142) transitions.
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:22] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-16 02:47:23] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:23] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-16 02:47:24] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:24] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-16 02:47:27] [INFO ] Dead Transitions using invariants and state equation in 2757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2458/6600 places, 5958/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 2458/6600 places, 5958/10100 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, p0, p0]
Running random walk in product with property : BART-PT-050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s800 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 946 steps with 0 reset in 14 ms.
FORMULA BART-PT-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-13 finished in 7384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U p1)))'
Support contains 1 out of 6600 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 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 10094 edges and 6600 vertex of which 6466 / 6600 are part of one of the 49 SCC in 4 ms
Free SCC test removed 6417 places
Ensure Unique test removed 9845 transitions
Reduce isomorphic transitions removed 9845 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 135 transition count 144
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 177 place count 71 transition count 143
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 179 place count 70 transition count 142
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 179 place count 70 transition count 138
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 187 place count 66 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 193 place count 60 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 199 place count 60 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 60 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 204 place count 56 transition count 127
Iterating global reduction 4 with 4 rules applied. Total rules applied 208 place count 56 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 211 place count 53 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 214 place count 53 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 217 place count 50 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 220 place count 50 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 222 place count 48 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 48 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 46 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 46 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 229 place count 45 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 45 transition count 116
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 244 place count 38 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 248 place count 38 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 252 place count 36 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 256 place count 36 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 260 place count 34 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 264 place count 34 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 268 place count 32 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 272 place count 32 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 276 place count 30 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 280 place count 30 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 284 place count 28 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 288 place count 28 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 292 place count 26 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 296 place count 26 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 300 place count 24 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 304 place count 24 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 308 place count 22 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 312 place count 22 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 316 place count 20 transition count 55
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 320 place count 20 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 324 place count 18 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 328 place count 18 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 332 place count 16 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 336 place count 16 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 340 place count 14 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 344 place count 14 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 348 place count 12 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 352 place count 12 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 356 place count 10 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 360 place count 10 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 364 place count 8 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 368 place count 8 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 372 place count 6 transition count 13
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 20 with 5 rules applied. Total rules applied 377 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 379 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 379 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 381 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 382 place count 4 transition count 5
Applied a total of 382 rules in 59 ms. Remains 4 /6600 variables (removed 6596) and now considering 5/10100 (removed 10095) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:47:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:47:27] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:47:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:47:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-16 02:47:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:47:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:47:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/6600 places, 5/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/6600 places, 5/10100 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1)]
Running random walk in product with property : BART-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-14 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6096 place count 3452 transition count 6952
Iterating global reduction 0 with 200 rules applied. Total rules applied 6296 place count 3452 transition count 6952
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6446 place count 3302 transition count 6802
Iterating global reduction 0 with 150 rules applied. Total rules applied 6596 place count 3302 transition count 6802
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6745 place count 3153 transition count 6653
Iterating global reduction 0 with 149 rules applied. Total rules applied 6894 place count 3153 transition count 6653
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7043 place count 3004 transition count 6504
Iterating global reduction 0 with 149 rules applied. Total rules applied 7192 place count 3004 transition count 6504
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7341 place count 2855 transition count 6355
Iterating global reduction 0 with 149 rules applied. Total rules applied 7490 place count 2855 transition count 6355
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7639 place count 2706 transition count 6206
Iterating global reduction 0 with 149 rules applied. Total rules applied 7788 place count 2706 transition count 6206
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7887 place count 2607 transition count 6107
Iterating global reduction 0 with 99 rules applied. Total rules applied 7986 place count 2607 transition count 6107
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8085 place count 2508 transition count 6008
Iterating global reduction 0 with 99 rules applied. Total rules applied 8184 place count 2508 transition count 6008
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8234 place count 2458 transition count 5958
Iterating global reduction 0 with 50 rules applied. Total rules applied 8284 place count 2458 transition count 5958
Applied a total of 8284 rules in 2523 ms. Remains 2458 /6600 variables (removed 4142) and now considering 5958/10100 (removed 4142) transitions.
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:30] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-16 02:47:30] [INFO ] Implicit Places using invariants in 507 ms returned []
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:30] [INFO ] Computed 50 place invariants in 27 ms
[2022-05-16 02:47:32] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:32] [INFO ] Computed 50 place invariants in 18 ms
[2022-05-16 02:47:35] [INFO ] Dead Transitions using invariants and state equation in 3203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2458/6600 places, 5958/10100 transitions.
Finished structural reductions, in 1 iterations. Remains : 2458/6600 places, 5958/10100 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s800 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24 reset in 872 ms.
Product exploration explored 100000 steps with 23 reset in 895 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2226 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=55 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 5958 rows 2458 cols
[2022-05-16 02:47:41] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-16 02:47:43] [INFO ] [Real]Absence check using 50 positive place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 44 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-050-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-050-LTLFireability-15 finished in 15557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)||F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((p0&&(F((G(X(p1)) U p2))||p3)))))'
[2022-05-16 02:47:43] [INFO ] Flatten gal took : 339 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17095397997274707012
[2022-05-16 02:47:43] [INFO ] Too many transitions (10100) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:47:43] [INFO ] Applying decomposition
[2022-05-16 02:47:43] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17095397997274707012
Running compilation step : cd /tmp/ltsmin17095397997274707012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 02:47:44] [INFO ] Flatten gal took : 175 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11232077784971629388.txt' '-o' '/tmp/graph11232077784971629388.bin' '-w' '/tmp/graph11232077784971629388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11232077784971629388.bin' '-l' '-1' '-v' '-w' '/tmp/graph11232077784971629388.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:47:44] [INFO ] Decomposing Gal with order
[2022-05-16 02:47:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:47:47] [INFO ] Removed a total of 659 redundant transitions.
[2022-05-16 02:47:47] [INFO ] Flatten gal took : 409 ms
[2022-05-16 02:47:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2022-05-16 02:47:54] [INFO ] Time to serialize gal into /tmp/LTLFireability869515127254773157.gal : 48 ms
[2022-05-16 02:47:54] [INFO ] Time to serialize properties into /tmp/LTLFireability3388226554267667860.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability869515127254773157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3388226554267667860.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 2 LTL properties
Checking formula 0 : !((G(X((F("(((((((i11.i0.u7.TrainState_15_1_1==1)||(i2.i0.u8.TrainState_17_1_1==1))||((i12.i0.u30.TrainState_19_1_1==1)||(i36.i0.u9.Tr...133562
Formula 0 simplified : !GX(F"(((((((i11.i0.u7.TrainState_15_1_1==1)||(i2.i0.u8.TrainState_17_1_1==1))||((i12.i0.u30.TrainState_19_1_1==1)||(i36.i0.u9.Train...133551
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 58781 ms.
Running link step : cd /tmp/ltsmin17095397997274707012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 178 ms.
Running LTSmin : cd /tmp/ltsmin17095397997274707012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((<>((LTLAPp0==true))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 03:14:07] [INFO ] Applying decomposition
[2022-05-16 03:14:08] [INFO ] Flatten gal took : 481 ms
[2022-05-16 03:14:08] [INFO ] Decomposing Gal with order
[2022-05-16 03:14:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:14:10] [INFO ] Removed a total of 1519 redundant transitions.
[2022-05-16 03:14:10] [INFO ] Flatten gal took : 826 ms
[2022-05-16 03:14:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 496 labels/synchronizations in 212 ms.
[2022-05-16 03:14:11] [INFO ] Time to serialize gal into /tmp/LTLFireability10589631050943373794.gal : 99 ms
[2022-05-16 03:14:11] [INFO ] Time to serialize properties into /tmp/LTLFireability11824587679538336622.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10589631050943373794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11824587679538336622.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((G(X((F("(((((((u198.TrainState_15_1_1==1)||(u200.TrainState_17_1_1==1))||((u202.TrainState_19_1_1==1)||(u207.TrainState_21_1_1==1))...108835
Formula 0 simplified : !GX(F"(((((((u198.TrainState_15_1_1==1)||(u200.TrainState_17_1_1==1))||((u202.TrainState_19_1_1==1)||(u207.TrainState_21_1_1==1)))||...108824
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin17095397997274707012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((<>((LTLAPp0==true))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17095397997274707012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(((LTLAPp2==true)&&(<>(([](X((LTLAPp3==true))) U (LTLAPp0==true)))||(LTLAPp4==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-050, 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 r006-tajo-165245689600644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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