Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974800131.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r421-tajo-167905974800131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 256K Mar 5 18:23 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 1679164673682

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=itstools
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 202303021504
[2023-03-18 18:37:55] [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]
[2023-03-18 18:37:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:37:55] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-18 18:37:55] [INFO ] Transformed 563 places.
[2023-03-18 18:37:55] [INFO ] Transformed 763 transitions.
[2023-03-18 18:37:55] [INFO ] Found NUPN structural information;
[2023-03-18 18:37:55] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-040A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 51 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-18 18:37:55] [INFO ] Computed 161 place invariants in 16 ms
[2023-03-18 18:37:56] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-18 18:37:56] [INFO ] Invariant cache hit.
[2023-03-18 18:37:56] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2023-03-18 18:37:56] [INFO ] Invariant cache hit.
[2023-03-18 18:37:57] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1677 ms. Remains : 563/563 places, 763/763 transitions.
Support contains 28 out of 563 places after structural reductions.
[2023-03-18 18:37:57] [INFO ] Flatten gal took : 134 ms
[2023-03-18 18:37:57] [INFO ] Flatten gal took : 86 ms
[2023-03-18 18:37:58] [INFO ] Input system was already deterministic with 763 transitions.
Finished random walk after 1484 steps, including 2 resets, run visited all 19 properties in 135 ms. (steps per millisecond=10 )
FORMULA ShieldRVs-PT-040A-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202303021504/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.
[2023-03-18 18:37:58] [INFO ] Invariant cache hit.
[2023-03-18 18:37:58] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-18 18:37:58] [INFO ] Invariant cache hit.
[2023-03-18 18:37:59] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-18 18:37:59] [INFO ] Invariant cache hit.
[2023-03-18 18:37:59] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1164 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 180 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 387 reset in 606 ms.
Product exploration explored 100000 steps with 384 reset in 609 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 based reduction with 6 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 277 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=39 )
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 (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 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 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.
[2023-03-18 18:38:01] [INFO ] Invariant cache hit.
[2023-03-18 18:38:02] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-18 18:38:02] [INFO ] Invariant cache hit.
[2023-03-18 18:38:02] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-18 18:38:02] [INFO ] Invariant cache hit.
[2023-03-18 18:38:03] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 563/563 places, 763/763 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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 341 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 387 reset in 437 ms.
Product exploration explored 100000 steps with 387 reset in 531 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 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 SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 563 transition count 763
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 168 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-18 18:38:05] [INFO ] Redundant transitions in 384 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 762 rows 563 cols
[2023-03-18 18:38:05] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-18 18:38:06] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/563 places, 762/763 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 57 ms. Remains 563 /563 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1041 ms. Remains : 563/563 places, 762/763 transitions.
Built C files in :
/tmp/ltsmin9285400502902819328
[2023-03-18 18:38:06] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9285400502902819328
Running compilation step : cd /tmp/ltsmin9285400502902819328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1602 ms.
Running link step : cd /tmp/ltsmin9285400502902819328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9285400502902819328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13356501383479329020.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 13 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-18 18:38:21] [INFO ] Computed 161 place invariants in 10 ms
[2023-03-18 18:38:21] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-18 18:38:21] [INFO ] Invariant cache hit.
[2023-03-18 18:38:22] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2023-03-18 18:38:22] [INFO ] Invariant cache hit.
[2023-03-18 18:38:22] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1203 ms. Remains : 563/563 places, 763/763 transitions.
Built C files in :
/tmp/ltsmin15860280571849771763
[2023-03-18 18:38:22] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15860280571849771763
Running compilation step : cd /tmp/ltsmin15860280571849771763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1151 ms.
Running link step : cd /tmp/ltsmin15860280571849771763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15860280571849771763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2971051547193906751.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:38:37] [INFO ] Flatten gal took : 85 ms
[2023-03-18 18:38:37] [INFO ] Flatten gal took : 61 ms
[2023-03-18 18:38:37] [INFO ] Time to serialize gal into /tmp/LTL14436615870988224079.gal : 13 ms
[2023-03-18 18:38:37] [INFO ] Time to serialize properties into /tmp/LTL10411740223820964921.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14436615870988224079.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12969440171560766327.hoa' '-atoms' '/tmp/LTL10411740223820964921.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10411740223820964921.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12969440171560766327.hoa
Detected timeout of ITS tools.
[2023-03-18 18:38:53] [INFO ] Flatten gal took : 55 ms
[2023-03-18 18:38:53] [INFO ] Flatten gal took : 96 ms
[2023-03-18 18:38:53] [INFO ] Time to serialize gal into /tmp/LTL428500547985355428.gal : 12 ms
[2023-03-18 18:38:53] [INFO ] Time to serialize properties into /tmp/LTL10642272474294415350.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL428500547985355428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10642272474294415350.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.202303021504/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.
[2023-03-18 18:39:08] [INFO ] Flatten gal took : 62 ms
[2023-03-18 18:39:08] [INFO ] Applying decomposition
[2023-03-18 18:39:08] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9265084571255885005.txt' '-o' '/tmp/graph9265084571255885005.bin' '-w' '/tmp/graph9265084571255885005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9265084571255885005.bin' '-l' '-1' '-v' '-w' '/tmp/graph9265084571255885005.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:39:08] [INFO ] Decomposing Gal with order
[2023-03-18 18:39:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:39:08] [INFO ] Removed a total of 837 redundant transitions.
[2023-03-18 18:39:08] [INFO ] Flatten gal took : 128 ms
[2023-03-18 18:39:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 904 labels/synchronizations in 65 ms.
[2023-03-18 18:39:08] [INFO ] Time to serialize gal into /tmp/LTL14254106347422129779.gal : 17 ms
[2023-03-18 18:39:08] [INFO ] Time to serialize properties into /tmp/LTL16687541680885098978.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14254106347422129779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16687541680885098978.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(G("((i8.i0.u67.p233==0)||(i10.i0.u84.p294==1))")))||(F("(i9.i0.u76.p267==1)"))))
Formula 0 simplified : XF!"((i8.i0.u67.p233==0)||(i10.i0.u84.p294==1))" & G!"(i9.i0.u76.p267==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6989038298364400382
[2023-03-18 18:39:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6989038298364400382
Running compilation step : cd /tmp/ltsmin6989038298364400382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1413 ms.
Running link step : cd /tmp/ltsmin6989038298364400382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6989038298364400382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 100475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 0 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 52 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-18 18:39:39] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-18 18:39:39] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-18 18:39:39] [INFO ] Invariant cache hit.
[2023-03-18 18:39:40] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2023-03-18 18:39:40] [INFO ] Redundant transitions in 258 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
[2023-03-18 18:39:40] [INFO ] Computed 161 place invariants in 15 ms
[2023-03-18 18:39:40] [INFO ] Dead Transitions using invariants and state equation in 524 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 29 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 1976 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 35 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 1268 steps with 2 reset in 7 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-03 finished in 2046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 0 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 45 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2023-03-18 18:39:41] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-18 18:39:41] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-18 18:39:41] [INFO ] Invariant cache hit.
[2023-03-18 18:39:41] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-18 18:39:42] [INFO ] Redundant transitions in 109 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
[2023-03-18 18:39:42] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-18 18:39:42] [INFO ] Dead Transitions using invariants and state equation in 325 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 15 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 1260 ms. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 619 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 3571 reset in 651 ms.
Product exploration explored 100000 steps with 3590 reset in 737 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 27432 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 548 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 317 ms. (steps per millisecond=31 ) properties (out of 39) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) 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 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 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) 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 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 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 18:40:13] [INFO ] Invariant cache hit.
[2023-03-18 18:40:13] [INFO ] After 148ms 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 1 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 (NOT p1) (NOT p2) p0 (NOT p4) p3))), (G (NOT (OR (AND p1 (NOT p2) p0 p4) (AND p1 (NOT p2) p0 p3)))), (G (NOT (AND p1 (NOT p2) p0 (NOT p4) p3))), (G (NOT (AND (NOT p1) (NOT p2) p0 p4 p3))), (G (NOT (AND p1 (NOT p2) p0 p4 p3))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (OR (AND (NOT p1) (NOT p2) p0 p4) (AND (NOT p1) (NOT p2) p0 p3)))), (G (NOT (AND p1 (NOT p2) p0 p4))), (G (NOT (AND (NOT p1) (NOT p2) p0 (NOT p4)))), (G (NOT (AND p1 (NOT p2) p0 (NOT p4)))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (OR (AND (NOT p1) (NOT p2) p4 p3) (AND (NOT p2) p0 p4 p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) p4 p3))), (G (NOT (AND (NOT p1) (NOT p2) p0 p4)))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p2) (NOT p0) p4) (AND (NOT p1) p4 (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0)) (AND p1 (NOT p4) (NOT p3)))), (F (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3)) (AND p0 p4 (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0) p4) (AND p1 p4 (NOT p3)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p4) (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p0) (NOT p4))), (F (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p0 p3))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0) p4) (AND (NOT p1) (NOT p2) (NOT p0) p3))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4) (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND p1 (NOT p4) (NOT p3)))), (F (OR (AND p1 p2 p4 (NOT p3)) (AND p1 p0 p4 (NOT p3)))), (F (OR (AND (NOT p1) p2 p4 (NOT p3)) (AND (NOT p1) p0 p4 (NOT p3)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p4) p3) (AND (NOT p2) p0 (NOT p4) p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p4) p3)), (F (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p4) (NOT p3)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))), (F (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p2) p0 p4))), (F (OR (AND p1 (NOT p2) (NOT p0) p4) (AND p4 (NOT p3)))), (F (AND (NOT p1) (NOT p2) (NOT p0) p4)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0) p4)), (F (AND p1 (NOT p2) (NOT p0))), (F (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) p0 (NOT p4)))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)))]
Knowledge based reduction with 69 factoid took 55273 ms. Reduced automaton from 9 states, 50 edges and 5 AP (stutter insensitive) to 6 states, 24 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 525 ms :[(OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (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 LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 10 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-18 18:41:09] [INFO ] Invariant cache hit.
[2023-03-18 18:41:10] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-18 18:41:10] [INFO ] Invariant cache hit.
[2023-03-18 18:41:10] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2023-03-18 18:41:10] [INFO ] Invariant cache hit.
[2023-03-18 18:41:11] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1449 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 p1 p0 p2 p3 (NOT p4)), (X (NOT (AND p1 p2 p4 (NOT p3)))), (X (NOT (OR (AND (NOT p2) p4) (AND p4 (NOT p3))))), (X (NOT (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3))))), (X (OR p1 (NOT p0) p2 p3)), (X (NOT (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3)))), (X (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p2 p4 (NOT p3)))), (X (X (NOT (AND p1 p2 p4 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p4) (AND p4 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p4) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p1 p4 (NOT p3)) (AND (NOT p2) p4 p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (OR p1 (NOT p0) p2 p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3))))), (X (X (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 p4 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 4478 ms. Reduced automaton from 6 states, 24 edges and 5 AP (stutter sensitive) to 6 states, 24 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 478 ms :[(OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3) (AND (NOT p2) p4)), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:41:16] [INFO ] Invariant cache hit.
[2023-03-18 18:41:16] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2 p3 (NOT p4)), (X (NOT (AND p1 p2 p4 (NOT p3)))), (X (NOT (OR (AND (NOT p2) p4) (AND p4 (NOT p3))))), (X (NOT (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3))))), (X (OR p1 (NOT p0) p2 p3)), (X (NOT (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3)))), (X (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p2 p4 (NOT p3)))), (X (X (NOT (AND p1 p2 p4 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p4) (AND p4 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p4) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p1 p4 (NOT p3)) (AND (NOT p2) p4 p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (OR p1 (NOT p0) p2 p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3))))), (X (X (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 p4 (NOT p3))))), (G (OR p1 p2 (NOT p0) p3))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) p2 (NOT p3) p4)), (F (AND (NOT p1) (NOT p2))), (F (OR (AND p1 (NOT p3) p4) (AND (NOT p2) 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 (OR (AND (NOT p1) (NOT p3) p4) (AND 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 (NOT p2) p4) (AND (NOT p3) p4))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))), (F (AND (NOT p1) (NOT p3) p4)), (F (OR (AND p1 (NOT p2)) (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))), (F (AND (NOT p1) (NOT p2) p3)), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))))]
Knowledge based reduction with 32 factoid took 3967 ms. Reduced automaton from 6 states, 24 edges and 5 AP (stutter sensitive) to 6 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 345 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 (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 348 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 (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 277 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 (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Product exploration explored 100000 steps with 3535 reset in 685 ms.
Product exploration explored 100000 steps with 3590 reset in 568 ms.
Built C files in :
/tmp/ltsmin6675542868188289686
[2023-03-18 18:41:22] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2023-03-18 18:41:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:41:22] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2023-03-18 18:41:22] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:41:23] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2023-03-18 18:41:23] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:41:23] [INFO ] Built C files in 250ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6675542868188289686
Running compilation step : cd /tmp/ltsmin6675542868188289686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2114 ms.
Running link step : cd /tmp/ltsmin6675542868188289686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6675542868188289686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6701261528937949477.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 14 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-18 18:41:38] [INFO ] Invariant cache hit.
[2023-03-18 18:41:38] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-18 18:41:38] [INFO ] Invariant cache hit.
[2023-03-18 18:41:38] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-18 18:41:38] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-18 18:41:38] [INFO ] Invariant cache hit.
[2023-03-18 18:41:39] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1171 ms. Remains : 562/562 places, 761/761 transitions.
Built C files in :
/tmp/ltsmin15814715791801313601
[2023-03-18 18:41:39] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2023-03-18 18:41:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:41:39] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2023-03-18 18:41:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:41:39] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2023-03-18 18:41:39] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:41:39] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15814715791801313601
Running compilation step : cd /tmp/ltsmin15814715791801313601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1961 ms.
Running link step : cd /tmp/ltsmin15814715791801313601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin15814715791801313601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10637475108729633148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:41:54] [INFO ] Flatten gal took : 69 ms
[2023-03-18 18:41:54] [INFO ] Flatten gal took : 64 ms
[2023-03-18 18:41:54] [INFO ] Time to serialize gal into /tmp/LTL10036306416361882922.gal : 5 ms
[2023-03-18 18:41:54] [INFO ] Time to serialize properties into /tmp/LTL9907530223118108991.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10036306416361882922.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1720208751052888992.hoa' '-atoms' '/tmp/LTL9907530223118108991.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9907530223118108991.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1720208751052888992.hoa
Detected timeout of ITS tools.
[2023-03-18 18:42:09] [INFO ] Flatten gal took : 81 ms
[2023-03-18 18:42:09] [INFO ] Flatten gal took : 27 ms
[2023-03-18 18:42:09] [INFO ] Time to serialize gal into /tmp/LTL1293415093038032201.gal : 10 ms
[2023-03-18 18:42:09] [INFO ] Time to serialize properties into /tmp/LTL16518578333578032134.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1293415093038032201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16518578333578032134.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((((!(F("((p382==0)||(p554==1))")))||("(p174==0)"))||("(p535==1)"))U("((p174==0)||(p535==1))"))&&(((G("((p175==0)&&(p429==1))")...192
Formula 0 simplified : FG((!"(p175==1)" | ((!"(p174==0)" & !"(p535==1)" & F"((p382==0)||(p554==1))") R !"((p174==0)||(p535==1))")) & (!"(p429==0)" | ((!"(p...359
Detected timeout of ITS tools.
[2023-03-18 18:42:24] [INFO ] Flatten gal took : 68 ms
[2023-03-18 18:42:24] [INFO ] Applying decomposition
[2023-03-18 18:42:24] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9855525313454378323.txt' '-o' '/tmp/graph9855525313454378323.bin' '-w' '/tmp/graph9855525313454378323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9855525313454378323.bin' '-l' '-1' '-v' '-w' '/tmp/graph9855525313454378323.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:42:24] [INFO ] Decomposing Gal with order
[2023-03-18 18:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:42:25] [INFO ] Removed a total of 835 redundant transitions.
[2023-03-18 18:42:25] [INFO ] Flatten gal took : 123 ms
[2023-03-18 18:42:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 876 labels/synchronizations in 74 ms.
[2023-03-18 18:42:25] [INFO ] Time to serialize gal into /tmp/LTL13407140557316762767.gal : 88 ms
[2023-03-18 18:42:25] [INFO ] Time to serialize properties into /tmp/LTL12185245638683602557.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13407140557316762767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12185245638683602557.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(((((!(F("((i11.i2.u109.p382==0)||(i16.i2.u158.p554==1))")))||("(i5.i1.u49.p174==0)"))||("(i16.i1.u153.p535==1)"))U("((i5.i1.u49...304
Formula 0 simplified : FG((!"(i5.i1.u50.p175==1)" | ((!"(i5.i1.u49.p174==0)" & !"(i16.i1.u153.p535==1)" & F"((i11.i2.u109.p382==0)||(i16.i2.u158.p554==1))"...607
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6283926183178555546
[2023-03-18 18:42:40] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6283926183178555546
Running compilation step : cd /tmp/ltsmin6283926183178555546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1231 ms.
Running link step : cd /tmp/ltsmin6283926183178555546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin6283926183178555546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((!<>((LTLAPp1==true))||(LTLAPp0==true)) U (LTLAPp2==true))&&([]((LTLAPp4==true))||(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040A-LTLCardinality-04 finished in 194594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1||F(p2)))))'
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 13 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-18 18:42:55] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-18 18:42:55] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-18 18:42:55] [INFO ] Invariant cache hit.
[2023-03-18 18:42:56] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-18 18:42:56] [INFO ] Invariant cache hit.
[2023-03-18 18:42:56] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1093 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 551 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (EQ s264 1) (EQ s122 1)), p2:(NEQ s174 1), p1:(NEQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1882 ms.
Product exploration explored 100000 steps with 50000 reset in 1914 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 p0) p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 8 factoid took 206 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-040A-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040A-LTLCardinality-11 finished in 5673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 21 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-18 18:43:01] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-18 18:43:01] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-18 18:43:01] [INFO ] Invariant cache hit.
[2023-03-18 18:43:02] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2023-03-18 18:43:02] [INFO ] Redundant transitions in 103 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
[2023-03-18 18:43:02] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-18 18:43:02] [INFO ] Dead Transitions using invariants and state equation in 308 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 12 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 1317 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 73 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 3049 steps with 32 reset in 12 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-12 finished in 1415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(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 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-18 18:43:02] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-18 18:43:03] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-18 18:43:03] [INFO ] Invariant cache hit.
[2023-03-18 18:43:03] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-18 18:43:03] [INFO ] Invariant cache hit.
[2023-03-18 18:43:03] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1168 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
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=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s419 0) (EQ s437 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 629 steps with 1 reset in 3 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-13 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||(F(p2)&&p1)))||X(G(p3)))))'
Support contains 8 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 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-18 18:43:04] [INFO ] Invariant cache hit.
[2023-03-18 18:43:04] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-18 18:43:04] [INFO ] Invariant cache hit.
[2023-03-18 18:43:04] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-18 18:43:04] [INFO ] Invariant cache hit.
[2023-03-18 18:43:05] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1098 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s445 0) (EQ s59 1)), p2:(AND (EQ s13 0) (EQ s238 1)), p3:(AND (EQ s339 0) (EQ s383 1)), p0:(AND (EQ s76 0) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1602 steps with 2 reset in 8 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-14 finished in 1263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 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 21 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-18 18:43:05] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-18 18:43:05] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-18 18:43:05] [INFO ] Invariant cache hit.
[2023-03-18 18:43:06] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2023-03-18 18:43:06] [INFO ] Redundant transitions in 92 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
[2023-03-18 18:43:06] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-18 18:43:06] [INFO ] Dead Transitions using invariants and state equation in 298 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 1242 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:(AND (OR (EQ s114 0) (EQ s149 1)) (OR (EQ s317 0) (EQ s464 1)))], 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 523 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 1288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 88 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 21 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-18 18:43:06] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-18 18:43:06] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-18 18:43:06] [INFO ] Invariant cache hit.
[2023-03-18 18:43:07] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-03-18 18:43:07] [INFO ] Invariant cache hit.
[2023-03-18 18:43:07] [INFO ] Dead Transitions using invariants and state equation in 307 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 1074 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 392 reset in 412 ms.
Product exploration explored 100000 steps with 394 reset in 589 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 based reduction with 6 factoid took 377 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 294 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=36 )
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 (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 11 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-18 18:43:09] [INFO ] Invariant cache hit.
[2023-03-18 18:43:10] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-18 18:43:10] [INFO ] Invariant cache hit.
[2023-03-18 18:43:10] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2023-03-18 18:43:10] [INFO ] Invariant cache hit.
[2023-03-18 18:43:11] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1319 ms. Remains : 561/561 places, 761/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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 235 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 270 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 394 reset in 409 ms.
Product exploration explored 100000 steps with 393 reset in 479 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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 21 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-18 18:43:13] [INFO ] Redundant transitions in 167 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
[2023-03-18 18:43:13] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-18 18:43:13] [INFO ] Dead Transitions using invariants and state equation in 449 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 21 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 668 ms. Remains : 561/561 places, 760/761 transitions.
Built C files in :
/tmp/ltsmin7251148712386509379
[2023-03-18 18:43:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7251148712386509379
Running compilation step : cd /tmp/ltsmin7251148712386509379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1487 ms.
Running link step : cd /tmp/ltsmin7251148712386509379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7251148712386509379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17094055827690325983.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 LTL mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 8 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-18 18:43:28] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-18 18:43:29] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-18 18:43:29] [INFO ] Invariant cache hit.
[2023-03-18 18:43:29] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-18 18:43:29] [INFO ] Invariant cache hit.
[2023-03-18 18:43:29] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 ms. Remains : 561/561 places, 761/761 transitions.
Built C files in :
/tmp/ltsmin1385138916212636030
[2023-03-18 18:43:29] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1385138916212636030
Running compilation step : cd /tmp/ltsmin1385138916212636030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1288 ms.
Running link step : cd /tmp/ltsmin1385138916212636030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1385138916212636030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15995451724212170784.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:43:44] [INFO ] Flatten gal took : 27 ms
[2023-03-18 18:43:44] [INFO ] Flatten gal took : 21 ms
[2023-03-18 18:43:44] [INFO ] Time to serialize gal into /tmp/LTL14779592376921472214.gal : 9 ms
[2023-03-18 18:43:45] [INFO ] Time to serialize properties into /tmp/LTL17883255165386638627.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14779592376921472214.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8563006117284004998.hoa' '-atoms' '/tmp/LTL17883255165386638627.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17883255165386638627.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8563006117284004998.hoa
Detected timeout of ITS tools.
[2023-03-18 18:44:00] [INFO ] Flatten gal took : 21 ms
[2023-03-18 18:44:00] [INFO ] Flatten gal took : 21 ms
[2023-03-18 18:44:00] [INFO ] Time to serialize gal into /tmp/LTL8925969353601655452.gal : 26 ms
[2023-03-18 18:44:00] [INFO ] Time to serialize properties into /tmp/LTL3338550100266798543.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8925969353601655452.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3338550100266798543.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.202303021504/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.
[2023-03-18 18:44:15] [INFO ] Flatten gal took : 29 ms
[2023-03-18 18:44:15] [INFO ] Applying decomposition
[2023-03-18 18:44:15] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18168621327739950794.txt' '-o' '/tmp/graph18168621327739950794.bin' '-w' '/tmp/graph18168621327739950794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18168621327739950794.bin' '-l' '-1' '-v' '-w' '/tmp/graph18168621327739950794.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:44:15] [INFO ] Decomposing Gal with order
[2023-03-18 18:44:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:44:15] [INFO ] Removed a total of 837 redundant transitions.
[2023-03-18 18:44:15] [INFO ] Flatten gal took : 62 ms
[2023-03-18 18:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 872 labels/synchronizations in 21 ms.
[2023-03-18 18:44:15] [INFO ] Time to serialize gal into /tmp/LTL7132216309120327676.gal : 18 ms
[2023-03-18 18:44:15] [INFO ] Time to serialize properties into /tmp/LTL17228238627646743446.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7132216309120327676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17228238627646743446.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/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.i0.u84.p294==1))")))||(F("(i7.i0.u76.p267==1)"))))
Formula 0 simplified : XF!"((i6.i1.u67.p233==0)||(i8.i0.u84.p294==1))" & G!"(i7.i0.u76.p267==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16259372510566520335
[2023-03-18 18:44:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16259372510566520335
Running compilation step : cd /tmp/ltsmin16259372510566520335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1404 ms.
Running link step : cd /tmp/ltsmin16259372510566520335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16259372510566520335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 99165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((((!F(p1)||p0) U p2)&&(G(p4)||p3)))))'
Warning : SL/CL computation failed.
[2023-03-18 18:44:55] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15637042721888792247
[2023-03-18 18:44:55] [INFO ] Computing symmetric may disable matrix : 763 transitions.
[2023-03-18 18:44:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:44:55] [INFO ] Computing symmetric may enable matrix : 763 transitions.
[2023-03-18 18:44:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:44:55] [INFO ] Applying decomposition
[2023-03-18 18:44:55] [INFO ] Flatten gal took : 57 ms
[2023-03-18 18:44:55] [INFO ] Computing Do-Not-Accords matrix : 763 transitions.
[2023-03-18 18:44:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:44:55] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15637042721888792247
Running compilation step : cd /tmp/ltsmin15637042721888792247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3751336123128904152.txt' '-o' '/tmp/graph3751336123128904152.bin' '-w' '/tmp/graph3751336123128904152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3751336123128904152.bin' '-l' '-1' '-v' '-w' '/tmp/graph3751336123128904152.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:44:56] [INFO ] Decomposing Gal with order
[2023-03-18 18:44:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:44:56] [INFO ] Removed a total of 837 redundant transitions.
[2023-03-18 18:44:56] [INFO ] Flatten gal took : 98 ms
[2023-03-18 18:44:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 904 labels/synchronizations in 48 ms.
[2023-03-18 18:44:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality16967300359602400415.gal : 20 ms
[2023-03-18 18:44:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality14058320650430666924.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16967300359602400415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14058320650430666924.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 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)"
Compilation finished in 2236 ms.
Running link step : cd /tmp/ltsmin15637042721888792247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15637042721888792247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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( 1/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.301: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.301: LTL layer: formula: (X([]((LTLAPp0==true)))||<>((LTLAPp1==true)))
pins2lts-mc-linux64( 5/ 8), 0.302: "(X([]((LTLAPp0==true)))||<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.302: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.335: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.388: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.389: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.430: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.435: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.438: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.459: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.478: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.870: DFS-FIFO for weak LTL, using special progress label 771
pins2lts-mc-linux64( 0/ 8), 0.870: There are 772 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.870: State length is 564, there are 767 groups
pins2lts-mc-linux64( 0/ 8), 0.870: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.870: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.871: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.871: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 4.298: ~1 levels ~960 states ~3888 transitions
pins2lts-mc-linux64( 0/ 8), 4.452: ~1 levels ~1920 states ~8112 transitions
pins2lts-mc-linux64( 0/ 8), 4.663: ~1 levels ~3840 states ~17624 transitions
pins2lts-mc-linux64( 0/ 8), 5.266: ~1 levels ~7680 states ~38144 transitions
pins2lts-mc-linux64( 0/ 8), 6.337: ~1 levels ~15360 states ~84088 transitions
pins2lts-mc-linux64( 6/ 8), 8.215: ~1 levels ~30720 states ~193304 transitions
pins2lts-mc-linux64( 6/ 8), 11.644: ~1 levels ~61440 states ~405088 transitions
pins2lts-mc-linux64( 0/ 8), 17.713: ~1 levels ~122880 states ~798624 transitions
pins2lts-mc-linux64( 6/ 8), 27.310: ~1 levels ~245760 states ~1778336 transitions
pins2lts-mc-linux64( 6/ 8), 44.558: ~1 levels ~491520 states ~3695864 transitions
pins2lts-mc-linux64( 3/ 8), 66.771: ~1 levels ~983040 states ~7334096 transitions
pins2lts-mc-linux64( 3/ 8), 101.528: ~1 levels ~1966080 states ~15032728 transitions
pins2lts-mc-linux64( 7/ 8), 168.393: ~1 levels ~3932160 states ~31561208 transitions
pins2lts-mc-linux64( 3/ 8), 259.371: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 259.518:
pins2lts-mc-linux64( 0/ 8), 259.518: mean standard work distribution: 2.9% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 259.518:
pins2lts-mc-linux64( 0/ 8), 259.518: Explored 6118770 states 52758918 transitions, fanout: 8.622
pins2lts-mc-linux64( 0/ 8), 259.518: Total exploration time 258.610 sec (258.480 sec minimum, 258.539 sec on average)
pins2lts-mc-linux64( 0/ 8), 259.518: States per second: 23660, Transitions per second: 204010
pins2lts-mc-linux64( 0/ 8), 259.518:
pins2lts-mc-linux64( 0/ 8), 259.519: Progress states detected: 11593955
pins2lts-mc-linux64( 0/ 8), 259.519: Redundant explorations: -47.2246
pins2lts-mc-linux64( 0/ 8), 259.519:
pins2lts-mc-linux64( 0/ 8), 259.519: Queue width: 8B, total height: 9081609, memory: 69.29MB
pins2lts-mc-linux64( 0/ 8), 259.519: Tree memory: 344.5MB, 31.2 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 259.519: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 259.519: Stored 770 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 259.519: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 259.519: Est. total memory use: 413.7MB (~1093.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15637042721888792247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15637042721888792247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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.
[2023-03-18 19:07:18] [INFO ] Applying decomposition
[2023-03-18 19:07:18] [INFO ] Flatten gal took : 260 ms
[2023-03-18 19:07:18] [INFO ] Decomposing Gal with order
[2023-03-18 19:07:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:07:19] [INFO ] Removed a total of 837 redundant transitions.
[2023-03-18 19:07:19] [INFO ] Flatten gal took : 394 ms
[2023-03-18 19:07:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 176 ms.
[2023-03-18 19:07:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality6321201228039060100.gal : 62 ms
[2023-03-18 19:07:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality899603404153575898.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6321201228039060100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality899603404153575898.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 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.
[2023-03-18 19:29:43] [INFO ] Flatten gal took : 690 ms
[2023-03-18 19:29:45] [INFO ] Input system was already deterministic with 763 transitions.
[2023-03-18 19:29:45] [INFO ] Transformed 563 places.
[2023-03-18 19:29:45] [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
[2023-03-18 19:29:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality15202332158276819644.gal : 7 ms
[2023-03-18 19:29:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality8416587756545073333.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15202332158276819644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8416587756545073333.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 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: 16393340 kB
MemFree: 10271228 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16212128 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r421-tajo-167905974800131"
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 ;