Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716248942020

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-048
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 23:49:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 23:49:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:49:03] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2024-05-20 23:49:03] [INFO ] Transformed 96 places.
[2024-05-20 23:49:03] [INFO ] Transformed 48 transitions.
[2024-05-20 23:49:03] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-048-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 16 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2024-05-20 23:49:04] [INFO ] Computed 49 invariants in 15 ms
[2024-05-20 23:49:04] [INFO ] Implicit Places using invariants in 230 ms returned [1, 13, 64, 81, 83, 89, 90]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 548 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 567 ms. Remains : 89/96 places, 48/48 transitions.
Support contains 39 out of 89 places after structural reductions.
[2024-05-20 23:49:04] [INFO ] Flatten gal took : 23 ms
[2024-05-20 23:49:04] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:49:04] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 35 out of 89 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:49:05] [INFO ] Computed 42 invariants in 7 ms
[2024-05-20 23:49:05] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2024-05-20 23:49:05] [INFO ] [Real]Absence check using 27 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-20 23:49:05] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-048-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 85 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 25 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-20 23:49:05] [INFO ] Computed 42 invariants in 5 ms
[2024-05-20 23:49:05] [INFO ] Implicit Places using invariants in 92 ms returned [1, 12, 18, 56, 72, 76, 77, 78]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 93 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 39/48 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 72 transition count 34
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 67 transition count 34
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 12 place count 66 transition count 33
Applied a total of 12 rules in 6 ms. Remains 66 /72 variables (removed 6) and now considering 33/39 (removed 6) transitions.
// Phase 1: matrix 33 rows 66 cols
[2024-05-20 23:49:05] [INFO ] Computed 34 invariants in 1 ms
[2024-05-20 23:49:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-20 23:49:05] [INFO ] Invariant cache hit.
[2024-05-20 23:49:05] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/89 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 66/89 places, 33/48 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s56 s44), p1:(LEQ 1 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 171 reset in 378 ms.
Product exploration explored 100000 steps with 159 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 319 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=159 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-20 23:49:07] [INFO ] Invariant cache hit.
[2024-05-20 23:49:07] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-20 23:49:07] [INFO ] Invariant cache hit.
[2024-05-20 23:49:07] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-20 23:49:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:49:07] [INFO ] Invariant cache hit.
[2024-05-20 23:49:07] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 66/66 places, 33/33 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 384 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=96 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 153 reset in 223 ms.
Product exploration explored 100000 steps with 154 reset in 229 ms.
Built C files in :
/tmp/ltsmin15705997681752809539
[2024-05-20 23:49:08] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-20 23:49:08] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:08] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-20 23:49:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:08] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-20 23:49:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:08] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15705997681752809539
Running compilation step : cd /tmp/ltsmin15705997681752809539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 218 ms.
Running link step : cd /tmp/ltsmin15705997681752809539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15705997681752809539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13202034059869664744.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-20 23:49:23] [INFO ] Invariant cache hit.
[2024-05-20 23:49:23] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-20 23:49:23] [INFO ] Invariant cache hit.
[2024-05-20 23:49:23] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-20 23:49:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:49:23] [INFO ] Invariant cache hit.
[2024-05-20 23:49:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 66/66 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin16598692139754809662
[2024-05-20 23:49:24] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-20 23:49:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:24] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-20 23:49:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:24] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-20 23:49:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16598692139754809662
Running compilation step : cd /tmp/ltsmin16598692139754809662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 127 ms.
Running link step : cd /tmp/ltsmin16598692139754809662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16598692139754809662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14483824036653145818.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:49:39] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:49:39] [INFO ] Flatten gal took : 3 ms
[2024-05-20 23:49:39] [INFO ] Time to serialize gal into /tmp/LTL8358892200567582280.gal : 1 ms
[2024-05-20 23:49:39] [INFO ] Time to serialize properties into /tmp/LTL16056167501961150523.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8358892200567582280.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17931984145035944014.hoa' '-atoms' '/tmp/LTL16056167501961150523.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16056167501961150523.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17931984145035944014.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
83 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,0.867114,46416,1,0,277,225456,28,1,1491,167980,694
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-048-LTLCardinality-01 finished in 34786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:49:40] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:49:40] [INFO ] Implicit Places using invariants in 79 ms returned [2, 14, 20, 54, 61, 84, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 80 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s11 s80), p1:(LEQ s74 s64)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 189 reset in 231 ms.
Product exploration explored 100000 steps with 155 reset in 223 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 (AND p0 (NOT p1)))), (X (NOT p0))]
False Knowledge obtained : [(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))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 222 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0))]
False Knowledge obtained : [(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))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 312 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 48 rows 82 cols
[2024-05-20 23:49:41] [INFO ] Computed 35 invariants in 1 ms
[2024-05-20 23:49:41] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-20 23:49:41] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned unsat
Proved EG (NOT p0)
[2024-05-20 23:49:41] [INFO ] Invariant cache hit.
[2024-05-20 23:49:41] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-20 23:49:41] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 3 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0))]
False Knowledge obtained : [(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))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 336 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-048-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLCardinality-02 finished in 1997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:49:42] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:49:42] [INFO ] Implicit Places using invariants in 76 ms returned [2, 14, 54, 61, 79, 84, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 77 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-03 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 (GT s18 s0) (LEQ s6 s51) (LEQ 1 s1))], 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 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 161 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-048-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLCardinality-03 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((G(F(p0)) U p1))))))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-20 23:49:42] [INFO ] Invariant cache hit.
[2024-05-20 23:49:42] [INFO ] Implicit Places using invariants in 64 ms returned [2, 14, 20, 54, 61, 79, 84, 85, 87]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 65 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s47 s75), p1:(LEQ 1 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1561 reset in 211 ms.
Product exploration explored 100000 steps with 1588 reset in 243 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 153 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 443 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-20 23:49:44] [INFO ] Computed 33 invariants in 0 ms
[2024-05-20 23:49:44] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-20 23:49:44] [INFO ] Invariant cache hit.
[2024-05-20 23:49:44] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-20 23:49:44] [INFO ] Invariant cache hit.
[2024-05-20 23:49:44] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 80/80 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 103 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 331 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1583 reset in 214 ms.
Product exploration explored 100000 steps with 1572 reset in 231 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 80 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 13 place count 80 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 80 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-20 23:49:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2024-05-20 23:49:47] [INFO ] Computed 33 invariants in 1 ms
[2024-05-20 23:49:47] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 48/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin14251365056579344241
[2024-05-20 23:49:47] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14251365056579344241
Running compilation step : cd /tmp/ltsmin14251365056579344241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin14251365056579344241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14251365056579344241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11427813604835868345.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-20 23:50:02] [INFO ] Computed 33 invariants in 2 ms
[2024-05-20 23:50:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-20 23:50:02] [INFO ] Invariant cache hit.
[2024-05-20 23:50:02] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-20 23:50:02] [INFO ] Invariant cache hit.
[2024-05-20 23:50:02] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin16303125072168057133
[2024-05-20 23:50:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16303125072168057133
Running compilation step : cd /tmp/ltsmin16303125072168057133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin16303125072168057133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16303125072168057133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5932756073304652423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:50:17] [INFO ] Flatten gal took : 6 ms
[2024-05-20 23:50:17] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:50:17] [INFO ] Time to serialize gal into /tmp/LTL18383604031522716793.gal : 5 ms
[2024-05-20 23:50:17] [INFO ] Time to serialize properties into /tmp/LTL6450627911357289242.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18383604031522716793.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11287723639244151076.hoa' '-atoms' '/tmp/LTL6450627911357289242.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6450627911357289242.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11287723639244151076.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:50:32] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:50:32] [INFO ] Flatten gal took : 3 ms
[2024-05-20 23:50:32] [INFO ] Time to serialize gal into /tmp/LTL5479068198210083064.gal : 1 ms
[2024-05-20 23:50:32] [INFO ] Time to serialize properties into /tmp/LTL7907882029687747541.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5479068198210083064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7907882029687747541.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(F12<=Section_22)")||(X(G((G(F("(F12<=Section_22)")))U("(Section_8>=1)")))))))
Formula 0 simplified : F(!"(F12<=Section_22)" & XF(FG!"(F12<=Section_22)" R !"(Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:50:47] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:50:47] [INFO ] Applying decomposition
[2024-05-20 23:50:47] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2527814888903881496.txt' '-o' '/tmp/graph2527814888903881496.bin' '-w' '/tmp/graph2527814888903881496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2527814888903881496.bin' '-l' '-1' '-v' '-w' '/tmp/graph2527814888903881496.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:50:47] [INFO ] Decomposing Gal with order
[2024-05-20 23:50:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:50:47] [INFO ] Flatten gal took : 29 ms
[2024-05-20 23:50:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:50:47] [INFO ] Time to serialize gal into /tmp/LTL15608284301818772471.gal : 1 ms
[2024-05-20 23:50:47] [INFO ] Time to serialize properties into /tmp/LTL3477352959059584441.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15608284301818772471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3477352959059584441.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(gu15.F12<=gu15.Section_22)")||(X(G((G(F("(gu15.F12<=gu15.Section_22)")))U("(gi0.gi0.gi0.gu14.Section_8>=1)")))))))
Formula 0 simplified : F(!"(gu15.F12<=gu15.Section_22)" & XF(FG!"(gu15.F12<=gu15.Section_22)" R !"(gi0.gi0.gi0.gu14.Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11123936754802613637
[2024-05-20 23:51:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11123936754802613637
Running compilation step : cd /tmp/ltsmin11123936754802613637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 130 ms.
Running link step : cd /tmp/ltsmin11123936754802613637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11123936754802613637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-048-LTLCardinality-06 finished in 95374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:51:18] [INFO ] Computed 42 invariants in 2 ms
[2024-05-20 23:51:18] [INFO ] Implicit Places using invariants in 71 ms returned [2, 14, 20, 54, 61, 79, 84, 85, 87]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 74 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s67 s9), p0:(GT s24 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1796 reset in 222 ms.
Product exploration explored 100000 steps with 1828 reset in 240 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 44 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-20 23:51:19] [INFO ] Computed 33 invariants in 2 ms
[2024-05-20 23:51:19] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 23:51:19] [INFO ] Invariant cache hit.
[2024-05-20 23:51:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-20 23:51:19] [INFO ] Invariant cache hit.
[2024-05-20 23:51:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 80/80 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 18 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1824 reset in 232 ms.
Product exploration explored 100000 steps with 1754 reset in 244 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 80 transition count 48
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 13 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-20 23:51:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2024-05-20 23:51:21] [INFO ] Computed 33 invariants in 1 ms
[2024-05-20 23:51:21] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 48/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin1017731161984627328
[2024-05-20 23:51:21] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1017731161984627328
Running compilation step : cd /tmp/ltsmin1017731161984627328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 122 ms.
Running link step : cd /tmp/ltsmin1017731161984627328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1017731161984627328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17107213851898724266.hoa' '--buchi-type=spotba'
LTSmin run took 199 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLCardinality-07 finished in 4102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 85 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 15 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-20 23:51:22] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:51:22] [INFO ] Implicit Places using invariants in 56 ms returned [2, 13, 19, 51, 57, 72, 76, 77, 78]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 39/48 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 71 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 65 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 65 transition count 32
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 14 place count 64 transition count 32
Applied a total of 14 rules in 3 ms. Remains 64 /71 variables (removed 7) and now considering 32/39 (removed 7) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-20 23:51:22] [INFO ] Computed 33 invariants in 1 ms
[2024-05-20 23:51:22] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-20 23:51:22] [INFO ] Invariant cache hit.
[2024-05-20 23:51:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6587 reset in 217 ms.
Product exploration explored 100000 steps with 6706 reset in 225 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 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-05-20 23:51:23] [INFO ] Invariant cache hit.
[2024-05-20 23:51:23] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:51:23] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 23:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:51:23] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-20 23:51:23] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-20 23:51:23] [INFO ] Added : 14 causal constraints over 3 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-20 23:51:23] [INFO ] Invariant cache hit.
[2024-05-20 23:51:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-20 23:51:23] [INFO ] Invariant cache hit.
[2024-05-20 23:51:23] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-20 23:51:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:51:23] [INFO ] Invariant cache hit.
[2024-05-20 23:51:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 64/64 places, 32/32 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 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
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 264 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-20 23:51:24] [INFO ] Invariant cache hit.
[2024-05-20 23:51:24] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:51:24] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 23:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:51:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-20 23:51:24] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-20 23:51:24] [INFO ] Added : 14 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6566 reset in 213 ms.
Product exploration explored 100000 steps with 6819 reset in 232 ms.
Built C files in :
/tmp/ltsmin9401990983553407048
[2024-05-20 23:51:25] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-20 23:51:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:51:25] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-20 23:51:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:51:25] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-20 23:51:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:51:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9401990983553407048
Running compilation step : cd /tmp/ltsmin9401990983553407048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin9401990983553407048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9401990983553407048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13067889703764166875.hoa' '--buchi-type=spotba'
LTSmin run took 1160 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLCardinality-08 finished in 4130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1) U (G(p1)||!p0)))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 86 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 83 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 10 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-20 23:51:26] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:51:26] [INFO ] Implicit Places using invariants in 56 ms returned [1, 12, 18, 50, 72, 76, 77, 78]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 68 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 39/48 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 72 transition count 34
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 67 transition count 34
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 12 place count 66 transition count 33
Applied a total of 12 rules in 4 ms. Remains 66 /72 variables (removed 6) and now considering 33/39 (removed 6) transitions.
// Phase 1: matrix 33 rows 66 cols
[2024-05-20 23:51:26] [INFO ] Computed 34 invariants in 1 ms
[2024-05-20 23:51:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-20 23:51:26] [INFO ] Invariant cache hit.
[2024-05-20 23:51:26] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/89 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 230 ms. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (OR p0 p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s49 s47), p0:(GT 1 s60)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-11 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 85 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 5 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-20 23:51:26] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:51:26] [INFO ] Implicit Places using invariants in 71 ms returned [1, 12, 18, 50, 56, 71, 75, 76, 77]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 72 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 70 transition count 33
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 65 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 2 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-20 23:51:26] [INFO ] Computed 33 invariants in 0 ms
[2024-05-20 23:51:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-20 23:51:26] [INFO ] Invariant cache hit.
[2024-05-20 23:51:26] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s19 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 26415 steps with 0 reset with depth 26416 and stack size 26416 in 87 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-12 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:51:27] [INFO ] Computed 42 invariants in 2 ms
[2024-05-20 23:51:27] [INFO ] Implicit Places using invariants in 65 ms returned [2, 20, 54, 61, 79, 84, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 66 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-13 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:(GT s13 s63)], 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 1 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-13 finished in 158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((p1 U (p2||G(p1))))))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 86 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 84 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 82 transition count 41
Applied a total of 14 rules in 4 ms. Remains 82 /89 variables (removed 7) and now considering 41/48 (removed 7) transitions.
// Phase 1: matrix 41 rows 82 cols
[2024-05-20 23:51:27] [INFO ] Computed 42 invariants in 2 ms
[2024-05-20 23:51:27] [INFO ] Implicit Places using invariants in 59 ms returned [1, 12, 18, 50, 57, 73, 78, 80]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 60 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/89 places, 41/48 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 74 transition count 36
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 69 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 68 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 68 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 67 transition count 34
Applied a total of 14 rules in 3 ms. Remains 67 /74 variables (removed 7) and now considering 34/41 (removed 7) transitions.
// Phase 1: matrix 34 rows 67 cols
[2024-05-20 23:51:27] [INFO ] Computed 34 invariants in 0 ms
[2024-05-20 23:51:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-20 23:51:27] [INFO ] Invariant cache hit.
[2024-05-20 23:51:27] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/89 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 67/89 places, 34/48 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GT 2 s55) (GT 1 s65)), p1:(GT 1 s65), p0:(GT s51 s63)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2047 reset in 319 ms.
Product exploration explored 100000 steps with 2104 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 23:51:28] [INFO ] Invariant cache hit.
[2024-05-20 23:51:29] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 23:51:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-20 23:51:29] [INFO ] [Nat]Absence check using 30 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-20 23:51:29] [INFO ] After 45ms SMT Verify possible using all constraints in natural 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 p2) (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 533 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 34/34 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-20 23:51:29] [INFO ] Invariant cache hit.
[2024-05-20 23:51:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-20 23:51:29] [INFO ] Invariant cache hit.
[2024-05-20 23:51:29] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-20 23:51:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:51:29] [INFO ] Invariant cache hit.
[2024-05-20 23:51:29] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 67/67 places, 34/34 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 p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 1 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 1 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1572 reset in 232 ms.
Product exploration explored 100000 steps with 1531 reset in 259 ms.
Built C files in :
/tmp/ltsmin7002918720292895480
[2024-05-20 23:51:31] [INFO ] Computing symmetric may disable matrix : 34 transitions.
[2024-05-20 23:51:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:51:31] [INFO ] Computing symmetric may enable matrix : 34 transitions.
[2024-05-20 23:51:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:51:31] [INFO ] Computing Do-Not-Accords matrix : 34 transitions.
[2024-05-20 23:51:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:51:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7002918720292895480
Running compilation step : cd /tmp/ltsmin7002918720292895480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 106 ms.
Running link step : cd /tmp/ltsmin7002918720292895480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7002918720292895480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3415942330972465035.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLCardinality-14 finished in 4081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:51:31] [INFO ] Computed 42 invariants in 0 ms
[2024-05-20 23:51:31] [INFO ] Implicit Places using invariants in 62 ms returned [2, 14, 20, 54, 61, 79, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 65 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT 2 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-15 finished in 192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((G(F(p0)) U p1))))))'
Found a Lengthening insensitive property : CircularTrains-PT-048-LTLCardinality-06
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 87 transition count 42
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 12 place count 83 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 6 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-20 23:51:31] [INFO ] Computed 42 invariants in 0 ms
[2024-05-20 23:51:31] [INFO ] Implicit Places using invariants in 53 ms returned [1, 12, 18, 50, 56, 71, 76, 77, 78]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 54 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 71/89 places, 39/48 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 71 transition count 34
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 66 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 66 transition count 33
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 12 place count 65 transition count 33
Applied a total of 12 rules in 6 ms. Remains 65 /71 variables (removed 6) and now considering 33/39 (removed 6) transitions.
// Phase 1: matrix 33 rows 65 cols
[2024-05-20 23:51:31] [INFO ] Computed 33 invariants in 0 ms
[2024-05-20 23:51:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-20 23:51:32] [INFO ] Invariant cache hit.
[2024-05-20 23:51:32] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 65/89 places, 33/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 184 ms. Remains : 65/89 places, 33/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s40 s62), p1:(LEQ 1 s56)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2332 reset in 211 ms.
Product exploration explored 100000 steps with 2349 reset in 232 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)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 329 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 79 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 361 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-20 23:51:33] [INFO ] Invariant cache hit.
[2024-05-20 23:51:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-20 23:51:33] [INFO ] Invariant cache hit.
[2024-05-20 23:51:33] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-20 23:51:33] [INFO ] Invariant cache hit.
[2024-05-20 23:51:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 65/65 places, 33/33 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)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 396 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 360 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2277 reset in 222 ms.
Product exploration explored 100000 steps with 2337 reset in 234 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-20 23:51:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:51:36] [INFO ] Invariant cache hit.
[2024-05-20 23:51:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 65/65 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin9729611943686245476
[2024-05-20 23:51:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9729611943686245476
Running compilation step : cd /tmp/ltsmin9729611943686245476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin9729611943686245476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9729611943686245476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11861770197117266859.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-20 23:51:51] [INFO ] Invariant cache hit.
[2024-05-20 23:51:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-20 23:51:51] [INFO ] Invariant cache hit.
[2024-05-20 23:51:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-20 23:51:51] [INFO ] Invariant cache hit.
[2024-05-20 23:51:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 65/65 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin8244287463040606222
[2024-05-20 23:51:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8244287463040606222
Running compilation step : cd /tmp/ltsmin8244287463040606222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 110 ms.
Running link step : cd /tmp/ltsmin8244287463040606222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8244287463040606222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7626849803472404133.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:52:06] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:52:06] [INFO ] Flatten gal took : 3 ms
[2024-05-20 23:52:06] [INFO ] Time to serialize gal into /tmp/LTL5392928376918424065.gal : 1 ms
[2024-05-20 23:52:06] [INFO ] Time to serialize properties into /tmp/LTL1566287395103716353.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5392928376918424065.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1769203038618192740.hoa' '-atoms' '/tmp/LTL1566287395103716353.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1566287395103716353.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1769203038618192740.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:52:21] [INFO ] Flatten gal took : 3 ms
[2024-05-20 23:52:21] [INFO ] Flatten gal took : 3 ms
[2024-05-20 23:52:21] [INFO ] Time to serialize gal into /tmp/LTL17203112772439487707.gal : 1 ms
[2024-05-20 23:52:21] [INFO ] Time to serialize properties into /tmp/LTL2790993539995871275.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17203112772439487707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2790993539995871275.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(F12<=Section_22)")||(X(G((G(F("(F12<=Section_22)")))U("(Section_8>=1)")))))))
Formula 0 simplified : F(!"(F12<=Section_22)" & XF(FG!"(F12<=Section_22)" R !"(Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:52:36] [INFO ] Flatten gal took : 3 ms
[2024-05-20 23:52:36] [INFO ] Applying decomposition
[2024-05-20 23:52:36] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13378521814378986391.txt' '-o' '/tmp/graph13378521814378986391.bin' '-w' '/tmp/graph13378521814378986391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13378521814378986391.bin' '-l' '-1' '-v' '-w' '/tmp/graph13378521814378986391.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:52:36] [INFO ] Decomposing Gal with order
[2024-05-20 23:52:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:52:36] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:52:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:52:36] [INFO ] Time to serialize gal into /tmp/LTL8143567706037072696.gal : 1 ms
[2024-05-20 23:52:36] [INFO ] Time to serialize properties into /tmp/LTL110832210383965628.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8143567706037072696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL110832210383965628.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(("(gu16.F12<=gu16.Section_22)")||(X(G((G(F("(gu16.F12<=gu16.Section_22)")))U("(gi0.gi2.gi0.gu27.Section_8>=1)")))))))
Formula 0 simplified : F(!"(gu16.F12<=gu16.Section_22)" & XF(FG!"(gu16.F12<=gu16.Section_22)" R !"(gi0.gi2.gi0.gu27.Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14444331505604391495
[2024-05-20 23:52:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14444331505604391495
Running compilation step : cd /tmp/ltsmin14444331505604391495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 112 ms.
Running link step : cd /tmp/ltsmin14444331505604391495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14444331505604391495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-048-LTLCardinality-06 finished in 95228 ms.
[2024-05-20 23:53:06] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11548175572082792497
[2024-05-20 23:53:06] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2024-05-20 23:53:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:06] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2024-05-20 23:53:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:06] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2024-05-20 23:53:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11548175572082792497
[2024-05-20 23:53:06] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin11548175572082792497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 23:53:06] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15368899415343576603.txt' '-o' '/tmp/graph15368899415343576603.bin' '-w' '/tmp/graph15368899415343576603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15368899415343576603.bin' '-l' '-1' '-v' '-w' '/tmp/graph15368899415343576603.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:53:06] [INFO ] Decomposing Gal with order
[2024-05-20 23:53:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:53:06] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:53:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:53:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality3469650001665742994.gal : 2 ms
[2024-05-20 23:53:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality11903522747227015612.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3469650001665742994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11903522747227015612.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(("(gu19.F12<=gu19.Section_22)")||(X(G((G(F("(gu19.F12<=gu19.Section_22)")))U("(gi0.gi2.gi0.gu21.Section_8>=1)")))))))
Formula 0 simplified : F(!"(gu19.F12<=gu19.Section_22)" & XF(FG!"(gu19.F12<=gu19.Section_22)" R !"(gi0.gi2.gi0.gu21.Section_8>=1)"))
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin11548175572082792497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11548175572082792497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==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( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: LTL layer: formula: [](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))
pins2lts-mc-linux64( 0/ 8), 0.004: "[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.018: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.074: DFS-FIFO for weak LTL, using special progress label 51
pins2lts-mc-linux64( 0/ 8), 0.074: There are 52 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.074: State length is 90, there are 60 groups
pins2lts-mc-linux64( 0/ 8), 0.074: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.074: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.074: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.074: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.169: ~1 levels ~960 states ~15200 transitions
pins2lts-mc-linux64( 0/ 8), 0.217: ~1 levels ~1920 states ~30304 transitions
pins2lts-mc-linux64( 2/ 8), 0.302: ~1 levels ~3840 states ~59728 transitions
pins2lts-mc-linux64( 0/ 8), 0.357: ~124 levels ~7680 states ~52328 transitions
pins2lts-mc-linux64( 0/ 8), 0.401: ~124 levels ~15360 states ~65432 transitions
pins2lts-mc-linux64( 0/ 8), 0.493: ~124 levels ~30720 states ~94528 transitions
pins2lts-mc-linux64( 5/ 8), 0.694: ~128 levels ~61440 states ~138328 transitions
pins2lts-mc-linux64( 3/ 8), 0.983: ~120 levels ~122880 states ~306208 transitions
pins2lts-mc-linux64( 0/ 8), 1.452: ~124 levels ~245760 states ~564776 transitions
pins2lts-mc-linux64( 7/ 8), 2.092: ~151 levels ~491520 states ~1084008 transitions
pins2lts-mc-linux64( 7/ 8), 2.977: ~151 levels ~983040 states ~2214832 transitions
pins2lts-mc-linux64( 7/ 8), 4.284: ~151 levels ~1966080 states ~4488936 transitions
pins2lts-mc-linux64( 7/ 8), 6.830: ~151 levels ~3932160 states ~9187104 transitions
pins2lts-mc-linux64( 6/ 8), 13.123: ~115 levels ~7864320 states ~20973744 transitions
pins2lts-mc-linux64( 6/ 8), 26.469: ~115 levels ~15728640 states ~42873688 transitions
pins2lts-mc-linux64( 3/ 8), 50.534: ~120 levels ~31457280 states ~87914992 transitions
pins2lts-mc-linux64( 5/ 8), 90.667: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 90.747:
pins2lts-mc-linux64( 0/ 8), 90.747: mean standard work distribution: 1.8% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 90.747:
pins2lts-mc-linux64( 0/ 8), 90.747: Explored 50925571 states 149287332 transitions, fanout: 2.931
pins2lts-mc-linux64( 0/ 8), 90.747: Total exploration time 90.650 sec (90.580 sec minimum, 90.605 sec on average)
pins2lts-mc-linux64( 0/ 8), 90.747: States per second: 561782, Transitions per second: 1646854
pins2lts-mc-linux64( 0/ 8), 90.748:
pins2lts-mc-linux64( 0/ 8), 90.748: Progress states detected: 18238
pins2lts-mc-linux64( 0/ 8), 90.748: Redundant explorations: -0.0354
pins2lts-mc-linux64( 0/ 8), 90.748:
pins2lts-mc-linux64( 0/ 8), 90.748: Queue width: 8B, total height: 24308, memory: 0.19MB
pins2lts-mc-linux64( 0/ 8), 90.748: Tree memory: 644.7MB, 13.3 B/state, compr.: 3.7%
pins2lts-mc-linux64( 0/ 8), 90.748: Tree fill ratio (roots/leafs): 37.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 90.748: Stored 48 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 90.748: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 90.748: Est. total memory use: 644.9MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11548175572082792497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11548175572082792497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 00:14:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:14:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality6487299060658243054.gal : 1 ms
[2024-05-21 00:14:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality10260111446738840996.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6487299060658243054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10260111446738840996.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(("(F12<=Section_22)")||(X(G((G(F("(F12<=Section_22)")))U("(Section_8>=1)")))))))
Formula 0 simplified : F(!"(F12<=Section_22)" & XF(FG!"(F12<=Section_22)" R !"(Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 00:35:49] [INFO ] Flatten gal took : 3 ms
[2024-05-21 00:35:49] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-21 00:35:49] [INFO ] Transformed 89 places.
[2024-05-21 00:35:49] [INFO ] Transformed 48 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 00:35:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality13694879885396839921.gal : 1 ms
[2024-05-21 00:35:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality1668670862437546226.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13694879885396839921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1668670862437546226.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(F12<=Section_22)")||(X(G((G(F("(F12<=Section_22)")))U("(Section_8>=1)")))))))
Formula 0 simplified : F(!"(F12<=Section_22)" & XF(FG!"(F12<=Section_22)" R !"(Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11319348 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16037944 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CircularTrains-PT-048, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521700212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-048.tgz
mv CircularTrains-PT-048 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;