Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 5.8K Apr 29 15:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 15:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 169K May 10 09:34 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 ShieldIIPs-PT-020A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652926725804

Running Version 202205111006
[2022-05-19 02:18:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 02:18:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 02:18:47] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2022-05-19 02:18:47] [INFO ] Transformed 503 places.
[2022-05-19 02:18:47] [INFO ] Transformed 483 transitions.
[2022-05-19 02:18:47] [INFO ] Found NUPN structural information;
[2022-05-19 02:18:47] [INFO ] Parsed PT model containing 503 places and 483 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-020A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 45 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:47] [INFO ] Computed 181 place invariants in 24 ms
[2022-05-19 02:18:47] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:47] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 02:18:48] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:48] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:18:48] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Support contains 60 out of 503 places after structural reductions.
[2022-05-19 02:18:48] [INFO ] Flatten gal took : 88 ms
[2022-05-19 02:18:48] [INFO ] Flatten gal took : 50 ms
[2022-05-19 02:18:48] [INFO ] Input system was already deterministic with 483 transitions.
Support contains 58 out of 503 places (down from 60) after GAL structural reductions.
Finished random walk after 5956 steps, including 5 resets, run visited all 29 properties in 242 ms. (steps per millisecond=24 )
FORMULA ShieldIIPs-PT-020A-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||X(p1)))'
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 17 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:50] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:18:50] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:50] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:18:50] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:50] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 02:18:51] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s113 0) (EQ s121 0) (EQ s125 0)) (OR (EQ s3 0) (EQ s24 0))), p1:(OR (EQ s113 0) (EQ s121 0) (EQ s125 0))], 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 50000 reset in 1321 ms.
Product exploration explored 100000 steps with 50000 reset in 1222 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-020A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020A-LTLFireability-00 finished in 3835 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U G(!X((F(G(p1)) U p1)))))'
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 16 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:54] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:18:54] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:54] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:18:54] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:54] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:18:55] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 134 ms :[p1, (AND p0 p1), p0]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s383 1) (EQ s397 1)), p0:(OR (NOT (AND (EQ s308 1) (EQ s322 1))) (EQ s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33127 reset in 919 ms.
Product exploration explored 100000 steps with 33460 reset in 979 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 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[p1, (AND p0 p1), p0]
Finished random walk after 459 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[p1, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 114 ms :[p1, (AND p0 p1), p0]
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 15 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:58] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:18:58] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:58] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:18:58] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:18:58] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:18:58] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 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 p1)), (X p0), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 235 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[p1, (AND p0 p1), p0]
Finished random walk after 207 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[p1, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 579 ms :[p1, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 98 ms :[p1, (AND p0 p1), p0]
Product exploration explored 100000 steps with 33385 reset in 928 ms.
Product exploration explored 100000 steps with 33397 reset in 973 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 98 ms :[p1, (AND p0 p1), p0]
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 503 transition count 483
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 56 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2022-05-19 02:19:02] [INFO ] Redundant transitions in 89 ms returned [475]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 482 rows 503 cols
[2022-05-19 02:19:02] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:19:02] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/503 places, 482/483 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 54 ms. Remains 503 /503 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 503/503 places, 482/483 transitions.
Product exploration explored 100000 steps with 33413 reset in 2824 ms.
Product exploration explored 100000 steps with 33231 reset in 2807 ms.
Built C files in :
/tmp/ltsmin3991660654219563138
[2022-05-19 02:19:08] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3991660654219563138
Running compilation step : cd /tmp/ltsmin3991660654219563138;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 885 ms.
Running link step : cd /tmp/ltsmin3991660654219563138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3991660654219563138;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11888949289842794349.hoa' '--buchi-type=spotba'
LTSmin run took 646 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-020A-LTLFireability-01 finished in 16307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(F(G(F(p1))))&&p2))))'
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 36 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:19:10] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:19:10] [INFO ] Implicit Places using invariants in 233 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 237 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/503 places, 481/483 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/503 places, 481/483 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s30 1) (EQ s43 1)), p1:(EQ s166 0), p2:(OR (EQ s114 0) (EQ s135 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 126 reset in 543 ms.
Product exploration explored 100000 steps with 123 reset in 633 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) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 350 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:19:12] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:19:12] [INFO ] [Real]Absence check using 180 positive place invariants in 25 ms returned sat
[2022-05-19 02:19:12] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 02:19:13] [INFO ] [Nat]Absence check using 180 positive place invariants in 30 ms returned sat
[2022-05-19 02:19:13] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 02:19:13] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2022-05-19 02:19:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2022-05-19 02:19:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2022-05-19 02:19:13] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-05-19 02:19:13] [INFO ] After 783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 481/481 transitions.
Partial Free-agglomeration rule applied 136 times.
Drop transitions removed 136 transitions
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 500 transition count 481
Applied a total of 136 rules in 40 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 481/481 transitions.
Finished random walk after 7364 steps, including 2 resets, run visited all 1 properties in 43 ms. (steps per millisecond=171 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 348 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 23 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:19:14] [INFO ] Computed 180 place invariants in 5 ms
[2022-05-19 02:19:14] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:19:14] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:19:15] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2022-05-19 02:19:15] [INFO ] Redundant transitions in 49 ms returned [475]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2022-05-19 02:19:15] [INFO ] Computed 180 place invariants in 4 ms
[2022-05-19 02:19:15] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/500 places, 480/481 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1652 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 480 rows 500 cols
[2022-05-19 02:19:17] [INFO ] Computed 180 place invariants in 4 ms
[2022-05-19 02:19:17] [INFO ] [Real]Absence check using 180 positive place invariants in 24 ms returned sat
[2022-05-19 02:19:17] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 02:19:17] [INFO ] [Nat]Absence check using 180 positive place invariants in 24 ms returned sat
[2022-05-19 02:19:17] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 02:19:18] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2022-05-19 02:19:18] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-05-19 02:19:18] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2022-05-19 02:19:18] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2022-05-19 02:19:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 337 ms
[2022-05-19 02:19:18] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-19 02:19:18] [INFO ] After 897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 480/480 transitions.
Partial Free-agglomeration rule applied 136 times.
Drop transitions removed 136 transitions
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 500 transition count 480
Applied a total of 136 rules in 34 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 480/480 transitions.
Finished random walk after 1582 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=158 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 123 reset in 504 ms.
Product exploration explored 100000 steps with 126 reset in 581 ms.
Built C files in :
/tmp/ltsmin6428979329358914765
[2022-05-19 02:19:20] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2022-05-19 02:19:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:19:20] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2022-05-19 02:19:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:19:20] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2022-05-19 02:19:20] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:19:20] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6428979329358914765
Running compilation step : cd /tmp/ltsmin6428979329358914765;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1933 ms.
Running link step : cd /tmp/ltsmin6428979329358914765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6428979329358914765;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased118919793270992979.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
// Phase 1: matrix 480 rows 500 cols
[2022-05-19 02:19:35] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:19:35] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 480 rows 500 cols
[2022-05-19 02:19:35] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:19:36] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2022-05-19 02:19:36] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 480 rows 500 cols
[2022-05-19 02:19:36] [INFO ] Computed 180 place invariants in 7 ms
[2022-05-19 02:19:36] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 480/480 transitions.
Built C files in :
/tmp/ltsmin14915540167000321425
[2022-05-19 02:19:36] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2022-05-19 02:19:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:19:36] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2022-05-19 02:19:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:19:36] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2022-05-19 02:19:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:19:36] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14915540167000321425
Running compilation step : cd /tmp/ltsmin14915540167000321425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1040 ms.
Running link step : cd /tmp/ltsmin14915540167000321425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14915540167000321425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3438256592790195680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:19:51] [INFO ] Flatten gal took : 39 ms
[2022-05-19 02:19:51] [INFO ] Flatten gal took : 38 ms
[2022-05-19 02:19:51] [INFO ] Time to serialize gal into /tmp/LTL14462552901165556037.gal : 5 ms
[2022-05-19 02:19:51] [INFO ] Time to serialize properties into /tmp/LTL17592545774702827645.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14462552901165556037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17592545774702827645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1446255...268
Read 1 LTL properties
Checking formula 0 : !((F((G("((p30==1)&&(p43==1))"))||((G(F(G(F("(p166==0)")))))&&("((p114==0)||(p135==0))")))))
Formula 0 simplified : !F(G"((p30==1)&&(p43==1))" | ("((p114==0)||(p135==0))" & GFGF"(p166==0)"))
Detected timeout of ITS tools.
[2022-05-19 02:20:06] [INFO ] Flatten gal took : 38 ms
[2022-05-19 02:20:06] [INFO ] Applying decomposition
[2022-05-19 02:20:06] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1073480593712345333.txt' '-o' '/tmp/graph1073480593712345333.bin' '-w' '/tmp/graph1073480593712345333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1073480593712345333.bin' '-l' '-1' '-v' '-w' '/tmp/graph1073480593712345333.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:20:06] [INFO ] Decomposing Gal with order
[2022-05-19 02:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:20:06] [INFO ] Removed a total of 315 redundant transitions.
[2022-05-19 02:20:07] [INFO ] Flatten gal took : 84 ms
[2022-05-19 02:20:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 308 labels/synchronizations in 36 ms.
[2022-05-19 02:20:07] [INFO ] Time to serialize gal into /tmp/LTL1852414525643201766.gal : 9 ms
[2022-05-19 02:20:07] [INFO ] Time to serialize properties into /tmp/LTL1606296138455346118.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1852414525643201766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1606296138455346118.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1852414...245
Read 1 LTL properties
Checking formula 0 : !((F((G("((i1.i2.u11.p30==1)&&(i1.i0.u16.p43==1))"))||((G(F(G(F("(i6.i1.u60.p166==0)")))))&&("((i4.i1.u42.p114==0)||(i5.i1.u49.p135==0...163
Formula 0 simplified : !F(G"((i1.i2.u11.p30==1)&&(i1.i0.u16.p43==1))" | ("((i4.i1.u42.p114==0)||(i5.i1.u49.p135==0))" & GFGF"(i6.i1.u60.p166==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7110531499461235496
[2022-05-19 02:20:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7110531499461235496
Running compilation step : cd /tmp/ltsmin7110531499461235496;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 757 ms.
Running link step : cd /tmp/ltsmin7110531499461235496;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7110531499461235496;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||([](<>([](<>((LTLAPp1==true)))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-03 finished in 86903 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((X(X(p1))||p0))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 16 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:37] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:20:37] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:37] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:20:37] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:37] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:20:38] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s58 0) (EQ s72 0)), p1:(OR (EQ s1 0) (EQ s20 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10741 steps with 11 reset in 76 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-05 finished in 1188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((F(!p0)||p1)) U p2))))'
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 10 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:38] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:20:38] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:38] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 02:20:39] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:39] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:20:39] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s151 1), p1:(AND (EQ s381 1) (EQ s392 1)), p0:(AND (EQ s36 1) (EQ s40 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 100 reset in 520 ms.
Product exploration explored 100000 steps with 98 reset in 598 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 514 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Finished random walk after 1095 steps, including 0 resets, run visited all 4 properties in 38 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F p2), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 8 factoid took 442 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:42] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:20:42] [INFO ] [Real]Absence check using 181 positive place invariants in 63 ms returned sat
[2022-05-19 02:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:20:43] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2022-05-19 02:20:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:20:43] [INFO ] [Nat]Absence check using 181 positive place invariants in 46 ms returned sat
[2022-05-19 02:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:20:43] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2022-05-19 02:20:44] [INFO ] Computed and/alt/rep : 444/1543/444 causal constraints (skipped 38 transitions) in 34 ms.
[2022-05-19 02:20:49] [INFO ] Added : 372 causal constraints over 75 iterations in 5119 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:49] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:20:49] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:49] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:20:49] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:49] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:20:50] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 395 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Finished random walk after 3960 steps, including 3 resets, run visited all 4 properties in 110 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F p2), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 9 factoid took 1003 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:20:52] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:20:52] [INFO ] [Real]Absence check using 181 positive place invariants in 64 ms returned sat
[2022-05-19 02:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:20:53] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2022-05-19 02:20:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:20:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 46 ms returned sat
[2022-05-19 02:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:20:53] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2022-05-19 02:20:53] [INFO ] Computed and/alt/rep : 444/1543/444 causal constraints (skipped 38 transitions) in 27 ms.
[2022-05-19 02:20:58] [INFO ] Added : 372 causal constraints over 75 iterations in 5090 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 99 reset in 507 ms.
Product exploration explored 100000 steps with 100 reset in 581 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 503 transition count 483
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 23 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2022-05-19 02:21:00] [INFO ] Redundant transitions in 46 ms returned [475]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 482 rows 503 cols
[2022-05-19 02:21:00] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:21:00] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/503 places, 482/483 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 16 ms. Remains 503 /503 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 503/503 places, 482/483 transitions.
Product exploration explored 100000 steps with 100 reset in 602 ms.
Product exploration explored 100000 steps with 99 reset in 585 ms.
Built C files in :
/tmp/ltsmin2957619479204677664
[2022-05-19 02:21:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2957619479204677664
Running compilation step : cd /tmp/ltsmin2957619479204677664;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 791 ms.
Running link step : cd /tmp/ltsmin2957619479204677664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2957619479204677664;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10364093352714475998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:21:17] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:21:17] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:21:17] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:21:17] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:21:17] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:21:18] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Built C files in :
/tmp/ltsmin4889811085603280573
[2022-05-19 02:21:18] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4889811085603280573
Running compilation step : cd /tmp/ltsmin4889811085603280573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 799 ms.
Running link step : cd /tmp/ltsmin4889811085603280573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4889811085603280573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7618109778428807121.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:21:33] [INFO ] Flatten gal took : 27 ms
[2022-05-19 02:21:33] [INFO ] Flatten gal took : 36 ms
[2022-05-19 02:21:33] [INFO ] Time to serialize gal into /tmp/LTL3832351956639855256.gal : 3 ms
[2022-05-19 02:21:33] [INFO ] Time to serialize properties into /tmp/LTL4393605127942979934.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3832351956639855256.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4393605127942979934.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3832351...266
Read 1 LTL properties
Checking formula 0 : !((G(X((G((F(!("(((p36==1)&&(p40==1))&&(p52==1))")))||("((p381==1)&&(p392==1))")))U("(p151==1)")))))
Formula 0 simplified : !GX(G("((p381==1)&&(p392==1))" | F!"(((p36==1)&&(p40==1))&&(p52==1))") U "(p151==1)")
Detected timeout of ITS tools.
[2022-05-19 02:21:48] [INFO ] Flatten gal took : 21 ms
[2022-05-19 02:21:48] [INFO ] Applying decomposition
[2022-05-19 02:21:48] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12040046372711445244.txt' '-o' '/tmp/graph12040046372711445244.bin' '-w' '/tmp/graph12040046372711445244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12040046372711445244.bin' '-l' '-1' '-v' '-w' '/tmp/graph12040046372711445244.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:21:48] [INFO ] Decomposing Gal with order
[2022-05-19 02:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:21:48] [INFO ] Removed a total of 320 redundant transitions.
[2022-05-19 02:21:48] [INFO ] Flatten gal took : 38 ms
[2022-05-19 02:21:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 25 ms.
[2022-05-19 02:21:48] [INFO ] Time to serialize gal into /tmp/LTL7720155193411571267.gal : 6 ms
[2022-05-19 02:21:48] [INFO ] Time to serialize properties into /tmp/LTL4104472083132578059.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7720155193411571267.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4104472083132578059.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7720155...245
Read 1 LTL properties
Checking formula 0 : !((G(X((G((F(!("(((i1.i1.u13.p36==1)&&(i1.i1.u15.p40==1))&&(i1.i0.u18.p52==1))")))||("((i15.i1.u137.p381==1)&&(i15.i1.u141.p392==1))")...185
Formula 0 simplified : !GX(G("((i15.i1.u137.p381==1)&&(i15.i1.u141.p392==1))" | F!"(((i1.i1.u13.p36==1)&&(i1.i1.u15.p40==1))&&(i1.i0.u18.p52==1))") U "(i5....172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12181447208777573661
[2022-05-19 02:22:03] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12181447208777573661
Running compilation step : cd /tmp/ltsmin12181447208777573661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 770 ms.
Running link step : cd /tmp/ltsmin12181447208777573661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12181447208777573661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(([]((<>(!(LTLAPp0==true))||(LTLAPp1==true))) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-06 finished in 100320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||X(F(p2)))))'
Support contains 7 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 12 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:18] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:22:19] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:19] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:22:19] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:19] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 02:22:19] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s263 1) (EQ s271 1) (EQ s277 1)), p1:(AND (EQ s333 1) (EQ s348 1)), p2:(OR (EQ s358 0) (EQ s373 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 948 ms.
Product exploration explored 100000 steps with 50000 reset in 1020 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) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) p2)
Knowledge based reduction with 9 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-020A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020A-LTLFireability-07 finished in 3278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(!p0)||p1) U p2))'
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:22] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:22:22] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:22] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:22:22] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:22] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:22:22] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(EQ s397 1), p1:(AND (EQ s56 1) (EQ s66 1)), p0:(AND (EQ s261 1) (EQ s267 1) (EQ s276 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-10 finished in 1053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
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 502 transition count 482
Applied a total of 2 rules in 16 ms. Remains 502 /503 variables (removed 1) and now considering 482/483 (removed 1) transitions.
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:22:23] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:22:23] [INFO ] Implicit Places using invariants in 232 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 233 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 482/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 501/503 places, 482/483 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s325 1) (AND (EQ s481 1) (EQ s490 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6326 reset in 511 ms.
Product exploration explored 100000 steps with 6319 reset in 579 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:22:24] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:22:25] [INFO ] [Real]Absence check using 180 positive place invariants in 67 ms returned sat
[2022-05-19 02:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:22:25] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2022-05-19 02:22:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:22:26] [INFO ] [Nat]Absence check using 180 positive place invariants in 55 ms returned sat
[2022-05-19 02:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:22:26] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2022-05-19 02:22:26] [INFO ] Computed and/alt/rep : 443/1534/443 causal constraints (skipped 38 transitions) in 35 ms.
[2022-05-19 02:22:30] [INFO ] Added : 339 causal constraints over 68 iterations in 3760 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 482/482 transitions.
Applied a total of 0 rules in 16 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:22:30] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:22:30] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 02:22:30] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:22:31] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2022-05-19 02:22:31] [INFO ] Redundant transitions in 46 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:22:31] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:22:31] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/501 places, 481/482 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 501/501 places, 481/482 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:22:32] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:22:32] [INFO ] [Real]Absence check using 180 positive place invariants in 77 ms returned sat
[2022-05-19 02:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:22:33] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2022-05-19 02:22:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:22:33] [INFO ] [Nat]Absence check using 180 positive place invariants in 54 ms returned sat
[2022-05-19 02:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:22:33] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2022-05-19 02:22:33] [INFO ] Computed and/alt/rep : 443/1539/443 causal constraints (skipped 37 transitions) in 25 ms.
[2022-05-19 02:22:37] [INFO ] Added : 385 causal constraints over 77 iterations in 3624 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6155 reset in 508 ms.
Product exploration explored 100000 steps with 6257 reset in 578 ms.
Built C files in :
/tmp/ltsmin4150427006079930095
[2022-05-19 02:22:38] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2022-05-19 02:22:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:22:38] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2022-05-19 02:22:38] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:22:38] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2022-05-19 02:22:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:22:38] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4150427006079930095
Running compilation step : cd /tmp/ltsmin4150427006079930095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1053 ms.
Running link step : cd /tmp/ltsmin4150427006079930095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4150427006079930095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1997514943903436330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:22:53] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:22:54] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:22:54] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:22:54] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2022-05-19 02:22:54] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:22:54] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:22:54] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin12515658457444230944
[2022-05-19 02:22:54] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2022-05-19 02:22:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:22:54] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2022-05-19 02:22:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:22:54] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2022-05-19 02:22:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:22:54] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12515658457444230944
Running compilation step : cd /tmp/ltsmin12515658457444230944;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1035 ms.
Running link step : cd /tmp/ltsmin12515658457444230944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12515658457444230944;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5147384922413575086.hoa' '--buchi-type=spotba'
LTSmin run took 1465 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-020A-LTLFireability-12 finished in 34240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
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 4 place count 501 transition count 481
Applied a total of 4 rules in 21 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:22:57] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:22:57] [INFO ] Implicit Places using invariants in 230 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 231 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/503 places, 481/483 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/503 places, 481/483 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s112 1) (EQ s145 1)), p0:(OR (NOT (AND (EQ s238 1) (EQ s246 1) (EQ s250 1))) (AND (EQ s112 1) (EQ s145 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1061 steps with 0 reset in 10 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-13 finished in 349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(p0)&&G(p1))||p2))))'
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:57] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:22:57] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:57] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 02:22:58] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:58] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:22:58] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (EQ s355 1) (EQ s368 1)), p2:(AND (EQ s72 1) (EQ s213 1) (EQ s223 1) (EQ s225 1)), p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-14 finished in 1128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(X(p1))))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:58] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:22:59] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:59] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:22:59] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 02:22:59] [INFO ] Computed 181 place invariants in 1 ms
[2022-05-19 02:22:59] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s441 1), p1:(OR (EQ s183 0) (EQ s198 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-15 finished in 1142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(F(G(F(p1))))&&p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((F(!p0)||p1)) U p2))))'
Found a SL insensitive property : ShieldIIPs-PT-020A-LTLFireability-06
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
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 4 place count 501 transition count 481
Applied a total of 4 rules in 21 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:23:00] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:23:00] [INFO ] Implicit Places using invariants in 225 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 500/503 places, 481/483 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/503 places, 481/483 transitions.
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s151 1), p1:(AND (EQ s381 1) (EQ s392 1)), p0:(AND (EQ s36 1) (EQ s40 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 99 reset in 512 ms.
Product exploration explored 100000 steps with 100 reset in 567 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 357 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Finished random walk after 963 steps, including 0 resets, run visited all 4 properties in 27 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F p2), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 8 factoid took 389 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:23:03] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:23:03] [INFO ] [Real]Absence check using 180 positive place invariants in 61 ms returned sat
[2022-05-19 02:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:23:03] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2022-05-19 02:23:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:23:04] [INFO ] [Nat]Absence check using 180 positive place invariants in 47 ms returned sat
[2022-05-19 02:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:23:04] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2022-05-19 02:23:04] [INFO ] Computed and/alt/rep : 442/1541/442 causal constraints (skipped 38 transitions) in 24 ms.
[2022-05-19 02:23:08] [INFO ] Added : 360 causal constraints over 72 iterations in 3980 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:23:08] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:23:08] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:23:08] [INFO ] Computed 180 place invariants in 0 ms
[2022-05-19 02:23:09] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:23:09] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:23:09] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 481/481 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Finished random walk after 799 steps, including 0 resets, run visited all 4 properties in 24 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F p2), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 9 factoid took 455 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:23:11] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:23:11] [INFO ] [Real]Absence check using 180 positive place invariants in 62 ms returned sat
[2022-05-19 02:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:23:12] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2022-05-19 02:23:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:23:12] [INFO ] [Nat]Absence check using 180 positive place invariants in 46 ms returned sat
[2022-05-19 02:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:23:12] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-05-19 02:23:12] [INFO ] Computed and/alt/rep : 442/1541/442 causal constraints (skipped 38 transitions) in 22 ms.
[2022-05-19 02:23:16] [INFO ] Added : 360 causal constraints over 72 iterations in 4024 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 100 reset in 492 ms.
Product exploration explored 100000 steps with 99 reset in 558 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2022-05-19 02:23:18] [INFO ] Redundant transitions in 46 ms returned [475]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2022-05-19 02:23:18] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:23:18] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/500 places, 480/481 transitions.
Product exploration explored 100000 steps with 100 reset in 493 ms.
Product exploration explored 100000 steps with 100 reset in 556 ms.
Built C files in :
/tmp/ltsmin6738615877684769228
[2022-05-19 02:23:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6738615877684769228
Running compilation step : cd /tmp/ltsmin6738615877684769228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 761 ms.
Running link step : cd /tmp/ltsmin6738615877684769228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6738615877684769228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1247969758941318548.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:23:34] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:23:35] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:23:35] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:23:35] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
// Phase 1: matrix 481 rows 500 cols
[2022-05-19 02:23:35] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:23:35] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin9913077214689798521
[2022-05-19 02:23:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9913077214689798521
Running compilation step : cd /tmp/ltsmin9913077214689798521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 760 ms.
Running link step : cd /tmp/ltsmin9913077214689798521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9913077214689798521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16774715841382282773.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:23:50] [INFO ] Flatten gal took : 21 ms
[2022-05-19 02:23:50] [INFO ] Flatten gal took : 20 ms
[2022-05-19 02:23:50] [INFO ] Time to serialize gal into /tmp/LTL5269637612075723015.gal : 3 ms
[2022-05-19 02:23:50] [INFO ] Time to serialize properties into /tmp/LTL3192534214604123309.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5269637612075723015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3192534214604123309.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5269637...266
Read 1 LTL properties
Checking formula 0 : !((G(X((G((F(!("(((p36==1)&&(p40==1))&&(p52==1))")))||("((p381==1)&&(p392==1))")))U("(p151==1)")))))
Formula 0 simplified : !GX(G("((p381==1)&&(p392==1))" | F!"(((p36==1)&&(p40==1))&&(p52==1))") U "(p151==1)")
Detected timeout of ITS tools.
[2022-05-19 02:24:05] [INFO ] Flatten gal took : 22 ms
[2022-05-19 02:24:05] [INFO ] Applying decomposition
[2022-05-19 02:24:06] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12366040728986176532.txt' '-o' '/tmp/graph12366040728986176532.bin' '-w' '/tmp/graph12366040728986176532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12366040728986176532.bin' '-l' '-1' '-v' '-w' '/tmp/graph12366040728986176532.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:24:06] [INFO ] Decomposing Gal with order
[2022-05-19 02:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:24:06] [INFO ] Removed a total of 317 redundant transitions.
[2022-05-19 02:24:06] [INFO ] Flatten gal took : 32 ms
[2022-05-19 02:24:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 304 labels/synchronizations in 12 ms.
[2022-05-19 02:24:06] [INFO ] Time to serialize gal into /tmp/LTL747756538222149161.gal : 6 ms
[2022-05-19 02:24:06] [INFO ] Time to serialize properties into /tmp/LTL7021204484521624011.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL747756538222149161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7021204484521624011.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7477565...244
Read 1 LTL properties
Checking formula 0 : !((G(X((G((F(!("(((i1.i1.u13.p36==1)&&(i1.i1.u15.p40==1))&&(i1.i0.u18.p52==1))")))||("((i15.i1.u137.p381==1)&&(i15.i1.u141.p392==1))")...185
Formula 0 simplified : !GX(G("((i15.i1.u137.p381==1)&&(i15.i1.u141.p392==1))" | F!"(((i1.i1.u13.p36==1)&&(i1.i1.u15.p40==1))&&(i1.i0.u18.p52==1))") U "(i5....172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin410358799648835959
[2022-05-19 02:24:21] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin410358799648835959
Running compilation step : cd /tmp/ltsmin410358799648835959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 774 ms.
Running link step : cd /tmp/ltsmin410358799648835959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin410358799648835959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(([]((<>(!(LTLAPp0==true))||(LTLAPp1==true))) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-06 finished in 96241 ms.
[2022-05-19 02:24:36] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9307664424466362551
[2022-05-19 02:24:36] [INFO ] Computing symmetric may disable matrix : 483 transitions.
[2022-05-19 02:24:36] [INFO ] Applying decomposition
[2022-05-19 02:24:36] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:24:36] [INFO ] Computing symmetric may enable matrix : 483 transitions.
[2022-05-19 02:24:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:24:36] [INFO ] Flatten gal took : 20 ms
[2022-05-19 02:24:36] [INFO ] Computing Do-Not-Accords matrix : 483 transitions.
[2022-05-19 02:24:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:24:36] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9307664424466362551
Running compilation step : cd /tmp/ltsmin9307664424466362551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5237840211245081987.txt' '-o' '/tmp/graph5237840211245081987.bin' '-w' '/tmp/graph5237840211245081987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5237840211245081987.bin' '-l' '-1' '-v' '-w' '/tmp/graph5237840211245081987.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:24:36] [INFO ] Decomposing Gal with order
[2022-05-19 02:24:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:24:36] [INFO ] Removed a total of 320 redundant transitions.
[2022-05-19 02:24:36] [INFO ] Flatten gal took : 32 ms
[2022-05-19 02:24:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 308 labels/synchronizations in 12 ms.
[2022-05-19 02:24:36] [INFO ] Time to serialize gal into /tmp/LTLFireability2509342242666776294.gal : 6 ms
[2022-05-19 02:24:36] [INFO ] Time to serialize properties into /tmp/LTLFireability926817203228037055.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2509342242666776294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability926817203228037055.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 2 LTL properties
Checking formula 0 : !((F((G("((i1.i1.u11.p30==1)&&(i1.i0.u16.p43==1))"))||((G(F(G(F("(i6.i2.u60.p166==0)")))))&&("((i4.i0.u42.p114==0)||(i5.i1.u49.p135==0...163
Formula 0 simplified : !F(G"((i1.i1.u11.p30==1)&&(i1.i0.u16.p43==1))" | ("((i4.i0.u42.p114==0)||(i5.i1.u49.p135==0))" & GFGF"(i6.i2.u60.p166==0)"))
Compilation finished in 1084 ms.
Running link step : cd /tmp/ltsmin9307664424466362551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9307664424466362551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||([](<>([](<>((LTLAPp1==true)))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.053: Initializing POR dependencies: labels 489, guards 483
pins2lts-mc-linux64( 7/ 8), 1.016: LTL layer: formula: <>(([]((LTLAPp0==true))||([](<>([](<>((LTLAPp1==true)))))&&(LTLAPp2==true))))
pins2lts-mc-linux64( 7/ 8), 1.016: "<>(([]((LTLAPp0==true))||([](<>([](<>((LTLAPp1==true)))))&&(LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 1.017: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.104: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.123: There are 490 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.123: State length is 504, there are 497 groups
pins2lts-mc-linux64( 0/ 8), 1.123: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.123: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.123: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.123: Visible groups: 0 / 497, labels: 3 / 490
pins2lts-mc-linux64( 0/ 8), 1.123: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.123: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 1.170: [Blue] ~120 levels ~960 states ~2360 transitions
pins2lts-mc-linux64( 3/ 8), 1.244: [Blue] ~240 levels ~1920 states ~6840 transitions
pins2lts-mc-linux64( 2/ 8), 1.381: [Blue] ~480 levels ~3840 states ~16112 transitions
pins2lts-mc-linux64( 1/ 8), 1.637: [Blue] ~960 levels ~7680 states ~34720 transitions
pins2lts-mc-linux64( 2/ 8), 1.870: [Blue] ~1154 levels ~15360 states ~59784 transitions
pins2lts-mc-linux64( 6/ 8), 2.184: [Blue] ~1133 levels ~30720 states ~81376 transitions
pins2lts-mc-linux64( 6/ 8), 2.811: [Blue] ~1133 levels ~61440 states ~139568 transitions
pins2lts-mc-linux64( 6/ 8), 3.922: [Blue] ~1133 levels ~122880 states ~260984 transitions
pins2lts-mc-linux64( 6/ 8), 6.288: [Blue] ~1133 levels ~245760 states ~474960 transitions
pins2lts-mc-linux64( 6/ 8), 10.864: [Blue] ~1133 levels ~491520 states ~952640 transitions
pins2lts-mc-linux64( 6/ 8), 19.431: [Blue] ~1137 levels ~983040 states ~1856384 transitions
pins2lts-mc-linux64( 6/ 8), 35.610: [Blue] ~1137 levels ~1966080 states ~3642912 transitions
pins2lts-mc-linux64( 6/ 8), 67.917: [Blue] ~1137 levels ~3932160 states ~7310464 transitions
pins2lts-mc-linux64( 6/ 8), 135.670: [Blue] ~1137 levels ~7864320 states ~15143464 transitions
pins2lts-mc-linux64( 6/ 8), 269.713: [Blue] ~1137 levels ~15728640 states ~31003520 transitions
pins2lts-mc-linux64( 7/ 8), 518.006: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 518.048:
pins2lts-mc-linux64( 0/ 8), 518.048: Explored 26796515 states 65542421 transitions, fanout: 2.446
pins2lts-mc-linux64( 0/ 8), 518.048: Total exploration time 516.920 sec (516.880 sec minimum, 516.889 sec on average)
pins2lts-mc-linux64( 0/ 8), 518.048: States per second: 51839, Transitions per second: 126794
pins2lts-mc-linux64( 0/ 8), 518.048:
pins2lts-mc-linux64( 0/ 8), 518.048: State space has 26840317 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 518.048: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 518.048: blue states: 26796515 (99.84%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 518.048: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 518.048: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 518.048:
pins2lts-mc-linux64( 0/ 8), 518.048: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 518.048:
pins2lts-mc-linux64( 0/ 8), 518.048: Queue width: 8B, total height: 9707, memory: 0.07MB
pins2lts-mc-linux64( 0/ 8), 518.048: Tree memory: 460.8MB, 18.0 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 518.048: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 518.048: Stored 486 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 518.048: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 518.048: Est. total memory use: 460.8MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9307664424466362551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||([](<>([](<>((LTLAPp1==true)))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9307664424466362551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||([](<>([](<>((LTLAPp1==true)))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 02:46:33] [INFO ] Applying decomposition
[2022-05-19 02:46:33] [INFO ] Flatten gal took : 20 ms
[2022-05-19 02:46:33] [INFO ] Decomposing Gal with order
[2022-05-19 02:46:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:46:33] [INFO ] Removed a total of 340 redundant transitions.
[2022-05-19 02:46:33] [INFO ] Flatten gal took : 40 ms
[2022-05-19 02:46:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 10 ms.
[2022-05-19 02:46:33] [INFO ] Time to serialize gal into /tmp/LTLFireability14759495233129979920.gal : 4 ms
[2022-05-19 02:46:33] [INFO ] Time to serialize properties into /tmp/LTLFireability17929508893510364306.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14759495233129979920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17929508893510364306.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((F((G("((i10.u212.p30==1)&&(u19.p43==1))"))||((G(F(G(F("(u68.p166==0)")))))&&("((u48.p114==0)||(u56.p135==0))")))))
Formula 0 simplified : !F(G"((i10.u212.p30==1)&&(u19.p43==1))" | ("((u48.p114==0)||(u56.p135==0))" & GFGF"(u68.p166==0)"))
Detected timeout of ITS tools.
[2022-05-19 03:08:41] [INFO ] Flatten gal took : 293 ms
[2022-05-19 03:08:42] [INFO ] Input system was already deterministic with 483 transitions.
[2022-05-19 03:08:42] [INFO ] Transformed 503 places.
[2022-05-19 03:08:42] [INFO ] Transformed 483 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-19 03:08:42] [INFO ] Time to serialize gal into /tmp/LTLFireability14981189204441208072.gal : 15 ms
[2022-05-19 03:08:42] [INFO ] Time to serialize properties into /tmp/LTLFireability6492722696273838881.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14981189204441208072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6492722696273838881.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p30==1)&&(p43==1))"))||((G(F(G(F("(p166==0)")))))&&("((p114==0)||(p135==0))")))))
Formula 0 simplified : !F(G"((p30==1)&&(p43==1))" | ("((p114==0)||(p135==0))" & GFGF"(p166==0)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-020A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-020A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286024700100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020A.tgz
mv ShieldIIPs-PT-020A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;