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.r373-tall-171683789500522.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 ShieldRVs-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789500522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 256K May 18 16:43 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 ShieldRVs-PT-040A-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717004772386

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=ShieldRVs-PT-040A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 17:46:14] [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-29 17:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:46:14] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-29 17:46:14] [INFO ] Transformed 563 places.
[2024-05-29 17:46:14] [INFO ] Transformed 763 transitions.
[2024-05-29 17:46:14] [INFO ] Found NUPN structural information;
[2024-05-29 17:46:14] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 174 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 4 formulas.
FORMULA ShieldRVs-PT-040A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 55 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2024-05-29 17:46:14] [INFO ] Computed 161 invariants in 26 ms
[2024-05-29 17:46:15] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-29 17:46:15] [INFO ] Invariant cache hit.
[2024-05-29 17:46:15] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2024-05-29 17:46:15] [INFO ] Invariant cache hit.
[2024-05-29 17:46:16] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1591 ms. Remains : 563/563 places, 763/763 transitions.
Support contains 38 out of 563 places after structural reductions.
[2024-05-29 17:46:20] [INFO ] Flatten gal took : 111 ms
[2024-05-29 17:46:20] [INFO ] Flatten gal took : 70 ms
[2024-05-29 17:46:20] [INFO ] Input system was already deterministic with 763 transitions.
Support contains 34 out of 563 places (down from 38) after GAL structural reductions.
Finished random walk after 3638 steps, including 6 resets, run visited all 23 properties in 112 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 20 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-05-29 17:46:20] [INFO ] Invariant cache hit.
[2024-05-29 17:46:21] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-29 17:46:21] [INFO ] Invariant cache hit.
[2024-05-29 17:46:21] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2024-05-29 17:46:21] [INFO ] Invariant cache hit.
[2024-05-29 17:46:22] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1383 ms. Remains : 563/563 places, 763/763 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 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s267 1), p0:(OR (EQ s233 0) (EQ s294 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 386 reset in 582 ms.
Product exploration explored 100000 steps with 386 reset in 595 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 297 steps, including 0 resets, run visited all 5 properties in 11 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 74 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2024-05-29 17:46:24] [INFO ] Computed 161 invariants in 5 ms
[2024-05-29 17:46:24] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-29 17:46:24] [INFO ] Invariant cache hit.
[2024-05-29 17:46:25] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2024-05-29 17:46:25] [INFO ] Redundant transitions in 240 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2024-05-29 17:46:25] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 17:46:26] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/563 places, 760/763 transitions.
Applied a total of 0 rules in 23 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1630 ms. Remains : 561/563 places, 760/763 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 p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 4632 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 914 steps, including 1 resets, run visited all 5 properties in 17 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 309 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 389 reset in 493 ms.
Product exploration explored 100000 steps with 394 reset in 522 ms.
Built C files in :
/tmp/ltsmin11398536444938417317
[2024-05-29 17:46:32] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 17:46:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:46:32] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 17:46:32] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:46:33] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 17:46:33] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:46:33] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11398536444938417317
Running compilation step : cd /tmp/ltsmin11398536444938417317;'/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 2109 ms.
Running link step : cd /tmp/ltsmin11398536444938417317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin11398536444938417317;'/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/stateBased3328010027386865971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 28 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2024-05-29 17:46:48] [INFO ] Invariant cache hit.
[2024-05-29 17:46:48] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 17:46:48] [INFO ] Invariant cache hit.
[2024-05-29 17:46:48] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2024-05-29 17:46:49] [INFO ] Redundant transitions in 116 ms returned []
[2024-05-29 17:46:49] [INFO ] Invariant cache hit.
[2024-05-29 17:46:49] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1450 ms. Remains : 561/561 places, 760/760 transitions.
Built C files in :
/tmp/ltsmin1231856927214769451
[2024-05-29 17:46:49] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 17:46:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:46:49] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 17:46:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:46:49] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 17:46:49] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:46:49] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1231856927214769451
Running compilation step : cd /tmp/ltsmin1231856927214769451;'/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 1936 ms.
Running link step : cd /tmp/ltsmin1231856927214769451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1231856927214769451;'/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/stateBased12548107801083038842.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:47:04] [INFO ] Flatten gal took : 45 ms
[2024-05-29 17:47:04] [INFO ] Flatten gal took : 37 ms
[2024-05-29 17:47:08] [INFO ] Time to serialize gal into /tmp/LTL14649110839105694362.gal : 3470 ms
[2024-05-29 17:47:08] [INFO ] Time to serialize properties into /tmp/LTL17716678674344076449.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/LTL14649110839105694362.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8698461388333549882.hoa' '-atoms' '/tmp/LTL17716678674344076449.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/LTL17716678674344076449.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8698461388333549882.hoa
Detected timeout of ITS tools.
[2024-05-29 17:47:23] [INFO ] Flatten gal took : 37 ms
[2024-05-29 17:47:23] [INFO ] Flatten gal took : 34 ms
[2024-05-29 17:47:23] [INFO ] Time to serialize gal into /tmp/LTL4190213596395046765.gal : 5 ms
[2024-05-29 17:47:23] [INFO ] Time to serialize properties into /tmp/LTL3875237422914206925.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/LTL4190213596395046765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3875237422914206925.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(G("((p233==0)||(p294==1))")))||(F("(p267==1)"))))
Formula 0 simplified : XF!"((p233==0)||(p294==1))" & G!"(p267==1)"
Detected timeout of ITS tools.
[2024-05-29 17:47:38] [INFO ] Flatten gal took : 37 ms
[2024-05-29 17:47:38] [INFO ] Applying decomposition
[2024-05-29 17:47:38] [INFO ] Flatten gal took : 31 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/graph2020645679512912907.txt' '-o' '/tmp/graph2020645679512912907.bin' '-w' '/tmp/graph2020645679512912907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2020645679512912907.bin' '-l' '-1' '-v' '-w' '/tmp/graph2020645679512912907.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:47:38] [INFO ] Decomposing Gal with order
[2024-05-29 17:47:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:47:38] [INFO ] Removed a total of 835 redundant transitions.
[2024-05-29 17:47:38] [INFO ] Flatten gal took : 101 ms
[2024-05-29 17:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 892 labels/synchronizations in 24 ms.
[2024-05-29 17:47:38] [INFO ] Time to serialize gal into /tmp/LTL2776277173052276557.gal : 9 ms
[2024-05-29 17:47:38] [INFO ] Time to serialize properties into /tmp/LTL14442278270338597413.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/LTL2776277173052276557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14442278270338597413.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(G("((i6.i1.u67.p233==0)||(i8.i1.u84.p294==1))")))||(F("(i7.i1.u76.p267==1)"))))
Formula 0 simplified : XF!"((i6.i1.u67.p233==0)||(i8.i1.u84.p294==1))" & G!"(i7.i1.u76.p267==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15355438632283931647
[2024-05-29 17:47:53] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15355438632283931647
Running compilation step : cd /tmp/ltsmin15355438632283931647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15355438632283931647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15355438632283931647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-040A-LTLCardinality-00 finished in 100669 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(G(F(G(X((!X(p0) U p1))))))))'
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2024-05-29 17:48:01] [INFO ] Computed 161 invariants in 10 ms
[2024-05-29 17:48:02] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-29 17:48:02] [INFO ] Invariant cache hit.
[2024-05-29 17:48:02] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2024-05-29 17:48:02] [INFO ] Invariant cache hit.
[2024-05-29 17:48:03] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1356 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s69 0) (EQ s214 1)), p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 508 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-01 finished in 1975 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))'
Support contains 1 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 33 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2024-05-29 17:48:03] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 17:48:03] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-29 17:48:03] [INFO ] Invariant cache hit.
[2024-05-29 17:48:04] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2024-05-29 17:48:04] [INFO ] Redundant transitions in 147 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2024-05-29 17:48:04] [INFO ] Computed 161 invariants in 6 ms
[2024-05-29 17:48:04] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/563 places, 760/763 transitions.
Applied a total of 0 rules in 17 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1486 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s191 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1957 steps with 4 reset in 12 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-03 finished in 1545 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((((!F(p1)||p0) U p2)&&(G(p4)||p3)))))'
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 32 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2024-05-29 17:48:04] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 17:48:05] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-29 17:48:05] [INFO ] Invariant cache hit.
[2024-05-29 17:48:05] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2024-05-29 17:48:05] [INFO ] Redundant transitions in 145 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 17:48:05] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 17:48:06] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 16 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1456 ms. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 728 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p4)), (AND p1 (NOT p2) (NOT p4))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4)), acceptance={1} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4)), acceptance={0, 1} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4)), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4))), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4)), acceptance={0, 1} source=2 dest: 3}, { cond=(OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4)), acceptance={0} source=2 dest: 4}, { cond=(OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4)), acceptance={1} source=2 dest: 5}, { cond=(OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4)), acceptance={1} source=4 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4))), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p3 (NOT p1) p4), acceptance={} source=4 dest: 6}, { cond=(OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) p1 (NOT p4))), acceptance={0, 1} source=6 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4))), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p2) p0 p3 p1 (NOT p4)), acceptance={0, 1} source=6 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p1 p4)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p0 p3 (NOT p1) (NOT p4)), acceptance={1} source=6 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1) p4) (AND (NOT p3) (NOT p1) p4)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p0 p3 p1 p4), acceptance={0} source=6 dest: 7}, { cond=(AND (NOT p2) p0 p3 (NOT p1) p4), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p1 (NOT p4)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)), acceptance={1} source=7 dest: 2}, { cond=(OR (AND (NOT p2) p0 (NOT p4)) (AND (NOT p2) (NOT p1) (NOT p4))), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1 p4), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p4), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p2) p0 p4) (AND (NOT p2) (NOT p1) p4)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1 (NOT p4)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)), acceptance={1} source=8 dest: 2}, { cond=(AND (NOT p2) p0 p1 (NOT p4)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1 p4), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4)), acceptance={1} source=8 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p4), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0 p1 p4), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p1) p4), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (EQ s174 0) (EQ s535 1)), p0:(OR (EQ s174 0) (EQ s535 1)), p1:(OR (EQ s382 0) (EQ s553 1)), p3:(OR (EQ s429 0) (EQ s175 1)), p4:(AND (EQ s175 0) (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3498 reset in 721 ms.
Product exploration explored 100000 steps with 3535 reset in 850 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 p1 p3 (NOT p4)), (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4)))), (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4))))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4)))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4))))), (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4)))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) p4))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4)))), (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p4)) (AND (NOT p2) (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4))))), (X (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4))))), (X (X (NOT (AND (NOT p2) p0 p3 p1 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p4) (AND (NOT p2) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) p4) (AND (NOT p3) (NOT p1) p4))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) p4)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p0) p1 (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p1 p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4))))), (X (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) p1 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1) p4)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4)))))), (X (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0 p3 p1 p4)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 p4)))), (X (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 55 factoid took 3734 ms. Reduced automaton from 9 states, 50 edges and 5 AP (stutter insensitive) to 9 states, 50 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 5696 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p4)), (AND p1 (NOT p2) (NOT p4))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 39) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-29 17:48:19] [INFO ] Invariant cache hit.
[2024-05-29 17:48:19] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 14 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1 p3 (NOT p4)), (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4)))), (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4))))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4)))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4))))), (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4)))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) p4))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4)))), (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p4)) (AND (NOT p2) (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4))))), (X (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4))))), (X (X (NOT (AND (NOT p2) p0 p3 p1 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p4) (AND (NOT p2) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) p4) (AND (NOT p3) (NOT p1) p4))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) p4)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p0) p1 (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p1 p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4))))), (X (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) p1 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1) p4)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4)))))), (X (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0 p3 p1 p4)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 p4)))), (X (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4))))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3 (NOT p4)))), (G (NOT (OR (AND p0 p1 (NOT p2) p3) (AND p0 p1 (NOT p2) p4)))), (G (NOT (AND p0 p1 (NOT p2) p3 (NOT p4)))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3 p4))), (G (NOT (AND p0 p1 (NOT p2) p3 p4))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (OR (AND p0 (NOT p1) (NOT p2) p3) (AND p0 (NOT p1) (NOT p2) p4)))), (G (NOT (AND p0 p1 (NOT p2) p4))), (G (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4)))), (G (NOT (AND p0 p1 (NOT p2) (NOT p4)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (OR (AND p0 (NOT p2) p3 p4) (AND (NOT p1) (NOT p2) p3 p4)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3 p4))), (G (NOT (AND p0 (NOT p1) (NOT p2) p4)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p3) p4))), (F (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p3) (NOT p4)))), (F (OR (AND p0 (NOT p3) p4) (AND (NOT p1) (NOT p3) p4) (AND p2 (NOT p3) p4))), (F (OR (AND (NOT p0) p1 (NOT p2) p4) (AND p1 (NOT p3) p4))), (F (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p3) (NOT p4)))), (F (AND (NOT p0) p1 (NOT p2) (NOT p4))), (F (OR (AND p0 (NOT p2) p3) (AND p0 (NOT p2) p4) (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))), (F (OR (AND (NOT p0) (NOT p1) (NOT p2) p3) (AND (NOT p0) (NOT p1) (NOT p2) p4))), (F (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (OR (AND (NOT p0) p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))), (F (OR (AND p0 p1 (NOT p3) p4) (AND p1 p2 (NOT p3) p4))), (F (OR (AND p0 (NOT p1) (NOT p3) p4) (AND (NOT p1) p2 (NOT p3) p4))), (F (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (F (AND (NOT p0) (NOT p1) (NOT p2) p3 (NOT p4))), (F (OR (AND (NOT p0) p1 (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4)))), (F (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (OR (AND p0 (NOT p2) p4) (AND (NOT p1) (NOT p2) p4))), (F (OR (AND (NOT p0) p1 (NOT p2) p4) (AND (NOT p3) p4))), (F (AND (NOT p0) (NOT p1) (NOT p2) p4)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2) p4)), (F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND p0 (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)))]
Knowledge based reduction with 69 factoid took 7001 ms. Reduced automaton from 9 states, 50 edges and 5 AP (stutter insensitive) to 6 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 17:48:26] [INFO ] Invariant cache hit.
[2024-05-29 17:48:27] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-29 17:48:27] [INFO ] Invariant cache hit.
[2024-05-29 17:48:27] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2024-05-29 17:48:27] [INFO ] Redundant transitions in 141 ms returned []
[2024-05-29 17:48:27] [INFO ] Invariant cache hit.
[2024-05-29 17:48:28] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1440 ms. Remains : 562/562 places, 761/761 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p1 p3 (NOT p4)), (X (NOT (OR (AND p2 (NOT p3) p4) (AND (NOT p3) p4 (NOT p1))))), (X (NOT (OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))))), (X (NOT (AND p2 (NOT p3) p4 p1))), (X (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4) p1))), (X (AND (NOT p2) p1)), (X (OR (AND (NOT p2) (NOT p4) p1) (AND (NOT p3) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p4) (AND (NOT p3) p4)))), (X (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))))), (X (NOT (AND p2 (NOT p3) p4 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) p4 p1)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4) p1)))), (X (X (OR (AND (NOT p2) (NOT p4) p1) (AND (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) p4) (AND (NOT p3) p4))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND p2 (NOT p3) p4) (AND (NOT p3) p4 (NOT p1)))))), (X (X (OR (AND (NOT p2) (NOT p4) p1) (AND (NOT p3) (NOT p4) p1)))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1)))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p2) p4 p1) (AND (NOT p3) p4 p1))))), (X (X (NOT (AND (NOT p3) p4 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p3) p4 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 2895 ms. Reduced automaton from 6 states, 24 edges and 4 AP (stutter insensitive) to 6 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Finished random walk after 6141 steps, including 11 resets, run visited all 16 properties in 136 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p3 (NOT p4)), (X (NOT (OR (AND p2 (NOT p3) p4) (AND (NOT p3) p4 (NOT p1))))), (X (NOT (OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))))), (X (NOT (AND p2 (NOT p3) p4 p1))), (X (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4) p1))), (X (AND (NOT p2) p1)), (X (OR (AND (NOT p2) (NOT p4) p1) (AND (NOT p3) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p4) (AND (NOT p3) p4)))), (X (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))))), (X (NOT (AND p2 (NOT p3) p4 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) p4 p1)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4) p1)))), (X (X (OR (AND (NOT p2) (NOT p4) p1) (AND (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) p4) (AND (NOT p3) p4))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND p2 (NOT p3) p4) (AND (NOT p3) p4 (NOT p1)))))), (X (X (OR (AND (NOT p2) (NOT p4) p1) (AND (NOT p3) (NOT p4) p1)))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1)))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p2) p4 p1) (AND (NOT p3) p4 p1))))), (X (X (NOT (AND (NOT p3) p4 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p3) p4 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4)))), (F (AND (NOT p1) (NOT p3) p4)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (OR (AND p1 (NOT p2) p4) (AND p1 (NOT p3) p4))), (F (OR (AND p1 (NOT p2)) (AND p1 (NOT p3) (NOT p4)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (AND (NOT p1) p2 (NOT p3) p4)), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))), (F (AND p1 p2 (NOT p3) p4)), (F (OR (AND p1 (NOT p2)) (AND (NOT p3) (NOT p4)))), (F (OR (AND (NOT p1) (NOT p3) p4) (AND p2 (NOT p3) p4))), (F (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))), (F (OR (AND (NOT p2) p4) (AND (NOT p3) p4))), (F (AND (NOT p1) (NOT p2) p3))]
Knowledge based reduction with 29 factoid took 913 ms. Reduced automaton from 6 states, 24 edges and 4 AP (stutter insensitive) to 6 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering criterion allowed to conclude after 2027 steps with 61 reset in 16 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-04 finished in 28703 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((F((p0||G(p1)))&&X(G(p2)))))'
Support contains 5 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 28 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2024-05-29 17:48:33] [INFO ] Computed 161 invariants in 7 ms
[2024-05-29 17:48:33] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 17:48:33] [INFO ] Invariant cache hit.
[2024-05-29 17:48:34] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2024-05-29 17:48:34] [INFO ] Redundant transitions in 141 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 17:48:34] [INFO ] Computed 161 invariants in 2 ms
[2024-05-29 17:48:35] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1489 ms. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s23 0), p1:(AND (EQ s482 0) (EQ s228 1)), p2:(OR (EQ s542 0) (EQ s522 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 186 reset in 453 ms.
Product exploration explored 100000 steps with 187 reset in 528 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 17:48:36] [INFO ] Invariant cache hit.
[2024-05-29 17:48:36] [INFO ] [Real]Absence check using 161 positive place invariants in 28 ms returned sat
[2024-05-29 17:48:37] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:48:37] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2024-05-29 17:48:37] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:48:45] [INFO ] Deduced a trap composed of 8 places in 7539 ms of which 4 ms to minimize.
[2024-05-29 17:48:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7597 ms
[2024-05-29 17:48:45] [INFO ] After 7949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-29 17:48:45] [INFO ] After 8171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 562 transition count 761
Applied a total of 82 rules in 107 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 562/562 places, 761/761 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 17:48:45] [INFO ] Computed 161 invariants in 8 ms
[2024-05-29 17:48:45] [INFO ] [Real]Absence check using 161 positive place invariants in 26 ms returned sat
[2024-05-29 17:48:46] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:48:46] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2024-05-29 17:48:46] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:48:46] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-29 17:48:46] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 17:48:46] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 561 transition count 760
Applied a total of 1 rules in 35 ms. Remains 561 /562 variables (removed 1) and now considering 760/761 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 561/562 places, 760/761 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21880 steps, run visited all 1 properties in 155 ms. (steps per millisecond=141 )
Probabilistic random walk after 21880 steps, saw 21261 distinct states, run finished after 157 ms. (steps per millisecond=139 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 233 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 17:48:47] [INFO ] Computed 161 invariants in 9 ms
[2024-05-29 17:48:47] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 17:48:47] [INFO ] Invariant cache hit.
[2024-05-29 17:48:48] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2024-05-29 17:48:48] [INFO ] Redundant transitions in 156 ms returned []
[2024-05-29 17:48:48] [INFO ] Invariant cache hit.
[2024-05-29 17:48:48] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1508 ms. Remains : 562/562 places, 761/761 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 17:48:49] [INFO ] Invariant cache hit.
[2024-05-29 17:48:49] [INFO ] [Real]Absence check using 161 positive place invariants in 26 ms returned sat
[2024-05-29 17:48:49] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:48:49] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2024-05-29 17:48:50] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:48:50] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-29 17:48:50] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-29 17:48:50] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 562 transition count 761
Applied a total of 82 rules in 28 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 562/562 places, 761/761 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 17:48:50] [INFO ] Computed 161 invariants in 7 ms
[2024-05-29 17:48:50] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 17:48:51] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:48:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2024-05-29 17:48:51] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:48:51] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:48:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-29 17:48:51] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 17:48:51] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 561 transition count 760
Applied a total of 1 rules in 25 ms. Remains 561 /562 variables (removed 1) and now considering 760/761 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 561/562 places, 760/761 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21880 steps, run visited all 1 properties in 129 ms. (steps per millisecond=169 )
Probabilistic random walk after 21880 steps, saw 21261 distinct states, run finished after 130 ms. (steps per millisecond=168 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 7722 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 186 reset in 447 ms.
Product exploration explored 100000 steps with 186 reset in 519 ms.
Built C files in :
/tmp/ltsmin1791690257490569491
[2024-05-29 17:49:00] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2024-05-29 17:49:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:49:00] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2024-05-29 17:49:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:49:01] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2024-05-29 17:49:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:49:01] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1791690257490569491
Running compilation step : cd /tmp/ltsmin1791690257490569491;'/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 1946 ms.
Running link step : cd /tmp/ltsmin1791690257490569491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1791690257490569491;'/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/stateBased14695747212862138806.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 20 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 17:49:16] [INFO ] Computed 161 invariants in 6 ms
[2024-05-29 17:49:16] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 17:49:16] [INFO ] Invariant cache hit.
[2024-05-29 17:49:16] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2024-05-29 17:49:17] [INFO ] Redundant transitions in 131 ms returned []
[2024-05-29 17:49:17] [INFO ] Invariant cache hit.
[2024-05-29 17:49:17] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1459 ms. Remains : 562/562 places, 761/761 transitions.
Built C files in :
/tmp/ltsmin16357836320991747522
[2024-05-29 17:49:17] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2024-05-29 17:49:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:49:17] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2024-05-29 17:49:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:49:17] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2024-05-29 17:49:17] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:49:17] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16357836320991747522
Running compilation step : cd /tmp/ltsmin16357836320991747522;'/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 1944 ms.
Running link step : cd /tmp/ltsmin16357836320991747522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16357836320991747522;'/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/stateBased4816763583800935969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:49:32] [INFO ] Flatten gal took : 34 ms
[2024-05-29 17:49:32] [INFO ] Flatten gal took : 32 ms
[2024-05-29 17:49:32] [INFO ] Time to serialize gal into /tmp/LTL2722401816490960179.gal : 5 ms
[2024-05-29 17:49:32] [INFO ] Time to serialize properties into /tmp/LTL9705310636528525233.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/LTL2722401816490960179.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8858150529425316846.hoa' '-atoms' '/tmp/LTL9705310636528525233.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/LTL9705310636528525233.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8858150529425316846.hoa
Detected timeout of ITS tools.
[2024-05-29 17:49:47] [INFO ] Flatten gal took : 36 ms
[2024-05-29 17:49:47] [INFO ] Flatten gal took : 31 ms
[2024-05-29 17:49:47] [INFO ] Time to serialize gal into /tmp/LTL9131323137361401463.gal : 4 ms
[2024-05-29 17:49:56] [INFO ] Time to serialize properties into /tmp/LTL6597675810362414212.ltl : 8997 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/LTL9131323137361401463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6597675810362414212.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 : !((F((F(("(p23==0)")||(G("((p482==0)&&(p228==1))"))))&&(X(G("((p542==0)||(p522==1))"))))))
Formula 0 simplified : G(G(!"(p23==0)" & F!"((p482==0)&&(p228==1))") | XF!"((p542==0)||(p522==1))")
Detected timeout of ITS tools.
[2024-05-29 17:50:11] [INFO ] Flatten gal took : 29 ms
[2024-05-29 17:50:11] [INFO ] Applying decomposition
[2024-05-29 17:50:11] [INFO ] Flatten gal took : 29 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/graph9122182526077838380.txt' '-o' '/tmp/graph9122182526077838380.bin' '-w' '/tmp/graph9122182526077838380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9122182526077838380.bin' '-l' '-1' '-v' '-w' '/tmp/graph9122182526077838380.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:50:11] [INFO ] Decomposing Gal with order
[2024-05-29 17:50:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:50:11] [INFO ] Removed a total of 835 redundant transitions.
[2024-05-29 17:50:12] [INFO ] Flatten gal took : 48 ms
[2024-05-29 17:50:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 880 labels/synchronizations in 32 ms.
[2024-05-29 17:50:12] [INFO ] Time to serialize gal into /tmp/LTL17585707426399287703.gal : 7 ms
[2024-05-29 17:50:12] [INFO ] Time to serialize properties into /tmp/LTL8197486880351336771.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/LTL17585707426399287703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8197486880351336771.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((F(("(i0.i1.u7.p23==0)")||(G("((i15.i1.u137.p482==0)&&(i7.i0.u65.p228==1))"))))&&(X(G("((i17.u155.p542==0)||(i16.i1.u149.p522==1)...163
Formula 0 simplified : G(G(!"(i0.i1.u7.p23==0)" & F!"((i15.i1.u137.p482==0)&&(i7.i0.u65.p228==1))") | XF!"((i17.u155.p542==0)||(i16.i1.u149.p522==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3907637209216121507
[2024-05-29 17:50:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3907637209216121507
Running compilation step : cd /tmp/ltsmin3907637209216121507;'/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 1257 ms.
Running link step : cd /tmp/ltsmin3907637209216121507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3907637209216121507;'/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)||[]((LTLAPp1==true))))&&X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 688 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-040A-LTLCardinality-05 finished in 115553 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((X(p1)&&p0))))'
Support contains 4 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 12 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2024-05-29 17:50:29] [INFO ] Computed 161 invariants in 6 ms
[2024-05-29 17:50:29] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-29 17:50:29] [INFO ] Invariant cache hit.
[2024-05-29 17:50:30] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
[2024-05-29 17:50:30] [INFO ] Invariant cache hit.
[2024-05-29 17:50:30] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1353 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s31 0) (EQ s60 1) (OR (EQ s501 0) (EQ s163 1))), p1:(OR (EQ s60 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8021 steps with 16 reset in 43 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-07 finished in 1532 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(F(p0))))'
Support contains 2 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 11 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-05-29 17:50:30] [INFO ] Invariant cache hit.
[2024-05-29 17:50:31] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 17:50:31] [INFO ] Invariant cache hit.
[2024-05-29 17:50:31] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2024-05-29 17:50:31] [INFO ] Invariant cache hit.
[2024-05-29 17:50:32] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1305 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s466 0) (EQ s245 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1297 ms.
Product exploration explored 100000 steps with 33333 reset in 1355 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-040A-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040A-LTLCardinality-08 finished in 4167 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))'
Support contains 1 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 24 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2024-05-29 17:50:34] [INFO ] Computed 161 invariants in 5 ms
[2024-05-29 17:50:35] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 17:50:35] [INFO ] Invariant cache hit.
[2024-05-29 17:50:35] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2024-05-29 17:50:35] [INFO ] Redundant transitions in 145 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2024-05-29 17:50:35] [INFO ] Computed 161 invariants in 2 ms
[2024-05-29 17:50:36] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/563 places, 760/763 transitions.
Applied a total of 0 rules in 11 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1461 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 5190 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s465 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2068 steps with 18 reset in 15 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-12 finished in 6685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||G(p2)||X(F(p3))))))'
Support contains 7 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 12 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2024-05-29 17:50:41] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 17:50:41] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 17:50:41] [INFO ] Invariant cache hit.
[2024-05-29 17:50:42] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2024-05-29 17:50:42] [INFO ] Invariant cache hit.
[2024-05-29 17:50:42] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1356 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p3:(OR (EQ s128 0) (EQ s83 1)), p0:(EQ s118 0), p1:(AND (EQ s140 0) (EQ s138 1)), p2:(OR (EQ s50 0) (EQ s560 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-13 finished in 1556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 9 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-05-29 17:50:43] [INFO ] Invariant cache hit.
[2024-05-29 17:50:43] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 17:50:43] [INFO ] Invariant cache hit.
[2024-05-29 17:50:44] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2024-05-29 17:50:44] [INFO ] Invariant cache hit.
[2024-05-29 17:50:44] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1367 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s210 0) (EQ s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1320 ms.
Product exploration explored 100000 steps with 33333 reset in 1339 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 6365 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-040A-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040A-LTLCardinality-14 finished in 10520 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 1 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 28 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2024-05-29 17:50:53] [INFO ] Computed 161 invariants in 2 ms
[2024-05-29 17:50:53] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 17:50:53] [INFO ] Invariant cache hit.
[2024-05-29 17:50:54] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
[2024-05-29 17:50:54] [INFO ] Redundant transitions in 151 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2024-05-29 17:50:54] [INFO ] Computed 161 invariants in 5 ms
[2024-05-29 17:50:55] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/563 places, 760/763 transitions.
Applied a total of 0 rules in 14 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1540 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s110 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 555 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-15 finished in 1671 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))||F(p1)))'
Found a Lengthening insensitive property : ShieldRVs-PT-040A-LTLCardinality-00
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 24 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2024-05-29 17:50:55] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 17:50:55] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 17:50:55] [INFO ] Invariant cache hit.
[2024-05-29 17:50:56] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2024-05-29 17:50:56] [INFO ] Invariant cache hit.
[2024-05-29 17:50:56] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 561/563 places, 761/763 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1351 ms. Remains : 561/563 places, 761/763 transitions.
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s266 1), p0:(OR (EQ s232 0) (EQ s293 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 393 reset in 448 ms.
Product exploration explored 100000 steps with 392 reset in 519 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 273 steps, including 0 resets, run visited all 5 properties in 12 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 16 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 17:50:58] [INFO ] Invariant cache hit.
[2024-05-29 17:50:59] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-29 17:50:59] [INFO ] Invariant cache hit.
[2024-05-29 17:50:59] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2024-05-29 17:50:59] [INFO ] Redundant transitions in 141 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2024-05-29 17:50:59] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 17:51:00] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/561 places, 760/761 transitions.
Applied a total of 0 rules in 10 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1467 ms. Remains : 561/561 places, 760/761 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 p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1393 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 294 steps, including 0 resets, run visited all 5 properties in 7 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 286 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 390 reset in 438 ms.
Product exploration explored 100000 steps with 391 reset in 518 ms.
Built C files in :
/tmp/ltsmin13644310933371346729
[2024-05-29 17:51:03] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 17:51:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:03] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 17:51:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:03] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 17:51:03] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:03] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13644310933371346729
Running compilation step : cd /tmp/ltsmin13644310933371346729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13644310933371346729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13644310933371346729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 12 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2024-05-29 17:51:06] [INFO ] Invariant cache hit.
[2024-05-29 17:51:07] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-29 17:51:07] [INFO ] Invariant cache hit.
[2024-05-29 17:51:07] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2024-05-29 17:51:07] [INFO ] Redundant transitions in 140 ms returned []
[2024-05-29 17:51:07] [INFO ] Invariant cache hit.
[2024-05-29 17:51:08] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1440 ms. Remains : 561/561 places, 760/760 transitions.
Built C files in :
/tmp/ltsmin13941175046861116442
[2024-05-29 17:51:08] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 17:51:08] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:08] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 17:51:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:08] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 17:51:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:08] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13941175046861116442
Running compilation step : cd /tmp/ltsmin13941175046861116442;'/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 1922 ms.
Running link step : cd /tmp/ltsmin13941175046861116442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13941175046861116442;'/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/stateBased7788619634024498621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:51:23] [INFO ] Flatten gal took : 28 ms
[2024-05-29 17:51:23] [INFO ] Flatten gal took : 29 ms
[2024-05-29 17:51:23] [INFO ] Time to serialize gal into /tmp/LTL2576286215950247498.gal : 10 ms
[2024-05-29 17:51:23] [INFO ] Time to serialize properties into /tmp/LTL11877595730394154340.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/LTL2576286215950247498.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5250201769798015214.hoa' '-atoms' '/tmp/LTL11877595730394154340.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11877595730394154340.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5250201769798015214.hoa
Detected timeout of ITS tools.
[2024-05-29 17:51:38] [INFO ] Flatten gal took : 31 ms
[2024-05-29 17:51:38] [INFO ] Flatten gal took : 26 ms
[2024-05-29 17:51:38] [INFO ] Time to serialize gal into /tmp/LTL257341401590099804.gal : 5 ms
[2024-05-29 17:51:38] [INFO ] Time to serialize properties into /tmp/LTL15051882140071882580.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/LTL257341401590099804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15051882140071882580.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(G("((p233==0)||(p294==1))")))||(F("(p267==1)"))))
Formula 0 simplified : XF!"((p233==0)||(p294==1))" & G!"(p267==1)"
Detected timeout of ITS tools.
[2024-05-29 17:51:53] [INFO ] Flatten gal took : 25 ms
[2024-05-29 17:51:53] [INFO ] Applying decomposition
[2024-05-29 17:51:53] [INFO ] Flatten gal took : 25 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/graph14967057380598611153.txt' '-o' '/tmp/graph14967057380598611153.bin' '-w' '/tmp/graph14967057380598611153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14967057380598611153.bin' '-l' '-1' '-v' '-w' '/tmp/graph14967057380598611153.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:51:54] [INFO ] Decomposing Gal with order
[2024-05-29 17:51:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:51:54] [INFO ] Removed a total of 835 redundant transitions.
[2024-05-29 17:51:54] [INFO ] Flatten gal took : 42 ms
[2024-05-29 17:51:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 876 labels/synchronizations in 11 ms.
[2024-05-29 17:51:54] [INFO ] Time to serialize gal into /tmp/LTL11352082641056583331.gal : 5 ms
[2024-05-29 17:51:54] [INFO ] Time to serialize properties into /tmp/LTL15393832774765753290.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/LTL11352082641056583331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15393832774765753290.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(G("((i7.u67.p233==0)||(i9.i0.u84.p294==1))")))||(F("(i8.i0.u76.p267==1)"))))
Formula 0 simplified : XF!"((i7.u67.p233==0)||(i9.i0.u84.p294==1))" & G!"(i8.i0.u76.p267==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9343053570304128664
[2024-05-29 17:52:09] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9343053570304128664
Running compilation step : cd /tmp/ltsmin9343053570304128664;'/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 1269 ms.
Running link step : cd /tmp/ltsmin9343053570304128664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9343053570304128664;'/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' '(X([]((LTLAPp0==true)))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040A-LTLCardinality-00 finished in 89022 ms.
[2024-05-29 17:52:24] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8455807843260263419
[2024-05-29 17:52:24] [INFO ] Applying decomposition
[2024-05-29 17:52:24] [INFO ] Computing symmetric may disable matrix : 763 transitions.
[2024-05-29 17:52:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:52:24] [INFO ] Computing symmetric may enable matrix : 763 transitions.
[2024-05-29 17:52:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:52:24] [INFO ] Flatten gal took : 26 ms
[2024-05-29 17:52:24] [INFO ] Computing Do-Not-Accords matrix : 763 transitions.
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/graph12743543180570673194.txt' '-o' '/tmp/graph12743543180570673194.bin' '-w' '/tmp/graph12743543180570673194.weights'
[2024-05-29 17:52:24] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12743543180570673194.bin' '-l' '-1' '-v' '-w' '/tmp/graph12743543180570673194.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:52:24] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8455807843260263419
Running compilation step : cd /tmp/ltsmin8455807843260263419;'/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-29 17:52:24] [INFO ] Decomposing Gal with order
[2024-05-29 17:52:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:52:24] [INFO ] Removed a total of 837 redundant transitions.
[2024-05-29 17:52:24] [INFO ] Flatten gal took : 41 ms
[2024-05-29 17:52:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 832 labels/synchronizations in 17 ms.
[2024-05-29 17:52:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality15812598822351134685.gal : 6 ms
[2024-05-29 17:52:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality1123434612173611269.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/LTLCardinality15812598822351134685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1123434612173611269.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(G("((i6.i2.u67.p233==0)||(i8.u84.p294==1))")))||(F("(i7.u76.p267==1)"))))
Formula 0 simplified : XF!"((i6.i2.u67.p233==0)||(i8.u84.p294==1))" & G!"(i7.u76.p267==1)"
Compilation finished in 1944 ms.
Running link step : cd /tmp/ltsmin8455807843260263419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8455807843260263419;'/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' '(X([]((LTLAPp0==true)))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: LTL layer: formula: (X([]((LTLAPp0==true)))||<>((LTLAPp1==true)))
pins2lts-mc-linux64( 2/ 8), 0.045: "(X([]((LTLAPp0==true)))||<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.046: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.093: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.236: DFS-FIFO for weak LTL, using special progress label 766
pins2lts-mc-linux64( 0/ 8), 0.236: There are 767 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.236: State length is 564, there are 767 groups
pins2lts-mc-linux64( 0/ 8), 0.236: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.236: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.236: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.236: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.296: ~1 levels ~960 states ~3784 transitions
pins2lts-mc-linux64( 7/ 8), 0.365: ~1 levels ~1920 states ~8344 transitions
pins2lts-mc-linux64( 7/ 8), 0.447: ~1 levels ~3840 states ~18864 transitions
pins2lts-mc-linux64( 7/ 8), 0.657: ~1 levels ~7680 states ~41704 transitions
pins2lts-mc-linux64( 2/ 8), 0.975: ~1 levels ~15360 states ~87480 transitions
pins2lts-mc-linux64( 2/ 8), 1.524: ~1 levels ~30720 states ~186032 transitions
pins2lts-mc-linux64( 0/ 8), 2.549: ~1 levels ~61440 states ~400624 transitions
pins2lts-mc-linux64( 3/ 8), 4.516: ~1 levels ~122880 states ~797672 transitions
pins2lts-mc-linux64( 0/ 8), 8.265: ~1 levels ~245760 states ~1775896 transitions
pins2lts-mc-linux64( 2/ 8), 15.146: ~1 levels ~491520 states ~3548368 transitions
pins2lts-mc-linux64( 3/ 8), 28.667: ~1 levels ~983040 states ~7318792 transitions
pins2lts-mc-linux64( 3/ 8), 56.350: ~1 levels ~1966080 states ~15485504 transitions
pins2lts-mc-linux64( 3/ 8), 112.366: ~1 levels ~3932160 states ~31537232 transitions
pins2lts-mc-linux64( 0/ 8), 193.405: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 193.489:
pins2lts-mc-linux64( 0/ 8), 193.489: mean standard work distribution: 5.6% (states) 5.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 193.489:
pins2lts-mc-linux64( 0/ 8), 193.489: Explored 6081590 states 52543500 transitions, fanout: 8.640
pins2lts-mc-linux64( 0/ 8), 193.489: Total exploration time 193.240 sec (193.180 sec minimum, 193.206 sec on average)
pins2lts-mc-linux64( 0/ 8), 193.489: States per second: 31472, Transitions per second: 271908
pins2lts-mc-linux64( 0/ 8), 193.489:
pins2lts-mc-linux64( 0/ 8), 193.489: Progress states detected: 11514742
pins2lts-mc-linux64( 0/ 8), 193.489: Redundant explorations: -47.1844
pins2lts-mc-linux64( 0/ 8), 193.489:
pins2lts-mc-linux64( 0/ 8), 193.489: Queue width: 8B, total height: 9204494, memory: 70.22MB
pins2lts-mc-linux64( 0/ 8), 193.489: Tree memory: 343.9MB, 31.3 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 193.489: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 193.489: Stored 843 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 193.489: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 193.489: Est. total memory use: 414.1MB (~1094.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8455807843260263419;'/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' '(X([]((LTLAPp0==true)))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8455807843260263419;'/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' '(X([]((LTLAPp0==true)))||<>((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-29 18:14:30] [INFO ] Applying decomposition
[2024-05-29 18:14:31] [INFO ] Flatten gal took : 448 ms
[2024-05-29 18:14:36] [INFO ] Decomposing Gal with order
[2024-05-29 18:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:14:38] [INFO ] Removed a total of 837 redundant transitions.
[2024-05-29 18:14:38] [INFO ] Flatten gal took : 1377 ms
[2024-05-29 18:14:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 152 ms.
[2024-05-29 18:14:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality3024403679464706663.gal : 60 ms
[2024-05-29 18:14:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality14594901471985226030.ltl : 7 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/LTLCardinality3024403679464706663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14594901471985226030.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(G("((u68.p233==0)||(u85.p294==1))")))||(F("(u77.p267==1)"))))
Formula 0 simplified : XF!"((u68.p233==0)||(u85.p294==1))" & G!"(u77.p267==1)"
Reverse transition relation is NOT exact ! Due to transitions t243, t249, t252, t256, t261, t264, t268, t271, t276, t279, t283, t288, t291, t296, t301, t30...3265
Computing Next relation with stutter on 3.79058e+30 deadlock states
Detected timeout of ITS tools.
[2024-05-29 18:36:58] [INFO ] Flatten gal took : 819 ms
[2024-05-29 18:37:00] [INFO ] Input system was already deterministic with 763 transitions.
[2024-05-29 18:37:00] [INFO ] Transformed 563 places.
[2024-05-29 18:37:00] [INFO ] Transformed 763 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-29 18:37:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality13199257387240071506.gal : 26 ms
[2024-05-29 18:37:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality13481250822677211599.ltl : 2 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/LTLCardinality13199257387240071506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13481250822677211599.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(G("((p233==0)||(p294==1))")))||(F("(p267==1)"))))
Formula 0 simplified : XF!"((p233==0)||(p294==1))" & G!"(p267==1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9588548 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099008 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="ShieldRVs-PT-040A"
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 ShieldRVs-PT-040A, 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 r373-tall-171683789500522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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