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-165286024700123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 8.5K Apr 29 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 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 503K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652933975822

Running Version 202205111006
[2022-05-19 04:19:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 04:19:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 04:19:37] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2022-05-19 04:19:37] [INFO ] Transformed 1803 places.
[2022-05-19 04:19:37] [INFO ] Transformed 1773 transitions.
[2022-05-19 04:19:37] [INFO ] Found NUPN structural information;
[2022-05-19 04:19:37] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 1606 transition count 1576
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 1606 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 395 place count 1605 transition count 1575
Iterating global reduction 0 with 1 rules applied. Total rules applied 396 place count 1605 transition count 1575
Applied a total of 396 rules in 505 ms. Remains 1605 /1803 variables (removed 198) and now considering 1575/1773 (removed 198) transitions.
// Phase 1: matrix 1575 rows 1605 cols
[2022-05-19 04:19:38] [INFO ] Computed 271 place invariants in 35 ms
[2022-05-19 04:19:38] [INFO ] Implicit Places using invariants in 689 ms returned []
// Phase 1: matrix 1575 rows 1605 cols
[2022-05-19 04:19:38] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 04:19:40] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2172 ms to find 0 implicit places.
// Phase 1: matrix 1575 rows 1605 cols
[2022-05-19 04:19:40] [INFO ] Computed 271 place invariants in 14 ms
[2022-05-19 04:19:40] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1605/1803 places, 1575/1773 transitions.
Finished structural reductions, in 1 iterations. Remains : 1605/1803 places, 1575/1773 transitions.
Support contains 35 out of 1605 places after structural reductions.
[2022-05-19 04:19:41] [INFO ] Flatten gal took : 141 ms
[2022-05-19 04:19:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 04:19:41] [INFO ] Flatten gal took : 83 ms
[2022-05-19 04:19:41] [INFO ] Input system was already deterministic with 1575 transitions.
Support contains 33 out of 1605 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1575 rows 1605 cols
[2022-05-19 04:19:41] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 04:19:42] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 04:19:42] [INFO ] [Nat]Absence check using 271 positive place invariants in 84 ms returned sat
[2022-05-19 04:19:42] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 365 stabilizing places and 365 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1593 transition count 1563
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1593 transition count 1563
Applied a total of 24 rules in 93 ms. Remains 1593 /1605 variables (removed 12) and now considering 1563/1575 (removed 12) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:19:42] [INFO ] Computed 271 place invariants in 12 ms
[2022-05-19 04:19:43] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:19:43] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 04:19:44] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:19:44] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 04:19:45] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1593/1605 places, 1563/1575 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1605 places, 1563/1575 transitions.
Stuttering acceptance computed with spot in 445 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s912 0) (EQ s325 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 598 ms.
Product exploration explored 100000 steps with 50000 reset in 513 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-00 finished in 4548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(p0)))))'
Support contains 4 out of 1605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1604 transition count 1425
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1455 transition count 1425
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 298 place count 1455 transition count 1275
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 598 place count 1305 transition count 1275
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 609 place count 1294 transition count 1264
Iterating global reduction 2 with 11 rules applied. Total rules applied 620 place count 1294 transition count 1264
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 620 place count 1294 transition count 1260
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 628 place count 1290 transition count 1260
Performed 533 Post agglomeration using F-continuation condition.Transition count delta: 533
Deduced a syphon composed of 533 places in 4 ms
Reduce places removed 533 places and 0 transitions.
Iterating global reduction 2 with 1066 rules applied. Total rules applied 1694 place count 757 transition count 727
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1696 place count 755 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1697 place count 754 transition count 725
Applied a total of 1697 rules in 401 ms. Remains 754 /1605 variables (removed 851) and now considering 725/1575 (removed 850) transitions.
// Phase 1: matrix 725 rows 754 cols
[2022-05-19 04:19:47] [INFO ] Computed 270 place invariants in 9 ms
[2022-05-19 04:19:47] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 725 rows 754 cols
[2022-05-19 04:19:47] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:19:48] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2022-05-19 04:19:48] [INFO ] Redundant transitions in 114 ms returned [724]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 724 rows 754 cols
[2022-05-19 04:19:48] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:19:49] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 754/1605 places, 724/1575 transitions.
Applied a total of 0 rules in 28 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 754/1605 places, 724/1575 transitions.
Stuttering acceptance computed with spot in 780 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s68 0) (EQ s729 1) (AND (NEQ s476 0) (NEQ s295 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 64 reset in 645 ms.
Product exploration explored 100000 steps with 64 reset in 775 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 4 out of 754 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 754/754 places, 724/724 transitions.
Applied a total of 0 rules in 25 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
// Phase 1: matrix 724 rows 754 cols
[2022-05-19 04:19:51] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:19:52] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 724 rows 754 cols
[2022-05-19 04:19:52] [INFO ] Computed 270 place invariants in 4 ms
[2022-05-19 04:19:52] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2022-05-19 04:19:52] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 724 rows 754 cols
[2022-05-19 04:19:52] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:19:53] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 754/754 places, 724/724 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 64 reset in 613 ms.
Product exploration explored 100000 steps with 64 reset in 728 ms.
Built C files in :
/tmp/ltsmin17550009812846471890
[2022-05-19 04:19:55] [INFO ] Computing symmetric may disable matrix : 724 transitions.
[2022-05-19 04:19:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:19:55] [INFO ] Computing symmetric may enable matrix : 724 transitions.
[2022-05-19 04:19:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:19:55] [INFO ] Computing Do-Not-Accords matrix : 724 transitions.
[2022-05-19 04:19:55] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:19:55] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17550009812846471890
Running compilation step : cd /tmp/ltsmin17550009812846471890;'/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 1912 ms.
Running link step : cd /tmp/ltsmin17550009812846471890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17550009812846471890;'/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/stateBased15705325501522905166.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 754 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 754/754 places, 724/724 transitions.
Applied a total of 0 rules in 23 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
// Phase 1: matrix 724 rows 754 cols
[2022-05-19 04:20:10] [INFO ] Computed 270 place invariants in 5 ms
[2022-05-19 04:20:11] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 724 rows 754 cols
[2022-05-19 04:20:11] [INFO ] Computed 270 place invariants in 4 ms
[2022-05-19 04:20:11] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2022-05-19 04:20:11] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 724 rows 754 cols
[2022-05-19 04:20:11] [INFO ] Computed 270 place invariants in 4 ms
[2022-05-19 04:20:12] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 754/754 places, 724/724 transitions.
Built C files in :
/tmp/ltsmin8797051267704062261
[2022-05-19 04:20:12] [INFO ] Computing symmetric may disable matrix : 724 transitions.
[2022-05-19 04:20:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:20:12] [INFO ] Computing symmetric may enable matrix : 724 transitions.
[2022-05-19 04:20:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:20:12] [INFO ] Computing Do-Not-Accords matrix : 724 transitions.
[2022-05-19 04:20:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:20:12] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8797051267704062261
Running compilation step : cd /tmp/ltsmin8797051267704062261;'/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 1833 ms.
Running link step : cd /tmp/ltsmin8797051267704062261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8797051267704062261;'/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/stateBased9561869032015316374.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 04:20:27] [INFO ] Flatten gal took : 40 ms
[2022-05-19 04:20:27] [INFO ] Flatten gal took : 37 ms
[2022-05-19 04:20:28] [INFO ] Time to serialize gal into /tmp/LTL11346784270493886434.gal : 1371 ms
[2022-05-19 04:20:28] [INFO ] Time to serialize properties into /tmp/LTL2025785542084609825.ltl : 2 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/LTL11346784270493886434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2025785542084609825.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/LTL1134678...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F(G("(((p184==0)||(p1737==1))||((p1139!=0)&&(p714!=1)))"))))))
Formula 0 simplified : !XGFG"(((p184==0)||(p1737==1))||((p1139!=0)&&(p714!=1)))"
Detected timeout of ITS tools.
[2022-05-19 04:20:43] [INFO ] Flatten gal took : 32 ms
[2022-05-19 04:20:43] [INFO ] Applying decomposition
[2022-05-19 04:20:44] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2985411154867285712.txt' '-o' '/tmp/graph2985411154867285712.bin' '-w' '/tmp/graph2985411154867285712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2985411154867285712.bin' '-l' '-1' '-v' '-w' '/tmp/graph2985411154867285712.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:20:44] [INFO ] Decomposing Gal with order
[2022-05-19 04:20:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:20:44] [INFO ] Removed a total of 479 redundant transitions.
[2022-05-19 04:20:44] [INFO ] Flatten gal took : 104 ms
[2022-05-19 04:20:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 444 labels/synchronizations in 20 ms.
[2022-05-19 04:20:44] [INFO ] Time to serialize gal into /tmp/LTL3800535378654988453.gal : 8 ms
[2022-05-19 04:20:44] [INFO ] Time to serialize properties into /tmp/LTL16315407727498489648.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3800535378654988453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16315407727498489648.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3800535...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F(G("(((i2.i1.u24.p184==0)||(i28.i0.u263.p1737==1))||((i18.i2.u172.p1139!=0)&&(i11.i0.u106.p714!=1)))"))))))
Formula 0 simplified : !XGFG"(((i2.i1.u24.p184==0)||(i28.i0.u263.p1737==1))||((i18.i2.u172.p1139!=0)&&(i11.i0.u106.p714!=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10673907174455625265
[2022-05-19 04:20:59] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10673907174455625265
Running compilation step : cd /tmp/ltsmin10673907174455625265;'/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 1151 ms.
Running link step : cd /tmp/ltsmin10673907174455625265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10673907174455625265;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-02 finished in 87395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&X(F(X(p1)))))'
Support contains 2 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1593 transition count 1563
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1593 transition count 1563
Applied a total of 24 rules in 108 ms. Remains 1593 /1605 variables (removed 12) and now considering 1563/1575 (removed 12) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:14] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:21:15] [INFO ] Implicit Places using invariants in 452 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:15] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 04:21:16] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:16] [INFO ] Computed 271 place invariants in 7 ms
[2022-05-19 04:21:17] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1593/1605 places, 1563/1575 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1605 places, 1563/1575 transitions.
Stuttering acceptance computed with spot in 1418 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s751 0) (EQ s166 1)), p1:(AND (EQ s166 0) (EQ s751 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 539 steps with 0 reset in 6 ms.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-03 finished in 4173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1593 transition count 1563
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1593 transition count 1563
Applied a total of 24 rules in 83 ms. Remains 1593 /1605 variables (removed 12) and now considering 1563/1575 (removed 12) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:18] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 04:21:19] [INFO ] Implicit Places using invariants in 427 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:19] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 04:21:20] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:20] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 04:21:21] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1593/1605 places, 1563/1575 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1605 places, 1563/1575 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1587 0) (EQ s289 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 510 ms.
Product exploration explored 100000 steps with 50000 reset in 518 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 1876 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-04 finished in 5709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(X(p0)))||G(p0)||F(p1)))&&X(p0))))'
Support contains 4 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1593 transition count 1563
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1593 transition count 1563
Applied a total of 24 rules in 93 ms. Remains 1593 /1605 variables (removed 12) and now considering 1563/1575 (removed 12) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:24] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 04:21:24] [INFO ] Implicit Places using invariants in 416 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:24] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:21:26] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:21:26] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:21:27] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1593/1605 places, 1563/1575 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1605 places, 1563/1575 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(OR (EQ s656 0) (EQ s57 1)), p0:(OR (EQ s189 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 409 ms.
Product exploration explored 100000 steps with 33333 reset in 383 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 1517 ms. Reduced automaton from 7 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-07 finished in 5139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(X(X(p0)))&&X(p0)&&F(G(p1)))))))'
Support contains 3 out of 1605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1604 transition count 1424
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 1454 transition count 1424
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 300 place count 1454 transition count 1273
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 602 place count 1303 transition count 1273
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 614 place count 1291 transition count 1261
Iterating global reduction 2 with 12 rules applied. Total rules applied 626 place count 1291 transition count 1261
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 626 place count 1291 transition count 1256
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 636 place count 1286 transition count 1256
Performed 530 Post agglomeration using F-continuation condition.Transition count delta: 530
Deduced a syphon composed of 530 places in 1 ms
Reduce places removed 530 places and 0 transitions.
Iterating global reduction 2 with 1060 rules applied. Total rules applied 1696 place count 756 transition count 726
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1698 place count 754 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1699 place count 753 transition count 724
Applied a total of 1699 rules in 218 ms. Remains 753 /1605 variables (removed 852) and now considering 724/1575 (removed 851) transitions.
// Phase 1: matrix 724 rows 753 cols
[2022-05-19 04:21:29] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:21:30] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 724 rows 753 cols
[2022-05-19 04:21:30] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:21:30] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2022-05-19 04:21:30] [INFO ] Redundant transitions in 97 ms returned [723]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:21:30] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:21:31] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/1605 places, 723/1575 transitions.
Applied a total of 0 rules in 14 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 753/1605 places, 723/1575 transitions.
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s714 0), p0:(AND (EQ s676 0) (EQ s342 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 220 reset in 613 ms.
Product exploration explored 100000 steps with 193 reset in 717 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (NOT p0)), (X p0), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 2438 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (NOT p0)), (X p0), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:21:36] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:21:36] [INFO ] [Real]Absence check using 270 positive place invariants in 137 ms returned sat
[2022-05-19 04:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:21:37] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2022-05-19 04:21:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:21:38] [INFO ] [Nat]Absence check using 270 positive place invariants in 106 ms returned sat
[2022-05-19 04:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:21:39] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2022-05-19 04:21:39] [INFO ] Computed and/alt/rep : 719/1796/719 causal constraints (skipped 1 transitions) in 36 ms.
[2022-05-19 04:21:52] [INFO ] Added : 675 causal constraints over 135 iterations in 13476 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 23 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:21:52] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:21:53] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:21:53] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:21:53] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2022-05-19 04:21:53] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:21:53] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:21:54] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 723/723 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (NOT p0)), (X p0), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 232 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (NOT p0)), (X p0), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:21:55] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:21:55] [INFO ] [Real]Absence check using 270 positive place invariants in 110 ms returned sat
[2022-05-19 04:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:21:56] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2022-05-19 04:21:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:21:57] [INFO ] [Nat]Absence check using 270 positive place invariants in 107 ms returned sat
[2022-05-19 04:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:21:58] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2022-05-19 04:21:58] [INFO ] Computed and/alt/rep : 719/1796/719 causal constraints (skipped 1 transitions) in 39 ms.
[2022-05-19 04:22:11] [INFO ] Added : 680 causal constraints over 136 iterations in 13462 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 161 reset in 589 ms.
Product exploration explored 100000 steps with 214 reset in 696 ms.
Built C files in :
/tmp/ltsmin5345542302378626583
[2022-05-19 04:22:13] [INFO ] Computing symmetric may disable matrix : 723 transitions.
[2022-05-19 04:22:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:22:13] [INFO ] Computing symmetric may enable matrix : 723 transitions.
[2022-05-19 04:22:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:22:13] [INFO ] Computing Do-Not-Accords matrix : 723 transitions.
[2022-05-19 04:22:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:22:13] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5345542302378626583
Running compilation step : cd /tmp/ltsmin5345542302378626583;'/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 1751 ms.
Running link step : cd /tmp/ltsmin5345542302378626583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5345542302378626583;'/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/stateBased1747227490328666557.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 20 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:22:28] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:22:28] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:22:28] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:22:29] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2022-05-19 04:22:29] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:22:29] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:22:29] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 723/723 transitions.
Built C files in :
/tmp/ltsmin14492085426720466974
[2022-05-19 04:22:29] [INFO ] Computing symmetric may disable matrix : 723 transitions.
[2022-05-19 04:22:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:22:29] [INFO ] Computing symmetric may enable matrix : 723 transitions.
[2022-05-19 04:22:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:22:29] [INFO ] Computing Do-Not-Accords matrix : 723 transitions.
[2022-05-19 04:22:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:22:29] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14492085426720466974
Running compilation step : cd /tmp/ltsmin14492085426720466974;'/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 1736 ms.
Running link step : cd /tmp/ltsmin14492085426720466974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14492085426720466974;'/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/stateBased7502477536671607587.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 04:22:45] [INFO ] Flatten gal took : 30 ms
[2022-05-19 04:22:45] [INFO ] Flatten gal took : 28 ms
[2022-05-19 04:22:45] [INFO ] Time to serialize gal into /tmp/LTL5149594056828131569.gal : 4 ms
[2022-05-19 04:22:45] [INFO ] Time to serialize properties into /tmp/LTL7899961447451194645.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/LTL5149594056828131569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7899961447451194645.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/LTL5149594...266
Read 1 LTL properties
Checking formula 0 : !((G(F(X(((F(X(X("((p1619==0)&&(p831==1))"))))&&(X("((p1619==0)&&(p831==1))")))&&(F(G("(p1706==0)"))))))))
Formula 0 simplified : !GFX(X"((p1619==0)&&(p831==1))" & FXX"((p1619==0)&&(p831==1))" & FG"(p1706==0)")
Detected timeout of ITS tools.
[2022-05-19 04:23:00] [INFO ] Flatten gal took : 30 ms
[2022-05-19 04:23:00] [INFO ] Applying decomposition
[2022-05-19 04:23:00] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8143057024130027375.txt' '-o' '/tmp/graph8143057024130027375.bin' '-w' '/tmp/graph8143057024130027375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8143057024130027375.bin' '-l' '-1' '-v' '-w' '/tmp/graph8143057024130027375.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:23:00] [INFO ] Decomposing Gal with order
[2022-05-19 04:23:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:23:00] [INFO ] Removed a total of 477 redundant transitions.
[2022-05-19 04:23:00] [INFO ] Flatten gal took : 46 ms
[2022-05-19 04:23:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 10 ms.
[2022-05-19 04:23:00] [INFO ] Time to serialize gal into /tmp/LTL6767624723969207337.gal : 5 ms
[2022-05-19 04:23:00] [INFO ] Time to serialize properties into /tmp/LTL17776710940724163938.ltl : 338 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/LTL6767624723969207337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17776710940724163938.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6767624...246
Read 1 LTL properties
Checking formula 0 : !((G(F(X(((F(X(X("((i26.i1.u244.p1619==0)&&(i13.i2.u124.p831==1))"))))&&(X("((i26.i1.u244.p1619==0)&&(i13.i2.u124.p831==1))")))&&(F(G(...184
Formula 0 simplified : !GFX(X"((i26.i1.u244.p1619==0)&&(i13.i2.u124.p831==1))" & FXX"((i26.i1.u244.p1619==0)&&(i13.i2.u124.p831==1))" & FG"(i28.u258.p1706=...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1127070725851369377
[2022-05-19 04:23:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1127070725851369377
Running compilation step : cd /tmp/ltsmin1127070725851369377;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1127070725851369377;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1127070725851369377;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-09 finished in 111646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((X(p0) U X(X(p1)))))||X(X(p0)))))'
Support contains 4 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1592 transition count 1562
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1592 transition count 1562
Applied a total of 26 rules in 84 ms. Remains 1592 /1605 variables (removed 13) and now considering 1562/1575 (removed 13) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:21] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:23:21] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:21] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:23:23] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:23] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:23:23] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1605 places, 1562/1575 transitions.
Finished structural reductions, in 1 iterations. Remains : 1592/1605 places, 1562/1575 transitions.
Stuttering acceptance computed with spot in 1315 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1547 0) (EQ s376 1)), p1:(OR (EQ s207 0) (EQ s1124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 370 ms.
Product exploration explored 100000 steps with 33333 reset in 378 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 47 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-10 finished in 4853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 3 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1593 transition count 1563
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1593 transition count 1563
Applied a total of 24 rules in 80 ms. Remains 1593 /1605 variables (removed 12) and now considering 1563/1575 (removed 12) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:23:26] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 04:23:26] [INFO ] Implicit Places using invariants in 419 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:23:26] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:23:27] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:23:28] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:23:28] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1593/1605 places, 1563/1575 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1605 places, 1563/1575 transitions.
Stuttering acceptance computed with spot in 676 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s905 1)), p1:(EQ s766 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 512 ms.
Product exploration explored 100000 steps with 50000 reset in 502 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1593 stabilizing places and 359/1563 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-13 finished in 4483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(p0)))))'
Support contains 3 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 1575/1575 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1593 transition count 1563
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1593 transition count 1563
Applied a total of 24 rules in 79 ms. Remains 1593 /1605 variables (removed 12) and now considering 1563/1575 (removed 12) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:23:30] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 04:23:31] [INFO ] Implicit Places using invariants in 441 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:23:31] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 04:23:32] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:23:32] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:23:33] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1593/1605 places, 1563/1575 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1605 places, 1563/1575 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s480 0) (NEQ s1313 1) (OR (EQ s183 0) (EQ s183 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-14 finished in 2909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(X(X(p0)))&&X(p0)&&F(G(p1)))))))'
[2022-05-19 04:23:33] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13754772313922061864
[2022-05-19 04:23:33] [INFO ] Too many transitions (1575) to apply POR reductions. Disabling POR matrices.
[2022-05-19 04:23:33] [INFO ] Applying decomposition
[2022-05-19 04:23:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13754772313922061864
Running compilation step : cd /tmp/ltsmin13754772313922061864;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 04:23:33] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11144370236253049070.txt' '-o' '/tmp/graph11144370236253049070.bin' '-w' '/tmp/graph11144370236253049070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11144370236253049070.bin' '-l' '-1' '-v' '-w' '/tmp/graph11144370236253049070.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:23:33] [INFO ] Decomposing Gal with order
[2022-05-19 04:23:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:23:34] [INFO ] Removed a total of 690 redundant transitions.
[2022-05-19 04:23:34] [INFO ] Flatten gal took : 84 ms
[2022-05-19 04:23:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-19 04:23:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality18027084062609521510.gal : 13 ms
[2022-05-19 04:23:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality2932595034904034129.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18027084062609521510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2932595034904034129.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 2 LTL properties
Checking formula 0 : !((X(G(F(G("(((i2.i4.u63.p184==0)||(i28.i3.u577.p1737==1))||((i18.i2.u379.p1139!=0)&&(i11.i3.u240.p714!=1)))"))))))
Formula 0 simplified : !XGFG"(((i2.i4.u63.p184==0)||(i28.i3.u577.p1737==1))||((i18.i2.u379.p1139!=0)&&(i11.i3.u240.p714!=1)))"
Compilation finished in 3110 ms.
Running link step : cd /tmp/ltsmin13754772313922061864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13754772313922061864;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 04:44:53] [INFO ] Applying decomposition
[2022-05-19 04:44:53] [INFO ] Flatten gal took : 174 ms
[2022-05-19 04:44:53] [INFO ] Decomposing Gal with order
[2022-05-19 04:44:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:44:53] [INFO ] Removed a total of 480 redundant transitions.
[2022-05-19 04:44:53] [INFO ] Flatten gal took : 221 ms
[2022-05-19 04:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 51 ms.
[2022-05-19 04:44:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality8784506000736095093.gal : 32 ms
[2022-05-19 04:44:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality8341029235161847604.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/LTLCardinality8784506000736095093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8341029235161847604.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 2 LTL properties
Checking formula 0 : !((X(G(F(G("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u78.p184==0)||(i0.i1.u523....313
Formula 0 simplified : !XGFG"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u78.p184==0)||(i0.i1.u523.p173...303
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin13754772313922061864;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13754772313922061864;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X((<>(X(X((LTLAPp1==true))))&&X((LTLAPp1==true))&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 05:06:15] [INFO ] Flatten gal took : 378 ms
[2022-05-19 05:06:17] [INFO ] Input system was already deterministic with 1575 transitions.
[2022-05-19 05:06:17] [INFO ] Transformed 1605 places.
[2022-05-19 05:06:17] [INFO ] Transformed 1575 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 05:06:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality11797062928778240570.gal : 14 ms
[2022-05-19 05:06:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality7817965083754149158.ltl : 11 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/LTLCardinality11797062928778240570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7817965083754149158.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(F(G("(((p184==0)||(p1737==1))||((p1139!=0)&&(p714!=1)))"))))))
Formula 0 simplified : !XGFG"(((p184==0)||(p1737==1))||((p1139!=0)&&(p714!=1)))"

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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