Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625200268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is GPPP-PT-C0100N0000010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625200268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 08:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 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 GPPP-PT-C0100N0000010000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716548028676

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000010000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 10:53:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 10:53:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 10:53:50] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2024-05-24 10:53:50] [INFO ] Transformed 33 places.
[2024-05-24 10:53:50] [INFO ] Transformed 22 transitions.
[2024-05-24 10:53:50] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 10:53:50] [INFO ] Computed 12 invariants in 13 ms
[2024-05-24 10:53:50] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
[2024-05-24 10:53:50] [INFO ] Invariant cache hit.
[2024-05-24 10:53:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 10:53:50] [INFO ] Invariant cache hit.
[2024-05-24 10:53:50] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 10:53:50] [INFO ] Invariant cache hit.
[2024-05-24 10:53:50] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 32 out of 33 places after structural reductions.
[2024-05-24 10:53:50] [INFO ] Flatten gal took : 16 ms
[2024-05-24 10:53:51] [INFO ] Flatten gal took : 5 ms
[2024-05-24 10:53:51] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 31 out of 33 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10105 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=235 ) properties (out of 26) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 10:53:51] [INFO ] Invariant cache hit.
[2024-05-24 10:53:51] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-24 10:53:51] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 10:53:51] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-24 10:53:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 10:53:51] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 456 ms returned sat
[2024-05-24 10:53:53] [INFO ] After 2440ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 10:53:54] [INFO ] Invariant cache hit.
[2024-05-24 10:53:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-24 10:53:54] [INFO ] Invariant cache hit.
[2024-05-24 10:53:54] [INFO ] Implicit Places using invariants in 34 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 30/33 places, 22/22 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s14 1) (AND (GEQ s16 1) (GEQ s19 1))), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8171 reset in 232 ms.
Product exploration explored 100000 steps with 8167 reset in 165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 708 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=354 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 10:53:55] [INFO ] Computed 9 invariants in 5 ms
[2024-05-24 10:53:55] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 10:53:55] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 10:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:53:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 10:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 10:53:55] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 10:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:53:55] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-24 10:53:55] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 10:53:55] [INFO ] Added : 20 causal constraints over 4 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 10:53:55] [INFO ] Invariant cache hit.
[2024-05-24 10:53:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-24 10:53:55] [INFO ] Invariant cache hit.
[2024-05-24 10:53:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 10:53:55] [INFO ] Invariant cache hit.
[2024-05-24 10:53:55] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 28/30 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 60 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 709 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=354 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 22 rows 28 cols
[2024-05-24 10:53:56] [INFO ] Computed 7 invariants in 6 ms
[2024-05-24 10:53:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 10:53:56] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 10:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:53:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 10:53:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 10:53:56] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 10:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:53:57] [INFO ] [Nat]Absence check using state equation in 1113 ms returned sat
[2024-05-24 10:53:57] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 10:53:57] [INFO ] Added : 20 causal constraints over 4 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8125 reset in 117 ms.
Product exploration explored 100000 steps with 8207 reset in 94 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Graph (complete) has 60 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 26 transition count 20
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 16 ms. Remains 26 /28 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 26 cols
[2024-05-24 10:53:58] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 10:53:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-24 10:53:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 10:53:58] [INFO ] Invariant cache hit.
[2024-05-24 10:53:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/28 places, 20/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 26/28 places, 20/22 transitions.
Built C files in :
/tmp/ltsmin3426612241784465116
[2024-05-24 10:53:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3426612241784465116
Running compilation step : cd /tmp/ltsmin3426612241784465116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin3426612241784465116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3426612241784465116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11041851989634309835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2024-05-24 10:54:13] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 10:54:13] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-24 10:54:13] [INFO ] Invariant cache hit.
[2024-05-24 10:54:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 10:54:13] [INFO ] Invariant cache hit.
[2024-05-24 10:54:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 10:54:13] [INFO ] Invariant cache hit.
[2024-05-24 10:54:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 28/28 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin17643348371009465891
[2024-05-24 10:54:13] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17643348371009465891
Running compilation step : cd /tmp/ltsmin17643348371009465891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 100 ms.
Running link step : cd /tmp/ltsmin17643348371009465891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17643348371009465891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8918386596360557799.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 10:54:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 10:54:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 10:54:28] [INFO ] Time to serialize gal into /tmp/LTL13019175430696925713.gal : 2 ms
[2024-05-24 10:54:28] [INFO ] Time to serialize properties into /tmp/LTL16398206447310375653.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13019175430696925713.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14503095068270914220.hoa' '-atoms' '/tmp/LTL16398206447310375653.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16398206447310375653.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14503095068270914220.hoa
Detected timeout of ITS tools.
[2024-05-24 10:54:43] [INFO ] Flatten gal took : 3 ms
[2024-05-24 10:54:43] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:54:43] [INFO ] Time to serialize gal into /tmp/LTL3464404441972755238.gal : 1 ms
[2024-05-24 10:54:43] [INFO ] Time to serialize properties into /tmp/LTL15869154430832226131.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3464404441972755238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15869154430832226131.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("((DHAP>=1)||((ADP>=1)&&(PEP>=1)))"))||(X(F("(DHAP>=1)"))))))
Formula 0 simplified : X(G!"((DHAP>=1)||((ADP>=1)&&(PEP>=1)))" & XG!"(DHAP>=1)")
Detected timeout of ITS tools.
[2024-05-24 10:54:58] [INFO ] Flatten gal took : 3 ms
[2024-05-24 10:54:58] [INFO ] Applying decomposition
[2024-05-24 10:54:58] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2327756473228549746.txt' '-o' '/tmp/graph2327756473228549746.bin' '-w' '/tmp/graph2327756473228549746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2327756473228549746.bin' '-l' '-1' '-v' '-w' '/tmp/graph2327756473228549746.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:54:58] [INFO ] Decomposing Gal with order
[2024-05-24 10:54:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:54:58] [INFO ] Flatten gal took : 23 ms
[2024-05-24 10:54:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 10:54:58] [INFO ] Time to serialize gal into /tmp/LTL701940008950988951.gal : 1 ms
[2024-05-24 10:54:58] [INFO ] Time to serialize properties into /tmp/LTL12247592189252203767.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL701940008950988951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12247592189252203767.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F("((i1.u1.DHAP>=1)||((u3.ADP>=1)&&(u2.PEP>=1)))"))||(X(F("(i1.u1.DHAP>=1)"))))))
Formula 0 simplified : X(G!"((i1.u1.DHAP>=1)||((u3.ADP>=1)&&(u2.PEP>=1)))" & XG!"(i1.u1.DHAP>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2053994144719643144
[2024-05-24 10:55:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2053994144719643144
Running compilation step : cd /tmp/ltsmin2053994144719643144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin2053994144719643144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2053994144719643144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-01 finished in 95036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 19 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-24 10:55:29] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 10:55:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-24 10:55:29] [INFO ] Invariant cache hit.
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants in 35 ms returned [1, 2, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 15/22 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 21 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 18 transition count 12
Applied a total of 6 rules in 3 ms. Remains 18 /21 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-05-24 10:55:29] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 10:55:29] [INFO ] Invariant cache hit.
[2024-05-24 10:55:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 175 ms. Remains : 17/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-02 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 13 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2024-05-24 10:55:29] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 10:55:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-24 10:55:29] [INFO ] Invariant cache hit.
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants in 34 ms returned [1, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 17/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 12
Applied a total of 10 rules in 3 ms. Remains 17 /22 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-24 10:55:29] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 10:55:29] [INFO ] Invariant cache hit.
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/33 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 147 ms. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s14 700))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6223 reset in 116 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 8 and stack size 8 in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-03 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(F(G(!p2))&&(p0 U (p1||G(p0))))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 8 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-24 10:55:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 10:55:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 10:55:29] [INFO ] Invariant cache hit.
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants in 33 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 16/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 17 transition count 12
Applied a total of 8 rules in 4 ms. Remains 17 /21 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-24 10:55:29] [INFO ] Computed 6 invariants in 2 ms
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 10:55:29] [INFO ] Invariant cache hit.
[2024-05-24 10:55:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 10:55:29] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/33 places, 12/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 137 ms. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s0 1) (GEQ s12 200))) (LT s7 1)), p0:(LT s7 1), p2:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-04 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 11 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2024-05-24 10:55:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 10:55:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 10:55:29] [INFO ] Invariant cache hit.
[2024-05-24 10:55:30] [INFO ] Implicit Places using invariants in 33 ms returned [1, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 17/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 12
Applied a total of 10 rules in 4 ms. Remains 17 /22 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-24 10:55:30] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 10:55:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 10:55:30] [INFO ] Invariant cache hit.
[2024-05-24 10:55:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/33 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 138 ms. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9854 reset in 70 ms.
Product exploration explored 100000 steps with 9806 reset in 153 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 12 rows 16 cols
[2024-05-24 10:55:30] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:55:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 10:55:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:55:31] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 10:55:31] [INFO ] Computed and/alt/rep : 11/28/11 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 10:55:31] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2024-05-24 10:55:31] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 10:55:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 12 rows 16 cols
[2024-05-24 10:55:31] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 10:55:31] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2024-05-24 10:55:31] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-24 10:55:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 10:55:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2024-05-24 10:55:31] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 10:55:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 16/16 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 505 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=252 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 12 rows 16 cols
[2024-05-24 10:55:31] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 10:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:55:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 10:55:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:55:31] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-24 10:55:31] [INFO ] Computed and/alt/rep : 11/28/11 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 10:55:31] [INFO ] Added : 10 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8849 reset in 75 ms.
Product exploration explored 100000 steps with 9177 reset in 88 ms.
Built C files in :
/tmp/ltsmin7657343095338767817
[2024-05-24 10:55:32] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-24 10:55:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:55:32] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-24 10:55:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:55:32] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-24 10:55:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:55:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7657343095338767817
Running compilation step : cd /tmp/ltsmin7657343095338767817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 92 ms.
Running link step : cd /tmp/ltsmin7657343095338767817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7657343095338767817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased818972634453899041.hoa' '--buchi-type=spotba'
LTSmin run took 10212 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-05 finished in 12479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 10:55:42] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 10:55:42] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 10:55:42] [INFO ] Invariant cache hit.
[2024-05-24 10:55:42] [INFO ] Implicit Places using invariants in 28 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s10 1) (GEQ s28 700)) (AND (GEQ s1 1) (GEQ s23 1))), p1:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s28 700))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-06 finished in 187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&F(G(p1))&&G(p2)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 6 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-24 10:55:42] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 10:55:42] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 10:55:42] [INFO ] Invariant cache hit.
[2024-05-24 10:55:42] [INFO ] Implicit Places using invariants in 37 ms returned [1, 2, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 16/22 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 22 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 19 transition count 13
Applied a total of 6 rules in 3 ms. Remains 19 /22 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 19 cols
[2024-05-24 10:55:42] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 10:55:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 10:55:42] [INFO ] Invariant cache hit.
[2024-05-24 10:55:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 10:55:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/33 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 19/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p1) p0), true, p0, (NOT p1), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s10 1), p0:(OR (LT s1 1) (LT s9 1)), p1:(AND (GEQ s2 1) (GEQ s15 200))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-07 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F((X(p2)||G(p3)||p1)))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 10:55:42] [INFO ] Computed 12 invariants in 0 ms
[2024-05-24 10:55:42] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 10:55:42] [INFO ] Invariant cache hit.
[2024-05-24 10:55:42] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s18 1), p1:(OR (LT s16 1) (LT s19 1)), p3:(OR (LT s6 1) (LT s10 1)), p2:(OR (LT s6 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-08 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(G((p1 U p2))) U p3)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 30 transition count 19
Applied a total of 6 rules in 7 ms. Remains 30 /33 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 30 cols
[2024-05-24 10:55:43] [INFO ] Computed 12 invariants in 0 ms
[2024-05-24 10:55:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 10:55:43] [INFO ] Invariant cache hit.
[2024-05-24 10:55:43] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/33 places, 19/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 24 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 24 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 22 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 21 transition count 14
Applied a total of 10 rules in 3 ms. Remains 21 /26 variables (removed 5) and now considering 14/19 (removed 5) transitions.
// Phase 1: matrix 14 rows 21 cols
[2024-05-24 10:55:43] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 10:55:43] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2024-05-24 10:55:43] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 10:55:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 57 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/33 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 135 ms. Remains : 19/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p3), (NOT p2), (NOT p3), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s3 1) (GEQ s15 200)), p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s7 1)), p2:(AND (GEQ s0 1) (GEQ s1 1)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2518 steps with 6 reset in 15 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-09 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 10:55:43] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 10:55:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 10:55:43] [INFO ] Invariant cache hit.
[2024-05-24 10:55:43] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 565 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 2) (LT s12 1) (LT s25 1)), p1:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s25 1) (GEQ s15 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-10 finished in 906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&(X(p1) U ((p1&&X(p1))||X(G(p1))))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 10:55:44] [INFO ] Invariant cache hit.
[2024-05-24 10:55:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-24 10:55:44] [INFO ] Invariant cache hit.
[2024-05-24 10:55:44] [INFO ] Implicit Places using invariants in 32 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s7 1) (LT s8 1)), p0:(OR (AND (GEQ s1 700) (GEQ s22 700)) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-12 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 10:55:44] [INFO ] Invariant cache hit.
[2024-05-24 10:55:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 10:55:44] [INFO ] Invariant cache hit.
[2024-05-24 10:55:44] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s16 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-14 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0&&X(X((!p1 U p0))))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 10:55:45] [INFO ] Invariant cache hit.
[2024-05-24 10:55:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 10:55:45] [INFO ] Invariant cache hit.
[2024-05-24 10:55:45] [INFO ] Implicit Places using invariants in 31 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), true, true, true]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1)), p1:(AND (GEQ s1 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2565 reset in 115 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-15 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Found a Shortening insensitive property : GPPP-PT-C0100N0000010000-LTLFireability-01
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 33 transition count 21
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 30 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 28 transition count 19
Applied a total of 8 rules in 8 ms. Remains 28 /33 variables (removed 5) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2024-05-24 10:55:45] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 10:55:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 10:55:45] [INFO ] Invariant cache hit.
[2024-05-24 10:55:45] [INFO ] Implicit Places using invariants in 30 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 25/33 places, 19/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 18
Applied a total of 2 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-24 10:55:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 10:55:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 10:55:45] [INFO ] Invariant cache hit.
[2024-05-24 10:55:45] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 24/33 places, 18/22 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 139 ms. Remains : 24/33 places, 18/22 transitions.
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s10 1) (AND (GEQ s12 1) (GEQ s14 1))), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9099 reset in 88 ms.
Product exploration explored 100000 steps with 9112 reset in 90 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 706 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=706 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-24 10:55:46] [INFO ] Invariant cache hit.
[2024-05-24 10:55:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 10:55:46] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 10:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:55:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 10:55:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:55:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 10:55:46] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 10:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:55:47] [INFO ] [Nat]Absence check using state equation in 1078 ms returned sat
[2024-05-24 10:55:47] [INFO ] Computed and/alt/rep : 17/42/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 10:55:47] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-24 10:55:47] [INFO ] Invariant cache hit.
[2024-05-24 10:55:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 10:55:47] [INFO ] Invariant cache hit.
[2024-05-24 10:55:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 10:55:47] [INFO ] Invariant cache hit.
[2024-05-24 10:55:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-24 10:55:47] [INFO ] Invariant cache hit.
[2024-05-24 10:55:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 24/24 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1013 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=506 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-24 10:55:48] [INFO ] Invariant cache hit.
[2024-05-24 10:55:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 10:55:48] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-24 10:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:55:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 10:55:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:55:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 10:55:48] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 10:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:55:49] [INFO ] [Nat]Absence check using state equation in 1019 ms returned sat
[2024-05-24 10:55:49] [INFO ] Computed and/alt/rep : 17/42/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 10:55:49] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9047 reset in 87 ms.
Product exploration explored 100000 steps with 9101 reset in 90 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-24 10:55:49] [INFO ] Invariant cache hit.
[2024-05-24 10:55:49] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-24 10:55:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 10:55:49] [INFO ] Invariant cache hit.
[2024-05-24 10:55:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 24/24 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin12106960378502756433
[2024-05-24 10:55:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12106960378502756433
Running compilation step : cd /tmp/ltsmin12106960378502756433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 97 ms.
Running link step : cd /tmp/ltsmin12106960378502756433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12106960378502756433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1277820474880581988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-24 10:56:05] [INFO ] Invariant cache hit.
[2024-05-24 10:56:05] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-24 10:56:05] [INFO ] Invariant cache hit.
[2024-05-24 10:56:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 10:56:05] [INFO ] Invariant cache hit.
[2024-05-24 10:56:05] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-24 10:56:05] [INFO ] Invariant cache hit.
[2024-05-24 10:56:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 24/24 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin13815051886249768112
[2024-05-24 10:56:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13815051886249768112
Running compilation step : cd /tmp/ltsmin13815051886249768112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 142 ms.
Running link step : cd /tmp/ltsmin13815051886249768112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13815051886249768112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10233200271347331108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 10:56:20] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:56:20] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:56:20] [INFO ] Time to serialize gal into /tmp/LTL9918482983775263565.gal : 1 ms
[2024-05-24 10:56:20] [INFO ] Time to serialize properties into /tmp/LTL18207025095905941640.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9918482983775263565.gal' '-t' 'CGAL' '-hoa' '/tmp/aut997859362519359414.hoa' '-atoms' '/tmp/LTL18207025095905941640.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL18207025095905941640.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut997859362519359414.hoa
Detected timeout of ITS tools.
[2024-05-24 10:56:35] [INFO ] Flatten gal took : 1 ms
[2024-05-24 10:56:35] [INFO ] Flatten gal took : 1 ms
[2024-05-24 10:56:35] [INFO ] Time to serialize gal into /tmp/LTL11304438094722955914.gal : 1 ms
[2024-05-24 10:56:35] [INFO ] Time to serialize properties into /tmp/LTL15046472911378892650.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11304438094722955914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15046472911378892650.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("((DHAP>=1)||((ADP>=1)&&(PEP>=1)))"))||(X(F("(DHAP>=1)"))))))
Formula 0 simplified : X(G!"((DHAP>=1)||((ADP>=1)&&(PEP>=1)))" & XG!"(DHAP>=1)")
Detected timeout of ITS tools.
[2024-05-24 10:56:50] [INFO ] Flatten gal took : 6 ms
[2024-05-24 10:56:50] [INFO ] Applying decomposition
[2024-05-24 10:56:50] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14454987535759869816.txt' '-o' '/tmp/graph14454987535759869816.bin' '-w' '/tmp/graph14454987535759869816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14454987535759869816.bin' '-l' '-1' '-v' '-w' '/tmp/graph14454987535759869816.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:56:50] [INFO ] Decomposing Gal with order
[2024-05-24 10:56:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:56:50] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:56:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 10:56:50] [INFO ] Time to serialize gal into /tmp/LTL13008574967646503296.gal : 1 ms
[2024-05-24 10:56:50] [INFO ] Time to serialize properties into /tmp/LTL4205649475308989897.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13008574967646503296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4205649475308989897.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("((i0.u0.DHAP>=1)||((i1.u2.ADP>=1)&&(i1.u1.PEP>=1)))"))||(X(F("(i0.u0.DHAP>=1)"))))))
Formula 0 simplified : X(G!"((i0.u0.DHAP>=1)||((i1.u2.ADP>=1)&&(i1.u1.PEP>=1)))" & XG!"(i0.u0.DHAP>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13831871936588626572
[2024-05-24 10:57:05] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13831871936588626572
Running compilation step : cd /tmp/ltsmin13831871936588626572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin13831871936588626572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin13831871936588626572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-01 finished in 95223 ms.
[2024-05-24 10:57:20] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1180276577014422324
[2024-05-24 10:57:20] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-24 10:57:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:57:20] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-24 10:57:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:57:20] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-24 10:57:20] [INFO ] Applying decomposition
[2024-05-24 10:57:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:57:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1180276577014422324
[2024-05-24 10:57:20] [INFO ] Flatten gal took : 2 ms
Running compilation step : cd /tmp/ltsmin1180276577014422324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5135573676792382121.txt' '-o' '/tmp/graph5135573676792382121.bin' '-w' '/tmp/graph5135573676792382121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5135573676792382121.bin' '-l' '-1' '-v' '-w' '/tmp/graph5135573676792382121.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:57:20] [INFO ] Decomposing Gal with order
[2024-05-24 10:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:57:20] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-24 10:57:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 10:57:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 10:57:20] [INFO ] Time to serialize gal into /tmp/LTLFireability8620097887727318839.gal : 1 ms
[2024-05-24 10:57:20] [INFO ] Time to serialize properties into /tmp/LTLFireability10655800197484930224.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8620097887727318839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10655800197484930224.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("((i1.u4.DHAP>=1)||((i3.u0.ADP>=1)&&(u5.PEP>=1)))"))||(X(F("(i1.u4.DHAP>=1)"))))))
Formula 0 simplified : X(G!"((i1.u4.DHAP>=1)||((i3.u0.ADP>=1)&&(u5.PEP>=1)))" & XG!"(i1.u4.DHAP>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-24 10:57:20] [INFO ] Flatten gal took : 1 ms
[2024-05-24 10:57:20] [INFO ] Time to serialize gal into /tmp/LTLFireability1680262652213839530.gal : 1 ms
[2024-05-24 10:57:20] [INFO ] Time to serialize properties into /tmp/LTLFireability4044934634453881049.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1680262652213839530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4044934634453881049.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X((F("((DHAP>=1)||((ADP>=1)&&(PEP>=1)))"))||(X(F("(DHAP>=1)"))))))
Formula 0 simplified : X(G!"((DHAP>=1)||((ADP>=1)&&(PEP>=1)))" & XG!"(DHAP>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-24 10:57:20] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:57:20] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-24 10:57:20] [INFO ] Transformed 33 places.
[2024-05-24 10:57:20] [INFO ] Transformed 22 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 10:57:20] [INFO ] Time to serialize gal into /tmp/LTLFireability1416407344598456692.gal : 1 ms
[2024-05-24 10:57:20] [INFO ] Time to serialize properties into /tmp/LTLFireability12694352814581108975.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1416407344598456692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12694352814581108975.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin1180276577014422324;'gcc' '-shared' '-o' 'gal.so' 'model.o'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("((DHAP>=1)||((ADP>=1)&&(PEP>=1)))"))||(X(F("(DHAP>=1)"))))))
Formula 0 simplified : X(G!"((DHAP>=1)||((ADP>=1)&&(PEP>=1)))" & XG!"(DHAP>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1180276577014422324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 2/ 8), 0.001: "X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.070: DFS-FIFO for weak LTL, using special progress label 25
pins2lts-mc-linux64( 0/ 8), 0.070: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.070: State length is 34, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.070: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.070: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.070: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.070: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.140: ~90 levels ~960 states ~4328 transitions
pins2lts-mc-linux64( 0/ 8), 0.192: ~173 levels ~1920 states ~8856 transitions
pins2lts-mc-linux64( 0/ 8), 0.311: ~361 levels ~3840 states ~19016 transitions
pins2lts-mc-linux64( 0/ 8), 0.523: ~728 levels ~7680 states ~39624 transitions
pins2lts-mc-linux64( 0/ 8), 0.855: ~1441 levels ~15360 states ~78560 transitions
pins2lts-mc-linux64( 0/ 8), 1.205: ~2699 levels ~30720 states ~130800 transitions
pins2lts-mc-linux64( 0/ 8), 1.355: ~2806 levels ~61440 states ~171208 transitions
pins2lts-mc-linux64( 0/ 8), 1.642: ~2806 levels ~122880 states ~252064 transitions
pins2lts-mc-linux64( 0/ 8), 2.194: ~2806 levels ~245760 states ~413264 transitions
pins2lts-mc-linux64( 0/ 8), 3.034: ~2806 levels ~491520 states ~740280 transitions
pins2lts-mc-linux64( 0/ 8), 4.343: ~2806 levels ~983040 states ~1390424 transitions
pins2lts-mc-linux64( 0/ 8), 6.318: ~2806 levels ~1966080 states ~2730896 transitions
pins2lts-mc-linux64( 0/ 8), 11.448: ~2806 levels ~3932160 states ~5994168 transitions
pins2lts-mc-linux64( 0/ 8), 15.089: ~2806 levels ~7864320 states ~12530784 transitions
pins2lts-mc-linux64( 0/ 8), 20.671: ~2806 levels ~15728640 states ~25605256 transitions
pins2lts-mc-linux64( 0/ 8), 32.355: ~2806 levels ~31457280 states ~53941544 transitions
pins2lts-mc-linux64( 0/ 8), 57.013: ~2806 levels ~62914560 states ~115397712 transitions
pins2lts-mc-linux64( 0/ 8), 108.215: ~2806 levels ~125829120 states ~236886472 transitions
pins2lts-mc-linux64( 0/ 8), 191.758: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 191.766:
pins2lts-mc-linux64( 0/ 8), 191.766: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 191.766:
pins2lts-mc-linux64( 0/ 8), 191.766: Explored 23885380 states 45647183 transitions, fanout: 1.911
pins2lts-mc-linux64( 0/ 8), 191.766: Total exploration time 191.690 sec (191.650 sec minimum, 191.663 sec on average)
pins2lts-mc-linux64( 0/ 8), 191.766: States per second: 124604, Transitions per second: 238130
pins2lts-mc-linux64( 0/ 8), 191.766:
pins2lts-mc-linux64( 0/ 8), 191.766: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 191.766: Redundant explorations: -0.0470
pins2lts-mc-linux64( 0/ 8), 191.766:
pins2lts-mc-linux64( 0/ 8), 191.766: Queue width: 8B, total height: 2815, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 191.766: Tree memory: 438.3MB, 19.2 B/state, compr.: 13.9%
pins2lts-mc-linux64( 0/ 8), 191.766: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 191.766: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 191.766: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 191.766: Est. total memory use: 438.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1180276577014422324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1180276577014422324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Total runtime 402391 ms.

BK_STOP 1716548439135

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is GPPP-PT-C0100N0000010000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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