Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.3K Apr 30 07:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 07:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 07:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 07:13 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 3.6K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 73K 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 CircularTrains-PT-096-LTLFireability-00
FORMULA_NAME CircularTrains-PT-096-LTLFireability-01
FORMULA_NAME CircularTrains-PT-096-LTLFireability-02
FORMULA_NAME CircularTrains-PT-096-LTLFireability-03
FORMULA_NAME CircularTrains-PT-096-LTLFireability-04
FORMULA_NAME CircularTrains-PT-096-LTLFireability-05
FORMULA_NAME CircularTrains-PT-096-LTLFireability-06
FORMULA_NAME CircularTrains-PT-096-LTLFireability-07
FORMULA_NAME CircularTrains-PT-096-LTLFireability-08
FORMULA_NAME CircularTrains-PT-096-LTLFireability-09
FORMULA_NAME CircularTrains-PT-096-LTLFireability-10
FORMULA_NAME CircularTrains-PT-096-LTLFireability-11
FORMULA_NAME CircularTrains-PT-096-LTLFireability-12
FORMULA_NAME CircularTrains-PT-096-LTLFireability-13
FORMULA_NAME CircularTrains-PT-096-LTLFireability-14
FORMULA_NAME CircularTrains-PT-096-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652682293695

Running Version 202205111006
[2022-05-16 06:24:54] [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 06:24:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:24:55] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-05-16 06:24:55] [INFO ] Transformed 192 places.
[2022-05-16 06:24:55] [INFO ] Transformed 96 transitions.
[2022-05-16 06:24:55] [INFO ] Parsed PT model containing 192 places and 96 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-096-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 96/96 transitions.
Applied a total of 0 rules in 20 ms. Remains 192 /192 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 192 cols
[2022-05-16 06:24:55] [INFO ] Computed 97 place invariants in 22 ms
[2022-05-16 06:24:55] [INFO ] Implicit Places using invariants in 278 ms returned [1, 5, 8, 14, 20, 27, 29, 37, 39, 49, 115, 116, 123, 144, 155, 164, 166, 168, 174, 177, 182, 183, 185, 186, 189]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 306 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/192 places, 96/96 transitions.
Applied a total of 0 rules in 8 ms. Remains 167 /167 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 167/192 places, 96/96 transitions.
Support contains 44 out of 167 places after structural reductions.
[2022-05-16 06:24:55] [INFO ] Flatten gal took : 35 ms
[2022-05-16 06:24:55] [INFO ] Flatten gal took : 14 ms
[2022-05-16 06:24:55] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 42 out of 167 places (down from 44) after GAL structural reductions.
Finished random walk after 114 steps, including 0 resets, run visited all 21 properties in 38 ms. (steps per millisecond=3 )
FORMULA CircularTrains-PT-096-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(p0)))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Applied a total of 0 rules in 11 ms. Remains 167 /167 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 167 cols
[2022-05-16 06:24:56] [INFO ] Computed 72 place invariants in 8 ms
[2022-05-16 06:24:56] [INFO ] Implicit Places using invariants in 116 ms returned [3, 7, 99, 112, 147, 158, 163]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 118 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/167 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/167 places, 96/96 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s37 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CircularTrains-PT-096-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-00 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 167 /167 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 167 cols
[2022-05-16 06:24:56] [INFO ] Computed 72 place invariants in 4 ms
[2022-05-16 06:24:56] [INFO ] Implicit Places using invariants in 105 ms returned [3, 99, 112, 147, 158, 163]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 106 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/167 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/167 places, 96/96 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 35603 reset in 486 ms.
Product exploration explored 100000 steps with 35086 reset in 470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:24:58] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-16 06:24:58] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:24:58] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:24:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:24:58] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:58] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 35601 reset in 359 ms.
Product exploration explored 100000 steps with 35824 reset in 357 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 24 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2022-05-16 06:25:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:25:00] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:25:00] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 96/96 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 96/96 transitions.
Product exploration explored 100000 steps with 36465 reset in 894 ms.
Product exploration explored 100000 steps with 36720 reset in 902 ms.
Built C files in :
/tmp/ltsmin13543053713465232119
[2022-05-16 06:25:02] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13543053713465232119
Running compilation step : cd /tmp/ltsmin13543053713465232119;'/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'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin13543053713465232119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13543053713465232119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14125001640992102006.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:25:17] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-16 06:25:17] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:25:17] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-16 06:25:17] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:25:17] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:25:17] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin10389098082761162652
[2022-05-16 06:25:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10389098082761162652
Running compilation step : cd /tmp/ltsmin10389098082761162652;'/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'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin10389098082761162652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10389098082761162652;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5865361194813542824.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:25:32] [INFO ] Flatten gal took : 8 ms
[2022-05-16 06:25:32] [INFO ] Flatten gal took : 8 ms
[2022-05-16 06:25:32] [INFO ] Time to serialize gal into /tmp/LTL5282132220477326301.gal : 3 ms
[2022-05-16 06:25:32] [INFO ] Time to serialize properties into /tmp/LTL6692457961916302769.ltl : 1 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/LTL5282132220477326301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6692457961916302769.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/LTL5282132...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((F32<1)||(Section_31<1))"))))
Formula 0 simplified : !XF"((F32<1)||(Section_31<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:25:47] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:25:47] [INFO ] Applying decomposition
[2022-05-16 06:25:47] [INFO ] Flatten gal took : 8 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/graph7039123176200626259.txt' '-o' '/tmp/graph7039123176200626259.bin' '-w' '/tmp/graph7039123176200626259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7039123176200626259.bin' '-l' '-1' '-v' '-w' '/tmp/graph7039123176200626259.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:25:47] [INFO ] Decomposing Gal with order
[2022-05-16 06:25:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:25:47] [INFO ] Flatten gal took : 51 ms
[2022-05-16 06:25:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 06:25:47] [INFO ] Time to serialize gal into /tmp/LTL16809224866752211050.gal : 2 ms
[2022-05-16 06:25:47] [INFO ] Time to serialize properties into /tmp/LTL5217770207622660738.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/LTL16809224866752211050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5217770207622660738.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/LTL1680922...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i8.u26.F32<1)||(i8.u26.Section_31<1))"))))
Formula 0 simplified : !XF"((i8.u26.F32<1)||(i8.u26.Section_31<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15298470638490688110
[2022-05-16 06:26:02] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15298470638490688110
Running compilation step : cd /tmp/ltsmin15298470638490688110;'/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'
Compilation finished in 189 ms.
Running link step : cd /tmp/ltsmin15298470638490688110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15298470638490688110;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-096-LTLFireability-01 finished in 81500 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 167 transition count 77
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 148 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 38 place count 148 transition count 72
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 48 place count 143 transition count 72
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 2 with 8 rules applied. Total rules applied 56 place count 139 transition count 68
Applied a total of 56 rules in 16 ms. Remains 139 /167 variables (removed 28) and now considering 68/96 (removed 28) transitions.
// Phase 1: matrix 68 rows 139 cols
[2022-05-16 06:26:18] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-16 06:26:18] [INFO ] Implicit Places using invariants in 220 ms returned [3, 7, 83, 95, 131, 136]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 221 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/167 places, 68/96 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 131 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 130 transition count 65
Applied a total of 6 rules in 6 ms. Remains 130 /133 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:18] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:26:18] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:18] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:18] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/167 places, 65/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 130/167 places, 65/96 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), 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:(AND (GEQ s0 1) (GEQ s117 1)), p0:(AND (GEQ s21 1) (GEQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 362 ms.
Product exploration explored 100000 steps with 0 reset in 474 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:20] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:26:20] [INFO ] [Real]Absence check using 62 positive place invariants in 11 ms returned sat
[2022-05-16 06:26:20] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-16 06:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:26:20] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-05-16 06:26:20] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 06:26:20] [INFO ] Added : 30 causal constraints over 6 iterations in 92 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:20] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:20] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:20] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:26:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-05-16 06:26:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:20] [INFO ] Computed 66 place invariants in 8 ms
[2022-05-16 06:26:20] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:21] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:21] [INFO ] [Real]Absence check using 62 positive place invariants in 10 ms returned sat
[2022-05-16 06:26:21] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-16 06:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:26:21] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-16 06:26:21] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 06:26:21] [INFO ] Added : 30 causal constraints over 6 iterations in 79 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 350 ms.
Product exploration explored 100000 steps with 0 reset in 448 ms.
Built C files in :
/tmp/ltsmin3624179517356194662
[2022-05-16 06:26:22] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 06:26:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:22] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 06:26:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:22] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 06:26:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:22] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3624179517356194662
Running compilation step : cd /tmp/ltsmin3624179517356194662;'/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'
Compilation finished in 173 ms.
Running link step : cd /tmp/ltsmin3624179517356194662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3624179517356194662;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17006931303599361737.hoa' '--buchi-type=spotba'
LTSmin run took 127 ms.
FORMULA CircularTrains-PT-096-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-02 finished in 4999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 167 cols
[2022-05-16 06:26:23] [INFO ] Computed 72 place invariants in 2 ms
[2022-05-16 06:26:23] [INFO ] Implicit Places using invariants in 101 ms returned [3, 7, 99, 112, 147, 158, 163]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 103 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/167 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/167 places, 96/96 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s89 1) (GEQ s132 1) (OR (LT s110 1) (LT s129 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1249 reset in 400 ms.
Product exploration explored 100000 steps with 1277 reset in 537 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 77 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:26:24] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:26:24] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2022-05-16 06:26:24] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-16 06:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:26:24] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-16 06:26:24] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 06:26:24] [INFO ] Added : 61 causal constraints over 13 iterations in 194 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 160 transition count 68
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 132 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 56 place count 132 transition count 64
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 128 transition count 64
Applied a total of 64 rules in 14 ms. Remains 128 /160 variables (removed 32) and now considering 64/96 (removed 32) transitions.
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:26:24] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:26:25] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:26:25] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:26:25] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2022-05-16 06:26:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:26:25] [INFO ] Computed 65 place invariants in 0 ms
[2022-05-16 06:26:25] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/160 places, 64/96 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/160 places, 64/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:26:25] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:26:25] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-16 06:26:25] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 8 ms returned sat
[2022-05-16 06:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:26:25] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-16 06:26:25] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 06:26:25] [INFO ] Added : 30 causal constraints over 6 iterations in 83 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2269 reset in 399 ms.
Product exploration explored 100000 steps with 2235 reset in 429 ms.
Built C files in :
/tmp/ltsmin574529629339276949
[2022-05-16 06:26:26] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-16 06:26:26] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:26] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-16 06:26:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:26] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-16 06:26:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin574529629339276949
Running compilation step : cd /tmp/ltsmin574529629339276949;'/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'
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin574529629339276949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin574529629339276949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14292145717664286756.hoa' '--buchi-type=spotba'
LTSmin run took 95 ms.
FORMULA CircularTrains-PT-096-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-04 finished in 4073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 167 transition count 75
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 146 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 146 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 142 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 2 with 8 rules applied. Total rules applied 58 place count 138 transition count 67
Applied a total of 58 rules in 11 ms. Remains 138 /167 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 138 cols
[2022-05-16 06:26:27] [INFO ] Computed 72 place invariants in 0 ms
[2022-05-16 06:26:27] [INFO ] Implicit Places using invariants in 89 ms returned [2, 6, 82, 94, 122, 135]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/167 places, 67/96 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 5 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:27] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:27] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:27] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:27] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/167 places, 65/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 130/167 places, 65/96 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s123 1) (GEQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4132 reset in 407 ms.
Product exploration explored 100000 steps with 4071 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:28] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:26:28] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2022-05-16 06:26:28] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-16 06:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:26:28] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-05-16 06:26:28] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 06:26:28] [INFO ] Added : 30 causal constraints over 6 iterations in 81 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:28] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:26:28] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:28] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:26:29] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2022-05-16 06:26:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:29] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:29] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:29] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:26:29] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2022-05-16 06:26:29] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-16 06:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:26:29] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-16 06:26:29] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 06:26:29] [INFO ] Added : 30 causal constraints over 6 iterations in 79 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4158 reset in 391 ms.
Product exploration explored 100000 steps with 4161 reset in 423 ms.
Built C files in :
/tmp/ltsmin14304816628465284651
[2022-05-16 06:26:30] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 06:26:30] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:30] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 06:26:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:30] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 06:26:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14304816628465284651
Running compilation step : cd /tmp/ltsmin14304816628465284651;'/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'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin14304816628465284651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14304816628465284651;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10138398484437630787.hoa' '--buchi-type=spotba'
LTSmin run took 102 ms.
FORMULA CircularTrains-PT-096-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-05 finished in 3872 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0 U p1))||(X(p2)&&p3))))'
Support contains 8 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 167 /167 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 167 cols
[2022-05-16 06:26:30] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-16 06:26:31] [INFO ] Implicit Places using invariants in 94 ms returned [7, 112, 147, 158, 163]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 95 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/167 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 162/167 places, 96/96 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), true]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(OR (LT s23 1) (LT s79 1)), p1:(AND (GEQ s42 1) (GEQ s98 1)), p0:(AND (GEQ s106 1) (GEQ s149 1)), p2:(AND (GEQ s3 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-096-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-07 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((X(X(F(X(F(G(p0))))))||F(p1))))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 167 transition count 76
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 147 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 146 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 42 place count 146 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 50 place count 142 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 3 with 8 rules applied. Total rules applied 58 place count 138 transition count 67
Applied a total of 58 rules in 15 ms. Remains 138 /167 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 138 cols
[2022-05-16 06:26:31] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-16 06:26:31] [INFO ] Implicit Places using invariants in 85 ms returned [2, 6, 82, 122, 130, 135]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 87 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/167 places, 67/96 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 4 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:31] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:26:31] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:31] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:26:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/167 places, 65/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 130/167 places, 65/96 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s64 1) (GEQ s67 1)), p1:(AND (GEQ s91 1) (GEQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1491 reset in 402 ms.
Product exploration explored 100000 steps with 1469 reset in 425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:33] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:33] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:33] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:26:33] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2022-05-16 06:26:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:33] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:26:33] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1465 reset in 401 ms.
Product exploration explored 100000 steps with 1480 reset in 434 ms.
Built C files in :
/tmp/ltsmin17442614292457355689
[2022-05-16 06:26:34] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 06:26:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:35] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 06:26:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:35] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 06:26:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:35] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17442614292457355689
Running compilation step : cd /tmp/ltsmin17442614292457355689;'/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'
Compilation finished in 173 ms.
Running link step : cd /tmp/ltsmin17442614292457355689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17442614292457355689;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2003898013541795342.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:50] [INFO ] Computed 66 place invariants in 13 ms
[2022-05-16 06:26:50] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:50] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:50] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-05-16 06:26:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:26:50] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:26:50] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin8349985684239069779
[2022-05-16 06:26:50] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 06:26:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:50] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 06:26:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:50] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 06:26:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:26:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8349985684239069779
Running compilation step : cd /tmp/ltsmin8349985684239069779;'/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'
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin8349985684239069779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8349985684239069779;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11226592261959496574.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:27:05] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:27:05] [INFO ] Flatten gal took : 5 ms
[2022-05-16 06:27:05] [INFO ] Time to serialize gal into /tmp/LTL9617758780406826038.gal : 1 ms
[2022-05-16 06:27:05] [INFO ] Time to serialize properties into /tmp/LTL15370890308996566014.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/LTL9617758780406826038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15370890308996566014.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/LTL9617758...267
Read 1 LTL properties
Checking formula 0 : !((G(X(F((X(X(F(X(F(G("((F91>=1)&&(Section_90>=1))")))))))||(F("((F8>=1)&&(Section_7>=1))")))))))
Formula 0 simplified : !GXF(XXFXFG"((F91>=1)&&(Section_90>=1))" | F"((F8>=1)&&(Section_7>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:27:20] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:27:20] [INFO ] Applying decomposition
[2022-05-16 06:27:20] [INFO ] Flatten gal took : 7 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/graph7535319307522400648.txt' '-o' '/tmp/graph7535319307522400648.bin' '-w' '/tmp/graph7535319307522400648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7535319307522400648.bin' '-l' '-1' '-v' '-w' '/tmp/graph7535319307522400648.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:27:20] [INFO ] Decomposing Gal with order
[2022-05-16 06:27:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:27:20] [INFO ] Flatten gal took : 19 ms
[2022-05-16 06:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:27:20] [INFO ] Time to serialize gal into /tmp/LTL9569870057398566929.gal : 3 ms
[2022-05-16 06:27:20] [INFO ] Time to serialize properties into /tmp/LTL14597499713488440964.ltl : 1 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/LTL9569870057398566929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14597499713488440964.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/LTL9569870...246
Read 1 LTL properties
Checking formula 0 : !((G(X(F((X(X(F(X(F(G("((i0.i1.u29.F91>=1)&&(i0.i1.u32.Section_90>=1))")))))))||(F("((i9.u55.F8>=1)&&(i9.u55.Section_7>=1))")))))))
Formula 0 simplified : !GXF(XXFXFG"((i0.i1.u29.F91>=1)&&(i0.i1.u32.Section_90>=1))" | F"((i9.u55.F8>=1)&&(i9.u55.Section_7>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4050602926636855595
[2022-05-16 06:27:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4050602926636855595
Running compilation step : cd /tmp/ltsmin4050602926636855595;'/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'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin4050602926636855595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin4050602926636855595;'/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(<>((X(X(<>(X(<>([]((LTLAPp0==true)))))))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-096-LTLFireability-08 finished in 79565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||(!(F(p0) U p1)&&!p1)))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 167 transition count 77
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 148 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 146 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 42 place count 146 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 50 place count 142 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 3 with 8 rules applied. Total rules applied 58 place count 138 transition count 67
Applied a total of 58 rules in 12 ms. Remains 138 /167 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 138 cols
[2022-05-16 06:27:50] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-16 06:27:50] [INFO ] Implicit Places using invariants in 93 ms returned [2, 6, 82, 94, 122, 130, 135]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 93 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/167 places, 67/96 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 64
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 4 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:27:50] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:27:50] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:27:50] [INFO ] Computed 65 place invariants in 0 ms
[2022-05-16 06:27:51] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/167 places, 64/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 128/167 places, 64/96 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s50 1) (GEQ s55 1)), p1:(AND (GEQ s54 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 356 ms.
Product exploration explored 100000 steps with 0 reset in 516 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), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 311 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 50 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 376 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:27:52] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:27:53] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:27:53] [INFO ] Computed 65 place invariants in 0 ms
[2022-05-16 06:27:53] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2022-05-16 06:27:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-16 06:27:53] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:27:53] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 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), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 303 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 37 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 444 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 344 ms.
Product exploration explored 100000 steps with 0 reset in 436 ms.
Built C files in :
/tmp/ltsmin15284151974287935395
[2022-05-16 06:27:55] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-16 06:27:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:27:55] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-16 06:27:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:27:55] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-16 06:27:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:27:55] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15284151974287935395
Running compilation step : cd /tmp/ltsmin15284151974287935395;'/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'
Compilation finished in 173 ms.
Running link step : cd /tmp/ltsmin15284151974287935395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15284151974287935395;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7339181534104001059.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA CircularTrains-PT-096-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 4617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p1))&&F(p2)&&p0))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 167 cols
[2022-05-16 06:27:55] [INFO ] Computed 72 place invariants in 0 ms
[2022-05-16 06:27:55] [INFO ] Implicit Places using invariants in 84 ms returned [3, 99, 112, 147, 158, 163]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 86 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/167 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/167 places, 96/96 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s134 1)), p2:(AND (GEQ s6 1) (GEQ s134 1)), p1:(AND (GEQ s73 1) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 347 ms.
Product exploration explored 100000 steps with 0 reset in 484 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 p2) p1), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 385 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:27:57] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:27:57] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (G (NOT (AND (NOT p1) p0 (NOT p2)))), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p1) p0)), (F (NOT p1)), (F p2), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 563 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:27:58] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:27:58] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-16 06:27:58] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-16 06:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:27:58] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-05-16 06:27:58] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 06:27:58] [INFO ] Added : 61 causal constraints over 13 iterations in 195 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:27:58] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:27:58] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:27:58] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:27:58] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:27:58] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:27:58] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 96/96 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 413 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p1))), (F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 307 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:27:59] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:28:00] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-16 06:28:00] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-16 06:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:28:00] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-16 06:28:00] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 06:28:00] [INFO ] Added : 61 causal constraints over 13 iterations in 171 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 344 ms.
Product exploration explored 100000 steps with 0 reset in 487 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2022-05-16 06:28:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 161 cols
[2022-05-16 06:28:01] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:28:01] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 96/96 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 96/96 transitions.
Product exploration explored 100000 steps with 0 reset in 357 ms.
Product exploration explored 100000 steps with 0 reset in 477 ms.
Built C files in :
/tmp/ltsmin1546773543839224086
[2022-05-16 06:28:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1546773543839224086
Running compilation step : cd /tmp/ltsmin1546773543839224086;'/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'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin1546773543839224086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin1546773543839224086;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8587527536869462904.hoa' '--buchi-type=spotba'
LTSmin run took 1264 ms.
FORMULA CircularTrains-PT-096-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-10 finished in 8476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(F(p0))&&(p0 U X(X(p1))))))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 167 cols
[2022-05-16 06:28:03] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-16 06:28:03] [INFO ] Implicit Places using invariants in 90 ms returned [3, 7, 99, 112, 147, 158, 163]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 107 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/167 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/167 places, 96/96 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}, { cond=p0, acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s143 1)), p1:(AND (GEQ s105 1) (GEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1484 reset in 389 ms.
Product exploration explored 100000 steps with 1479 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 357 ms. Reduced automaton from 7 states, 19 edges and 2 AP to 7 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 84 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 403 ms. Reduced automaton from 7 states, 19 edges and 2 AP to 7 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:28:06] [INFO ] Computed 65 place invariants in 0 ms
[2022-05-16 06:28:06] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2022-05-16 06:28:06] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-16 06:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:28:06] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2022-05-16 06:28:06] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 06:28:07] [INFO ] Added : 61 causal constraints over 13 iterations in 214 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:28:07] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:28:07] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2022-05-16 06:28:07] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-16 06:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:28:07] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-16 06:28:07] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 06:28:07] [INFO ] Added : 61 causal constraints over 13 iterations in 192 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:28:07] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:28:07] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:28:07] [INFO ] Computed 65 place invariants in 0 ms
[2022-05-16 06:28:07] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:28:07] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:28:07] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 7 states, 19 edges and 2 AP to 7 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 109 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 7 states, 19 edges and 2 AP to 7 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:28:09] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:28:09] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-16 06:28:09] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-16 06:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:28:09] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2022-05-16 06:28:09] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 06:28:09] [INFO ] Added : 61 causal constraints over 13 iterations in 187 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:28:09] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:28:09] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-16 06:28:09] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-16 06:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:28:09] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-05-16 06:28:09] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 06:28:10] [INFO ] Added : 61 causal constraints over 13 iterations in 220 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1513 reset in 359 ms.
Product exploration explored 100000 steps with 1492 reset in 449 ms.
Applying partial POR strategy [false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 160 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 28 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2022-05-16 06:28:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 160 cols
[2022-05-16 06:28:11] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-16 06:28:11] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 96/96 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 96/96 transitions.
Product exploration explored 100000 steps with 2550 reset in 434 ms.
Product exploration explored 100000 steps with 2552 reset in 461 ms.
Built C files in :
/tmp/ltsmin4826907366922929241
[2022-05-16 06:28:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4826907366922929241
Running compilation step : cd /tmp/ltsmin4826907366922929241;'/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'
Compilation finished in 190 ms.
Running link step : cd /tmp/ltsmin4826907366922929241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4826907366922929241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15278662809884896726.hoa' '--buchi-type=spotba'
LTSmin run took 1850 ms.
FORMULA CircularTrains-PT-096-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-12 finished in 10859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 167 /167 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 167 cols
[2022-05-16 06:28:14] [INFO ] Computed 72 place invariants in 0 ms
[2022-05-16 06:28:14] [INFO ] Implicit Places using invariants in 97 ms returned [3, 7, 99, 112, 147, 158]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 98 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/167 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/167 places, 96/96 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s84 1) (LT s138 1)), p0:(OR (LT s111 1) (LT s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-096-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-14 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a CL insensitive property : CircularTrains-PT-096-LTLFireability-01
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 167/167 places, 96/96 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 167 transition count 75
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 146 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 146 transition count 71
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 142 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 2 with 8 rules applied. Total rules applied 58 place count 138 transition count 67
Applied a total of 58 rules in 15 ms. Remains 138 /167 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 138 cols
[2022-05-16 06:28:15] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-16 06:28:15] [INFO ] Implicit Places using invariants in 82 ms returned [2, 82, 94, 122, 130, 135]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 101 ms to find 6 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 132/167 places, 67/96 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 4 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:15] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:28:15] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:15] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:28:15] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 130/167 places, 65/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 130/167 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 36796 reset in 349 ms.
Product exploration explored 100000 steps with 36169 reset in 363 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:16] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:28:16] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:16] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:28:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:16] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:28:16] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=13 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 36177 reset in 351 ms.
Product exploration explored 100000 steps with 36750 reset in 366 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2022-05-16 06:28:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:18] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:28:18] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 65/65 transitions.
Product exploration explored 100000 steps with 36821 reset in 766 ms.
Product exploration explored 100000 steps with 36169 reset in 790 ms.
Built C files in :
/tmp/ltsmin17096053255056595400
[2022-05-16 06:28:19] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17096053255056595400
Running compilation step : cd /tmp/ltsmin17096053255056595400;'/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'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin17096053255056595400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17096053255056595400;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10125585677938308230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:35] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:28:35] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:35] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:28:35] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 65 rows 130 cols
[2022-05-16 06:28:35] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:28:35] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin1229499615063814809
[2022-05-16 06:28:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1229499615063814809
Running compilation step : cd /tmp/ltsmin1229499615063814809;'/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'
Compilation finished in 154 ms.
Running link step : cd /tmp/ltsmin1229499615063814809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1229499615063814809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1091773220409956354.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:28:50] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:28:50] [INFO ] Flatten gal took : 5 ms
[2022-05-16 06:28:50] [INFO ] Time to serialize gal into /tmp/LTL6822809267798781928.gal : 1 ms
[2022-05-16 06:28:50] [INFO ] Time to serialize properties into /tmp/LTL18121787618219236172.ltl : 1 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/LTL6822809267798781928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18121787618219236172.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/LTL6822809...267
Read 1 LTL properties
Checking formula 0 : !((X(F("((F32<1)||(Section_31<1))"))))
Formula 0 simplified : !XF"((F32<1)||(Section_31<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:29:05] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:29:05] [INFO ] Applying decomposition
[2022-05-16 06:29:05] [INFO ] Flatten gal took : 3 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/graph16103507391674254509.txt' '-o' '/tmp/graph16103507391674254509.bin' '-w' '/tmp/graph16103507391674254509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16103507391674254509.bin' '-l' '-1' '-v' '-w' '/tmp/graph16103507391674254509.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:29:05] [INFO ] Decomposing Gal with order
[2022-05-16 06:29:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:29:05] [INFO ] Flatten gal took : 7 ms
[2022-05-16 06:29:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:29:05] [INFO ] Time to serialize gal into /tmp/LTL16079605428178581791.gal : 2 ms
[2022-05-16 06:29:05] [INFO ] Time to serialize properties into /tmp/LTL8707087487987358053.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/LTL16079605428178581791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8707087487987358053.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/LTL1607960...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i5.u28.F32<1)||(i5.u28.Section_31<1))"))))
Formula 0 simplified : !XF"((i5.u28.F32<1)||(i5.u28.Section_31<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1413 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,14.1426,363288,1,0,981972,139,646,289651,128,146,336217
no accepting run found
Formula 0 is TRUE no accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-096-LTLFireability-01 finished in 65641 ms.
FORMULA CircularTrains-PT-096-LTLFireability-01 TRUE TECHNIQUES CL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((X(X(F(X(F(G(p0))))))||F(p1))))))'
[2022-05-16 06:29:20] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15176231764179103939
[2022-05-16 06:29:20] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2022-05-16 06:29:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:29:20] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2022-05-16 06:29:20] [INFO ] Applying decomposition
[2022-05-16 06:29:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:29:20] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2022-05-16 06:29:20] [INFO ] Flatten gal took : 5 ms
[2022-05-16 06:29:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:29:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15176231764179103939
Running compilation step : cd /tmp/ltsmin15176231764179103939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
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/graph16916658399235176340.txt' '-o' '/tmp/graph16916658399235176340.bin' '-w' '/tmp/graph16916658399235176340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16916658399235176340.bin' '-l' '-1' '-v' '-w' '/tmp/graph16916658399235176340.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:29:20] [INFO ] Decomposing Gal with order
[2022-05-16 06:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:29:20] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:29:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:29:20] [INFO ] Time to serialize gal into /tmp/LTLFireability9643619915290833311.gal : 1 ms
[2022-05-16 06:29:20] [INFO ] Time to serialize properties into /tmp/LTLFireability6517031583228001030.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/LTLFireability9643619915290833311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6517031583228001030.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...267
Read 1 LTL properties
Checking formula 0 : !((G(X(F((X(X(F(X(F(G("((i11.u17.F91>=1)&&(i11.u17.Section_90>=1))")))))))||(F("((i2.u12.F8>=1)&&(i2.u3.Section_7>=1))")))))))
Formula 0 simplified : !GXF(XXFXFG"((i11.u17.F91>=1)&&(i11.u17.Section_90>=1))" | F"((i2.u12.F8>=1)&&(i2.u3.Section_7>=1))")
Compilation finished in 236 ms.
Running link step : cd /tmp/ltsmin15176231764179103939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15176231764179103939;'/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(<>((X(X(<>(X(<>([]((LTLAPp1==true)))))))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: [](X(<>((X(X(<>(X(<>([]((LTLAPp1==true)))))))||<>((LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.006: "[](X(<>((X(X(<>(X(<>([]((LTLAPp1==true)))))))||<>((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: There are 100 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.044: State length is 168, there are 102 groups
pins2lts-mc-linux64( 0/ 8), 0.044: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.044: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.044: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.044: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.785: [Blue] ~120 levels ~960 states ~18256 transitions
pins2lts-mc-linux64( 1/ 8), 1.046: [Blue] ~196 levels ~1920 states ~25360 transitions
pins2lts-mc-linux64( 1/ 8), 1.467: [Blue] ~322 levels ~3840 states ~32752 transitions
pins2lts-mc-linux64( 1/ 8), 1.632: [Blue] ~572 levels ~7680 states ~42464 transitions
pins2lts-mc-linux64( 1/ 8), 1.823: [Blue] ~850 levels ~15360 states ~55032 transitions
pins2lts-mc-linux64( 1/ 8), 1.962: [Blue] ~850 levels ~30720 states ~85048 transitions
pins2lts-mc-linux64( 1/ 8), 2.131: [Blue] ~850 levels ~61440 states ~152384 transitions
pins2lts-mc-linux64( 1/ 8), 2.488: [Blue] ~850 levels ~122880 states ~306496 transitions
pins2lts-mc-linux64( 6/ 8), 3.184: [Blue] ~942 levels ~245760 states ~706048 transitions
pins2lts-mc-linux64( 2/ 8), 5.691: [Blue] ~842 levels ~491520 states ~1296360 transitions
pins2lts-mc-linux64( 4/ 8), 10.566: [Blue] ~935 levels ~983040 states ~2548816 transitions
pins2lts-mc-linux64( 3/ 8), 19.156: [Blue] ~844 levels ~1966080 states ~5188472 transitions
pins2lts-mc-linux64( 5/ 8), 25.650: [Blue] ~1010 levels ~3932160 states ~10891504 transitions
pins2lts-mc-linux64( 7/ 8), 37.838: [Blue] ~844 levels ~7864320 states ~22813176 transitions
pins2lts-mc-linux64( 7/ 8), 61.916: [Blue] ~844 levels ~15728640 states ~47590776 transitions
pins2lts-mc-linux64( 4/ 8), 118.172: [Blue] ~935 levels ~31457280 states ~100607280 transitions
pins2lts-mc-linux64( 7/ 8), 163.545: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 163.614:
pins2lts-mc-linux64( 0/ 8), 163.614: Explored 40218867 states 134792666 transitions, fanout: 3.351
pins2lts-mc-linux64( 0/ 8), 163.614: Total exploration time 163.560 sec (163.480 sec minimum, 163.510 sec on average)
pins2lts-mc-linux64( 0/ 8), 163.614: States per second: 245897, Transitions per second: 824118
pins2lts-mc-linux64( 0/ 8), 163.614:
pins2lts-mc-linux64( 0/ 8), 163.614: State space has 40035627 states, 34809078 are accepting
pins2lts-mc-linux64( 0/ 8), 163.614: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 163.614: blue states: 40218867 (100.46%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 163.614: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 163.614: all-red states: 36911285 (92.20%), bogus 180760 (0.45%)
pins2lts-mc-linux64( 0/ 8), 163.614:
pins2lts-mc-linux64( 0/ 8), 163.614: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 163.614:
pins2lts-mc-linux64( 0/ 8), 163.614: Queue width: 8B, total height: 7287, memory: 0.06MB
pins2lts-mc-linux64( 0/ 8), 163.614: Tree memory: 561.4MB, 14.7 B/state, compr.: 2.2%
pins2lts-mc-linux64( 0/ 8), 163.614: Tree fill ratio (roots/leafs): 29.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 163.615: Stored 96 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 163.615: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 163.615: Est. total memory use: 561.5MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15176231764179103939;'/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(<>((X(X(<>(X(<>([]((LTLAPp1==true)))))))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15176231764179103939;'/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(<>((X(X(<>(X(<>([]((LTLAPp1==true)))))))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
111550 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,1115.52,3242784,1,0,6.16548e+06,1719,388,2.46789e+06,189,6069,1480251
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-096-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1488004 ms.

BK_STOP 1652683783016

--------------------
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="CircularTrains-PT-096"
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 CircularTrains-PT-096, 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 r024-tall-165251918900740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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