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-165286025000268.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 ShieldIIPt-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 9.3K Apr 29 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 29 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 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 167K 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 ShieldIIPt-PT-010B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652956155420

Running Version 202205111006
[2022-05-19 10:29:16] [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 10:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 10:29:17] [INFO ] Load time of PNML (sax parser for PT used): 661 ms
[2022-05-19 10:29:17] [INFO ] Transformed 703 places.
[2022-05-19 10:29:17] [INFO ] Transformed 653 transitions.
[2022-05-19 10:29:17] [INFO ] Found NUPN structural information;
[2022-05-19 10:29:17] [INFO ] Parsed PT model containing 703 places and 653 transitions in 782 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldIIPt-PT-010B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 653/653 transitions.
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 105 place count 598 transition count 548
Iterating global reduction 0 with 105 rules applied. Total rules applied 210 place count 598 transition count 548
Applied a total of 210 rules in 113 ms. Remains 598 /703 variables (removed 105) and now considering 548/653 (removed 105) transitions.
// Phase 1: matrix 548 rows 598 cols
[2022-05-19 10:29:17] [INFO ] Computed 91 place invariants in 24 ms
[2022-05-19 10:29:17] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 548 rows 598 cols
[2022-05-19 10:29:17] [INFO ] Computed 91 place invariants in 6 ms
[2022-05-19 10:29:18] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
// Phase 1: matrix 548 rows 598 cols
[2022-05-19 10:29:18] [INFO ] Computed 91 place invariants in 8 ms
[2022-05-19 10:29:18] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 598/703 places, 548/653 transitions.
Finished structural reductions, in 1 iterations. Remains : 598/703 places, 548/653 transitions.
Support contains 24 out of 598 places after structural reductions.
[2022-05-19 10:29:18] [INFO ] Flatten gal took : 67 ms
[2022-05-19 10:29:18] [INFO ] Flatten gal took : 30 ms
[2022-05-19 10:29:18] [INFO ] Input system was already deterministic with 548 transitions.
Support contains 23 out of 598 places (down from 24) after GAL structural reductions.
Finished random walk after 9774 steps, including 2 resets, run visited all 20 properties in 184 ms. (steps per millisecond=53 )
Computed a total of 161 stabilizing places and 161 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 597 transition count 428
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 478 transition count 428
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 238 place count 478 transition count 350
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 394 place count 400 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 396 place count 398 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 398 place count 398 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 398 place count 398 transition count 346
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 402 place count 396 transition count 346
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 744 place count 225 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 745 place count 225 transition count 174
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 3 with 2 rules applied. Total rules applied 747 place count 224 transition count 173
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 803 place count 196 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 805 place count 194 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 192 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 807 place count 192 transition count 188
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 809 place count 191 transition count 188
Applied a total of 809 rules in 133 ms. Remains 191 /598 variables (removed 407) and now considering 188/548 (removed 360) transitions.
// Phase 1: matrix 188 rows 191 cols
[2022-05-19 10:29:19] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:29:19] [INFO ] Implicit Places using invariants in 100 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/598 places, 188/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 189 transition count 187
Applied a total of 2 rules in 13 ms. Remains 189 /190 variables (removed 1) and now considering 187/188 (removed 1) transitions.
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:29:19] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:29:19] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:29:19] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-19 10:29:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 10:29:19] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 189/598 places, 187/548 transitions.
Finished structural reductions, in 2 iterations. Remains : 189/598 places, 187/548 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s136 1), p1:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19710 reset in 388 ms.
Product exploration explored 100000 steps with 19717 reset in 347 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/189 stabilizing places and 2/187 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 2686 steps, including 0 resets, run visited all 3 properties in 27 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 353 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 187/187 transitions.
Applied a total of 0 rules in 14 ms. Remains 189 /189 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:29:21] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:29:21] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:29:21] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-19 10:29:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 10:29:22] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2022-05-19 10:29:22] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:29:22] [INFO ] Computed 88 place invariants in 5 ms
[2022-05-19 10:29:22] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 187/187 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/189 stabilizing places and 2/187 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 609 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 528 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=88 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 402 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19835 reset in 277 ms.
Product exploration explored 100000 steps with 19617 reset in 338 ms.
Built C files in :
/tmp/ltsmin15576266224024521508
[2022-05-19 10:29:24] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2022-05-19 10:29:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:29:24] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2022-05-19 10:29:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:29:24] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2022-05-19 10:29:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:29:24] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15576266224024521508
Running compilation step : cd /tmp/ltsmin15576266224024521508;'/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 467 ms.
Running link step : cd /tmp/ltsmin15576266224024521508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15576266224024521508;'/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/stateBased3076390474366586243.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 187/187 transitions.
Applied a total of 0 rules in 13 ms. Remains 189 /189 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:29:39] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:29:39] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:29:39] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-19 10:29:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 10:29:39] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2022-05-19 10:29:39] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:29:39] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-19 10:29:39] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin6163103637654576492
[2022-05-19 10:29:39] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2022-05-19 10:29:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:29:39] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2022-05-19 10:29:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:29:39] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2022-05-19 10:29:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:29:39] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6163103637654576492
Running compilation step : cd /tmp/ltsmin6163103637654576492;'/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 359 ms.
Running link step : cd /tmp/ltsmin6163103637654576492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6163103637654576492;'/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/stateBased13363775209829513455.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 10:29:54] [INFO ] Flatten gal took : 13 ms
[2022-05-19 10:29:54] [INFO ] Flatten gal took : 11 ms
[2022-05-19 10:29:54] [INFO ] Time to serialize gal into /tmp/LTL11747406279978985295.gal : 3 ms
[2022-05-19 10:29:54] [INFO ] Time to serialize properties into /tmp/LTL9968820923590862784.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/LTL11747406279978985295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9968820923590862784.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/LTL1174740...267
Read 1 LTL properties
Checking formula 0 : !(((F("(p483==1)"))||(G("(p113==0)"))))
Formula 0 simplified : !(F"(p483==1)" | G"(p113==0)")
Reverse transition relation is NOT exact ! Due to transitions t0.t453, t1.t409, t2.t365, t3.t321, t4.t276, t5.t232, t6.t187, t157, t437.t543.t454.t433.t436...1260
Computing Next relation with stutter on 2.73368e+11 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
333 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.3691,119876,1,0,510,415140,401,290,6451,874119,795
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-010B-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-010B-LTLFireability-01 finished in 39638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 594 transition count 544
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 592 transition count 542
Applied a total of 12 rules in 41 ms. Remains 592 /598 variables (removed 6) and now considering 542/548 (removed 6) transitions.
// Phase 1: matrix 542 rows 592 cols
[2022-05-19 10:29:59] [INFO ] Computed 91 place invariants in 6 ms
[2022-05-19 10:29:59] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2022-05-19 10:29:59] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:29:59] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2022-05-19 10:29:59] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:29:59] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 592/598 places, 542/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 592/598 places, 542/548 transitions.
Stuttering acceptance computed with spot in 478 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s351 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLFireability-02 finished in 1325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(X(p0))&&(X(p1)||(F(p0)&&p1))))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 593 transition count 543
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 592 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 591 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 591 transition count 541
Applied a total of 14 rules in 41 ms. Remains 591 /598 variables (removed 7) and now considering 541/548 (removed 7) transitions.
// Phase 1: matrix 541 rows 591 cols
[2022-05-19 10:30:00] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 10:30:00] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 541 rows 591 cols
[2022-05-19 10:30:00] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:30:00] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
// Phase 1: matrix 541 rows 591 cols
[2022-05-19 10:30:00] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:30:01] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 591/598 places, 541/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 591/598 places, 541/548 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s350 1), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLFireability-03 finished in 1024 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(p1)))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 597 transition count 425
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 244 place count 475 transition count 425
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 244 place count 475 transition count 348
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 398 place count 398 transition count 348
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 401 place count 395 transition count 345
Iterating global reduction 2 with 3 rules applied. Total rules applied 404 place count 395 transition count 345
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 404 place count 395 transition count 342
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 410 place count 392 transition count 342
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 2 with 334 rules applied. Total rules applied 744 place count 225 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 745 place count 225 transition count 174
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 3 with 2 rules applied. Total rules applied 747 place count 224 transition count 173
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 805 place count 195 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 807 place count 193 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 808 place count 192 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 808 place count 192 transition count 189
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 810 place count 191 transition count 189
Applied a total of 810 rules in 65 ms. Remains 191 /598 variables (removed 407) and now considering 189/548 (removed 359) transitions.
// Phase 1: matrix 189 rows 191 cols
[2022-05-19 10:30:01] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 10:30:01] [INFO ] Implicit Places using invariants in 105 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/598 places, 189/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 189 transition count 188
Applied a total of 2 rules in 6 ms. Remains 189 /190 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 189 cols
[2022-05-19 10:30:01] [INFO ] Computed 89 place invariants in 0 ms
[2022-05-19 10:30:01] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 188 rows 189 cols
[2022-05-19 10:30:01] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:30:01] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 189/598 places, 188/548 transitions.
Finished structural reductions, in 2 iterations. Remains : 189/598 places, 188/548 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s182 1), p1:(AND (EQ s65 1) (EQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 45442 reset in 330 ms.
Product exploration explored 100000 steps with 45433 reset in 405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 188 rows 189 cols
[2022-05-19 10:30:03] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:30:03] [INFO ] [Real]Absence check using 89 positive place invariants in 17 ms returned sat
[2022-05-19 10:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:30:03] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2022-05-19 10:30:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:30:03] [INFO ] [Nat]Absence check using 89 positive place invariants in 16 ms returned sat
[2022-05-19 10:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:30:03] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-19 10:30:03] [INFO ] Computed and/alt/rep : 183/286/183 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-19 10:30:03] [INFO ] Added : 133 causal constraints over 27 iterations in 474 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 189 cols
[2022-05-19 10:30:03] [INFO ] Computed 89 place invariants in 3 ms
[2022-05-19 10:30:04] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 188 rows 189 cols
[2022-05-19 10:30:04] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:30:04] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2022-05-19 10:30:04] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 188 rows 189 cols
[2022-05-19 10:30:04] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:30:04] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 188/188 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 188 rows 189 cols
[2022-05-19 10:30:04] [INFO ] Computed 89 place invariants in 0 ms
[2022-05-19 10:30:04] [INFO ] [Real]Absence check using 89 positive place invariants in 16 ms returned sat
[2022-05-19 10:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:30:04] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-05-19 10:30:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:30:04] [INFO ] [Nat]Absence check using 89 positive place invariants in 17 ms returned sat
[2022-05-19 10:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:30:05] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-19 10:30:05] [INFO ] Computed and/alt/rep : 183/286/183 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-19 10:30:05] [INFO ] Added : 133 causal constraints over 27 iterations in 480 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 45436 reset in 303 ms.
Product exploration explored 100000 steps with 45496 reset in 324 ms.
Built C files in :
/tmp/ltsmin9702457169146438206
[2022-05-19 10:30:06] [INFO ] Computing symmetric may disable matrix : 188 transitions.
[2022-05-19 10:30:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:30:06] [INFO ] Computing symmetric may enable matrix : 188 transitions.
[2022-05-19 10:30:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:30:06] [INFO ] Computing Do-Not-Accords matrix : 188 transitions.
[2022-05-19 10:30:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:30:06] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9702457169146438206
Running compilation step : cd /tmp/ltsmin9702457169146438206;'/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 370 ms.
Running link step : cd /tmp/ltsmin9702457169146438206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9702457169146438206;'/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/stateBased9921001915505494274.hoa' '--buchi-type=spotba'
LTSmin run took 108 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-010B-LTLFireability-04 finished in 5565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 593 transition count 543
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 592 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 591 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 591 transition count 541
Applied a total of 14 rules in 36 ms. Remains 591 /598 variables (removed 7) and now considering 541/548 (removed 7) transitions.
// Phase 1: matrix 541 rows 591 cols
[2022-05-19 10:30:07] [INFO ] Computed 91 place invariants in 6 ms
[2022-05-19 10:30:07] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 541 rows 591 cols
[2022-05-19 10:30:07] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:30:07] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
// Phase 1: matrix 541 rows 591 cols
[2022-05-19 10:30:07] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:30:07] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 591/598 places, 541/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 591/598 places, 541/548 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s465 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLFireability-06 finished in 874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U G(p1)) U !X(X(p2))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 597 transition count 429
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 479 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 478 transition count 428
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 238 place count 478 transition count 350
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 394 place count 400 transition count 350
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 397 place count 397 transition count 347
Iterating global reduction 3 with 3 rules applied. Total rules applied 400 place count 397 transition count 347
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 400 place count 397 transition count 344
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 406 place count 394 transition count 344
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 740 place count 227 transition count 177
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 798 place count 198 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 800 place count 196 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 801 place count 195 transition count 193
Applied a total of 801 rules in 54 ms. Remains 195 /598 variables (removed 403) and now considering 193/548 (removed 355) transitions.
// Phase 1: matrix 193 rows 195 cols
[2022-05-19 10:30:07] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 10:30:08] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 193 rows 195 cols
[2022-05-19 10:30:08] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 10:30:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 10:30:08] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2022-05-19 10:30:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 193 rows 195 cols
[2022-05-19 10:30:08] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 10:30:08] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 195/598 places, 193/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/598 places, 193/548 transitions.
Stuttering acceptance computed with spot in 720 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p0 p2), false, (AND (NOT p1) p2), (AND (NOT p1) p0 p2)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 5}, { cond=true, acceptance={0} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 7}, { cond=(OR p1 p0), acceptance={0, 1} source=1 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 6}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 9}, { cond=(AND p1 p0), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 10}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 7}, { cond=(OR p1 p0), acceptance={0, 1} source=3 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 5}, { cond=(NOT p1), acceptance={0} source=4 dest: 6}, { cond=(AND p1 p0), acceptance={1} source=4 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 9}, { cond=p1, acceptance={} source=4 dest: 11}, { cond=(AND p1 p0), acceptance={1} source=4 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=5 dest: 5}, { cond=p2, acceptance={0} source=5 dest: 6}, { cond=(AND p1 p0 p2), acceptance={1} source=5 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=5 dest: 7}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0, 1} source=5 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=5 dest: 9}], [{ cond=p2, acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p1 p0 p2), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=6 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=7 dest: 6}, { cond=(AND p1 p0 p2), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=7 dest: 9}, { cond=(AND p1 p0 p2), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=7 dest: 10}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p1 p0 p2), acceptance={1} source=8 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=8 dest: 7}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=9 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=9 dest: 6}, { cond=(AND p1 p0 p2), acceptance={1} source=9 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=9 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=9 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=9 dest: 9}, { cond=(AND p1 p2), acceptance={} source=9 dest: 11}, { cond=(AND p1 p0 p2), acceptance={1} source=9 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=10 dest: 1}, { cond=(AND p1 p0 p2), acceptance={1} source=10 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=10 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=10 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=10 dest: 13}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=10 dest: 13}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=10 dest: 14}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=11 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=11 dest: 1}, { cond=(AND p1 p0 p2), acceptance={1} source=11 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=11 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=11 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=11 dest: 4}, { cond=(AND p1 p2), acceptance={} source=11 dest: 14}, { cond=(AND p1 p0 p2), acceptance={1} source=11 dest: 15}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=12 dest: 8}, { cond=(AND p1 p0 p2), acceptance={1} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=13 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=13 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=13 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=13 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=13 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=13 dest: 13}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=13 dest: 13}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=13 dest: 14}], [{ cond=(NOT p1), acceptance={0} source=14 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=14 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=14 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=14 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=14 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=14 dest: 4}, { cond=p1, acceptance={} source=14 dest: 14}, { cond=(AND p1 p0), acceptance={1} source=14 dest: 15}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=15 dest: 8}, { cond=(AND p1 p0), acceptance={1} source=15 dest: 12}]], initial=0, aps=[p1:(EQ s79 1), p0:(EQ s194 1), p2:(EQ s184 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 25909 reset in 338 ms.
Product exploration explored 100000 steps with 25877 reset in 402 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/195 stabilizing places and 2/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (OR p1 p0)), (X (NOT (OR p1 p0)))]
Knowledge based reduction with 12 factoid took 3933 ms. Reduced automaton from 16 states, 102 edges and 3 AP to 16 states, 102 edges and 3 AP.
Stuttering acceptance computed with spot in 766 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), false, (AND (NOT p1) p2), (AND p0 (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 18) seen :15
Finished Best-First random walk after 3625 steps, including 1 resets, run visited all 3 properties in 16 ms. (steps per millisecond=226 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (OR p1 p0)), (X (NOT (OR p1 p0))), (F (AND p0 p1 p2)), (F p2), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) p1 p2)), (F (OR (AND p0 p2) (AND p1 p2)))]
Knowledge based reduction with 12 factoid took 5072 ms. Reduced automaton from 16 states, 102 edges and 3 AP to 16 states, 102 edges and 3 AP.
Stuttering acceptance computed with spot in 914 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), false, (AND (NOT p1) p2), (AND p0 (NOT p1) p2)]
Stuttering acceptance computed with spot in 702 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), false, (AND (NOT p1) p2), (AND p0 (NOT p1) p2)]
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 193/193 transitions.
Applied a total of 0 rules in 10 ms. Remains 195 /195 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 195 cols
[2022-05-19 10:30:21] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 10:30:21] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 193 rows 195 cols
[2022-05-19 10:30:21] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 10:30:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 10:30:21] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2022-05-19 10:30:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 193 rows 195 cols
[2022-05-19 10:30:21] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 10:30:21] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 193/193 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/195 stabilizing places and 2/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1)]
Knowledge based reduction with 12 factoid took 3540 ms. Reduced automaton from 16 states, 102 edges and 3 AP to 16 states, 102 edges and 3 AP.
Stuttering acceptance computed with spot in 747 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), false, (AND (NOT p1) p2), (AND p0 (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 18) seen :15
Finished Best-First random walk after 134 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (F (AND p0 p1 p2)), (F p2), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) p1 p2)), (F (OR (AND p0 p2) (AND p1 p2)))]
Knowledge based reduction with 12 factoid took 4000 ms. Reduced automaton from 16 states, 102 edges and 3 AP to 16 states, 102 edges and 3 AP.
Stuttering acceptance computed with spot in 781 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), false, (AND (NOT p1) p2), (AND p0 (NOT p1) p2)]
Stuttering acceptance computed with spot in 722 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), false, (AND (NOT p1) p2), (AND p0 (NOT p1) p2)]
Stuttering acceptance computed with spot in 670 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), false, (AND (NOT p1) p2), (AND p0 (NOT p1) p2)]
Product exploration explored 100000 steps with 25885 reset in 343 ms.
Product exploration explored 100000 steps with 25910 reset in 338 ms.
Built C files in :
/tmp/ltsmin17018033490225137319
[2022-05-19 10:30:33] [INFO ] Computing symmetric may disable matrix : 193 transitions.
[2022-05-19 10:30:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:30:33] [INFO ] Computing symmetric may enable matrix : 193 transitions.
[2022-05-19 10:30:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:30:33] [INFO ] Computing Do-Not-Accords matrix : 193 transitions.
[2022-05-19 10:30:33] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 10:30:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17018033490225137319
Running compilation step : cd /tmp/ltsmin17018033490225137319;'/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 358 ms.
Running link step : cd /tmp/ltsmin17018033490225137319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17018033490225137319;'/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/stateBased8737683559247177766.hoa' '--buchi-type=spotba'
LTSmin run took 165 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-010B-LTLFireability-08 finished in 26086 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 597 transition count 426
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 476 transition count 426
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 242 place count 476 transition count 348
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 398 place count 398 transition count 348
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 401 place count 395 transition count 345
Iterating global reduction 2 with 3 rules applied. Total rules applied 404 place count 395 transition count 345
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 404 place count 395 transition count 342
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 410 place count 392 transition count 342
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 748 place count 223 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 749 place count 223 transition count 172
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 3 with 2 rules applied. Total rules applied 751 place count 222 transition count 171
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 807 place count 194 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 809 place count 192 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 811 place count 190 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 811 place count 190 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 813 place count 189 transition count 186
Applied a total of 813 rules in 47 ms. Remains 189 /598 variables (removed 409) and now considering 186/548 (removed 362) transitions.
// Phase 1: matrix 186 rows 189 cols
[2022-05-19 10:30:34] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:30:34] [INFO ] Implicit Places using invariants in 102 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 188/598 places, 186/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 187 transition count 185
Applied a total of 2 rules in 5 ms. Remains 187 /188 variables (removed 1) and now considering 185/186 (removed 1) transitions.
// Phase 1: matrix 185 rows 187 cols
[2022-05-19 10:30:34] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:30:34] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 185 rows 187 cols
[2022-05-19 10:30:34] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:30:34] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/598 places, 185/548 transitions.
Finished structural reductions, in 2 iterations. Remains : 187/598 places, 185/548 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-09 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:(EQ s166 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLFireability-09 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 597 transition count 426
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 476 transition count 426
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 242 place count 476 transition count 349
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 396 place count 399 transition count 349
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 399 place count 396 transition count 346
Iterating global reduction 2 with 3 rules applied. Total rules applied 402 place count 396 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 402 place count 396 transition count 343
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 408 place count 393 transition count 343
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 336 rules applied. Total rules applied 744 place count 225 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 745 place count 225 transition count 174
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 3 with 2 rules applied. Total rules applied 747 place count 224 transition count 173
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 803 place count 196 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 805 place count 194 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 192 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 807 place count 192 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 809 place count 191 transition count 188
Applied a total of 809 rules in 62 ms. Remains 191 /598 variables (removed 407) and now considering 188/548 (removed 360) transitions.
// Phase 1: matrix 188 rows 191 cols
[2022-05-19 10:30:34] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:30:34] [INFO ] Implicit Places using invariants in 114 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/598 places, 188/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 189 transition count 187
Applied a total of 2 rules in 7 ms. Remains 189 /190 variables (removed 1) and now considering 187/188 (removed 1) transitions.
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:30:34] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:30:34] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 187 rows 189 cols
[2022-05-19 10:30:34] [INFO ] Computed 88 place invariants in 7 ms
[2022-05-19 10:30:34] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-19 10:30:35] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 189/598 places, 187/548 transitions.
Finished structural reductions, in 2 iterations. Remains : 189/598 places, 187/548 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLFireability-10 finished in 630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G((X(G(p1))||!p1))||p2)) U p2))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 597 transition count 426
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 476 transition count 426
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 242 place count 476 transition count 348
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 398 place count 398 transition count 348
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 401 place count 395 transition count 345
Iterating global reduction 2 with 3 rules applied. Total rules applied 404 place count 395 transition count 345
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 404 place count 395 transition count 342
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 410 place count 392 transition count 342
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 330 rules applied. Total rules applied 740 place count 227 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 741 place count 227 transition count 176
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 3 with 2 rules applied. Total rules applied 743 place count 226 transition count 175
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 799 place count 198 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 801 place count 196 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 803 place count 194 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 803 place count 194 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 805 place count 193 transition count 189
Applied a total of 805 rules in 38 ms. Remains 193 /598 variables (removed 405) and now considering 189/548 (removed 359) transitions.
// Phase 1: matrix 189 rows 193 cols
[2022-05-19 10:30:35] [INFO ] Computed 89 place invariants in 2 ms
[2022-05-19 10:30:35] [INFO ] Implicit Places using invariants in 104 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 192/598 places, 189/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 191 transition count 188
Applied a total of 2 rules in 5 ms. Remains 191 /192 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 191 cols
[2022-05-19 10:30:35] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:30:35] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 188 rows 191 cols
[2022-05-19 10:30:35] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-19 10:30:35] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 191/598 places, 188/548 transitions.
Finished structural reductions, in 2 iterations. Remains : 191/598 places, 188/548 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p1), false, true]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s121 1), p1:(EQ s60 1), p0:(EQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLFireability-12 finished in 630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U (X(!F(p2))&&p3))))'
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 548/548 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 594 transition count 544
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 592 transition count 542
Applied a total of 12 rules in 47 ms. Remains 592 /598 variables (removed 6) and now considering 542/548 (removed 6) transitions.
// Phase 1: matrix 542 rows 592 cols
[2022-05-19 10:30:35] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 10:30:35] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2022-05-19 10:30:35] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:30:36] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2022-05-19 10:30:36] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 10:30:36] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 592/598 places, 542/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 592/598 places, 542/548 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), true, p2, (NOT p1), p2, (AND (NOT p1) p2 p3)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={0} source=1 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) p1 p2) (AND (NOT p3) p0 p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={} source=5 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 5}, { cond=(OR (AND p3 p1 p2) (AND p3 p0 p2)), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p3 (NOT p1) p0) (AND (NOT p1) p0 (NOT p2))), acceptance={} source=5 dest: 6}], [{ cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={} source=6 dest: 4}]], initial=0, aps=[p3:(EQ s1 1), p1:(NEQ s212 1), p0:(AND (EQ s156 1) (EQ s205 1)), p2:(EQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5996 steps with 0 reset in 21 ms.
FORMULA ShieldIIPt-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLFireability-14 finished in 1147 ms.
All properties solved by simple procedures.
Total runtime 80288 ms.

BK_STOP 1652956236952

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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-165286025000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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