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-171640625200232.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-C0001N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625200232
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.3K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 08:50 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-C0001N0000100000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716543430950

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000100000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 09:37:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 09:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:37:12] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-24 09:37:12] [INFO ] Transformed 33 places.
[2024-05-24 09:37:12] [INFO ] Transformed 22 transitions.
[2024-05-24 09:37:12] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 10 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 09:37:12] [INFO ] Computed 13 invariants in 13 ms
[2024-05-24 09:37:13] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
[2024-05-24 09:37:13] [INFO ] Invariant cache hit.
[2024-05-24 09:37:13] [INFO ] Implicit Places using invariants in 69 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 73 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 552 ms. Remains : 29/33 places, 22/22 transitions.
Support contains 22 out of 29 places after structural reductions.
[2024-05-24 09:37:13] [INFO ] Flatten gal took : 17 ms
[2024-05-24 09:37:13] [INFO ] Flatten gal took : 5 ms
[2024-05-24 09:37:13] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 29) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 22 rows 29 cols
[2024-05-24 09:37:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 09:37:14] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 09:37:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:37:14] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 09:37:14] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-24 09:37:14] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 137 ms.
[2024-05-24 09:37:14] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10003 ms.
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 4 edges and 29 vertex of which 2 / 29 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 28 transition count 19
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 4 place count 27 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 26 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 3 with 2 rules applied. Total rules applied 7 place count 25 transition count 17
Applied a total of 7 rules in 10 ms. Remains 25 /29 variables (removed 4) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2024-05-24 09:37:24] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 09:37:24] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 25/29 places, 17/22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 736480 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 736480 steps, saw 302900 distinct states, run finished after 3003 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 09:37:28] [INFO ] Invariant cache hit.
[2024-05-24 09:37:28] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 09:37:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:37:28] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:37:28] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 09:37:28] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-24 09:37:28] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 12000 ms.
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 17/17 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 25/25 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-05-24 09:37:40] [INFO ] Invariant cache hit.
[2024-05-24 09:37:40] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 09:37:40] [INFO ] Invariant cache hit.
[2024-05-24 09:37:40] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-24 09:37:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:37:40] [INFO ] Invariant cache hit.
[2024-05-24 09:37:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 25/25 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-24 09:37:40] [INFO ] Invariant cache hit.
[2024-05-24 09:37:40] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 09:37:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-24 09:37:40] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:37:40] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 09:37:40] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 09:37:40] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
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||(p1&&F(p2))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 5 edges and 29 vertex of which 2 / 29 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 25 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 23 transition count 16
Applied a total of 11 rules in 3 ms. Remains 23 /29 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 23 cols
[2024-05-24 09:37:41] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:37:41] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 09:37:41] [INFO ] Invariant cache hit.
[2024-05-24 09:37:41] [INFO ] Implicit Places using invariants in 26 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/29 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 22 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 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 4 place count 20 transition count 14
Applied a total of 4 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2024-05-24 09:37:41] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 09:37:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 09:37:41] [INFO ] Invariant cache hit.
[2024-05-24 09:37:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 09:37:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/29 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 20/29 places, 14/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 232 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s2), p0:(LEQ s13 s0), p2:(LEQ 2 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 205 ms.
Product exploration explored 100000 steps with 0 reset in 152 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 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 178 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 817425 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :{}
Probabilistic random walk after 817425 steps, saw 286320 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 09:37:45] [INFO ] Invariant cache hit.
[2024-05-24 09:37:45] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:37:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:37:45] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 14 ms returned sat
[2024-05-24 09:37:45] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:37:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 09:37:45] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:37:45] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 09:37:45] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 14/14 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 13
Applied a total of 1 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 20 cols
[2024-05-24 09:37:49] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 09:37:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 20/20 places, 13/14 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 595781 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 595781 steps, saw 321267 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 09:37:52] [INFO ] Invariant cache hit.
[2024-05-24 09:37:52] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:37:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-24 09:37:52] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-24 09:37:53] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:37:53] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:37:53] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 09:37:53] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 14 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 20/20 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-24 09:37:59] [INFO ] Invariant cache hit.
[2024-05-24 09:37:59] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 09:37:59] [INFO ] Invariant cache hit.
[2024-05-24 09:37:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:37:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-24 09:37:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:37:59] [INFO ] Invariant cache hit.
[2024-05-24 09:37:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-24 09:37:59] [INFO ] Invariant cache hit.
[2024-05-24 09:37:59] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:37:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:37:59] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-24 09:37:59] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:37:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:37:59] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:37:59] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 09:37:59] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 14/14 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 20 cols
[2024-05-24 09:37:59] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 09:37:59] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-24 09:37:59] [INFO ] Invariant cache hit.
[2024-05-24 09:37:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 09:37:59] [INFO ] Invariant cache hit.
[2024-05-24 09:37:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 09:37:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-24 09:37:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:37:59] [INFO ] Invariant cache hit.
[2024-05-24 09:37:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 20/20 places, 14/14 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 p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1097336 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{}
Probabilistic random walk after 1097336 steps, saw 335941 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 09:38:03] [INFO ] Invariant cache hit.
[2024-05-24 09:38:03] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:38:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-24 09:38:03] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-24 09:38:03] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:38:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 09:38:03] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:38:03] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 09:38:03] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 14/14 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 13
Applied a total of 1 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 20 cols
[2024-05-24 09:38:07] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 09:38:07] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 20/20 places, 13/14 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1175133 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :{}
Probabilistic random walk after 1175133 steps, saw 493814 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 09:38:10] [INFO ] Invariant cache hit.
[2024-05-24 09:38:10] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:38:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-24 09:38:10] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 9 ms returned sat
[2024-05-24 09:38:10] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:38:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:38:10] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:38:10] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 09:38:10] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-24 09:38:16] [INFO ] Invariant cache hit.
[2024-05-24 09:38:16] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 09:38:16] [INFO ] Invariant cache hit.
[2024-05-24 09:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:38:17] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-24 09:38:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:38:17] [INFO ] Invariant cache hit.
[2024-05-24 09:38:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 20/20 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-24 09:38:17] [INFO ] Invariant cache hit.
[2024-05-24 09:38:17] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:38:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:38:17] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-24 09:38:17] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:38:17] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:38:17] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 09:38:17] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 104 ms.
Product exploration explored 100000 steps with 0 reset in 101 ms.
Built C files in :
/tmp/ltsmin6375037050603323088
[2024-05-24 09:38:17] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-24 09:38:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:38:17] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-24 09:38:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:38:17] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-24 09:38:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:38:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6375037050603323088
Running compilation step : cd /tmp/ltsmin6375037050603323088;'/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 188 ms.
Running link step : cd /tmp/ltsmin6375037050603323088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6375037050603323088;'/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/stateBased10146757188650004408.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 14/14 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 20 cols
[2024-05-24 09:38:33] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 09:38:33] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2024-05-24 09:38:33] [INFO ] Invariant cache hit.
[2024-05-24 09:38:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 09:38:33] [INFO ] Invariant cache hit.
[2024-05-24 09:38:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 09:38:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 09:38:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:38:33] [INFO ] Invariant cache hit.
[2024-05-24 09:38:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 20/20 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin10446028782138475857
[2024-05-24 09:38:33] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-24 09:38:33] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:38:33] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-24 09:38:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:38:33] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-24 09:38:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:38:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10446028782138475857
Running compilation step : cd /tmp/ltsmin10446028782138475857;'/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 74 ms.
Running link step : cd /tmp/ltsmin10446028782138475857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin10446028782138475857;'/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/stateBased12830564352276381721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 09:38:48] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:38:48] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:38:48] [INFO ] Time to serialize gal into /tmp/LTL2085168037106297152.gal : 1 ms
[2024-05-24 09:38:48] [INFO ] Time to serialize properties into /tmp/LTL14827570267530201592.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2085168037106297152.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13396191941739505314.hoa' '-atoms' '/tmp/LTL14827570267530201592.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...319
Loading property file /tmp/LTL14827570267530201592.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13396191941739505314.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-24 09:38:48] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:38:48] [INFO ] Flatten gal took : 1 ms
[2024-05-24 09:38:48] [INFO ] Time to serialize gal into /tmp/LTL10838639522013064048.gal : 1 ms
[2024-05-24 09:38:48] [INFO ] Time to serialize properties into /tmp/LTL12295719030339269926.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/LTL10838639522013064048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12295719030339269926.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 : !((G(F(("(Gluc<=NADPplus)")||(("(GSSG>=3)")&&(F("(c1>=2)")))))))
Formula 0 simplified : FG(!"(Gluc<=NADPplus)" & (!"(GSSG>=3)" | G!"(c1>=2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-24 09:38:48] [INFO ] Flatten gal took : 1 ms
[2024-05-24 09:38:48] [INFO ] Applying decomposition
[2024-05-24 09:38:48] [INFO ] Flatten gal took : 1 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/graph16100760187530205232.txt' '-o' '/tmp/graph16100760187530205232.bin' '-w' '/tmp/graph16100760187530205232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16100760187530205232.bin' '-l' '-1' '-v' '-w' '/tmp/graph16100760187530205232.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:38:48] [INFO ] Decomposing Gal with order
[2024-05-24 09:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:38:48] [INFO ] Flatten gal took : 26 ms
[2024-05-24 09:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 09:38:48] [INFO ] Time to serialize gal into /tmp/LTL4493239254200757044.gal : 0 ms
[2024-05-24 09:38:48] [INFO ] Time to serialize properties into /tmp/LTL809394633419280040.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/LTL4493239254200757044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL809394633419280040.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...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu0.Gluc<=gu0.NADPplus)")||(("(gi1.gu1.GSSG>=3)")&&(F("(gi1.gu6.c1>=2)")))))))
Formula 0 simplified : FG(!"(gu0.Gluc<=gu0.NADPplus)" & (!"(gi1.gu1.GSSG>=3)" | G!"(gi1.gu6.c1>=2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin15383723755170876217
[2024-05-24 09:38:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15383723755170876217
Running compilation step : cd /tmp/ltsmin15383723755170876217;'/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 75 ms.
Running link step : cd /tmp/ltsmin15383723755170876217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15383723755170876217;'/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' '[](<>(((LTLAPp0==true)||((LTLAPp1==true)&&<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-00 finished in 82566 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(G(((p0||F(p1))&&(F(p1)||G(p2))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 25 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 0 with 3 rules applied. Total rules applied 10 place count 23 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 0 with 2 rules applied. Total rules applied 12 place count 22 transition count 17
Applied a total of 12 rules in 5 ms. Remains 22 /29 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 09:39:03] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 09:39:03] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
[2024-05-24 09:39:03] [INFO ] Invariant cache hit.
[2024-05-24 09:39:03] [INFO ] Implicit Places using invariants in 32 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/29 places, 17/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 21 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 16
Applied a total of 2 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 20 cols
[2024-05-24 09:39:03] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 09:39:04] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-24 09:39:04] [INFO ] Invariant cache hit.
[2024-05-24 09:39:04] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/29 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 479 ms. Remains : 20/29 places, 16/22 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s12), p1:(LEQ 3 s8), p2:(LEQ s17 s10)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2912 reset in 139 ms.
Stack based approach found an accepted trace after 19 steps with 1 reset with depth 4 and stack size 4 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-02 finished in 772 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) U (p1||F(G(p2))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2024-05-24 09:39:04] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:39:04] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-24 09:39:04] [INFO ] Invariant cache hit.
[2024-05-24 09:39:04] [INFO ] Implicit Places using invariants in 97 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 152 ms. Remains : 28/29 places, 22/22 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 3 s14), p2:(LEQ s21 s24), p0:(GT 3 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 120 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 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-03 finished in 731 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&&G(p1))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/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 29 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 27 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 11 place count 23 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 22 transition count 16
Applied a total of 13 rules in 3 ms. Remains 22 /29 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 22 cols
[2024-05-24 09:39:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 09:39:05] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
[2024-05-24 09:39:05] [INFO ] Invariant cache hit.
[2024-05-24 09:39:05] [INFO ] Implicit Places using invariants in 29 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/29 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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 15
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 20 transition count 14
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 19 transition count 14
Applied a total of 4 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 19 cols
[2024-05-24 09:39:05] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 09:39:05] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 09:39:05] [INFO ] Invariant cache hit.
[2024-05-24 09:39:05] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/29 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 19/29 places, 14/22 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6 s1), p1:(LEQ s12 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 89 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 p1), (X (AND p0 p1)), (X p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 09:39:06] [INFO ] Invariant cache hit.
[2024-05-24 09:39:06] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:39:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 09:39:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 9 ms returned sat
[2024-05-24 09:39:06] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 09:39:06] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 09:39:06] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1033326 steps, including 0 resets, run visited all 1 properties in 979 ms. (steps per millisecond=1055 )
Parikh walk visited 1 properties in 979 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-24 09:39:07] [INFO ] Invariant cache hit.
[2024-05-24 09:39:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-24 09:39:07] [INFO ] Invariant cache hit.
[2024-05-24 09:39:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 09:39:07] [INFO ] Invariant cache hit.
[2024-05-24 09:39:07] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-24 09:39:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 09:39:07] [INFO ] Invariant cache hit.
[2024-05-24 09:39:07] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 19/19 places, 14/14 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 p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 09:39:07] [INFO ] Invariant cache hit.
[2024-05-24 09:39:08] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:39:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 09:39:08] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-24 09:39:08] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 09:39:08] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 09:39:08] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1033326 steps, including 0 resets, run visited all 1 properties in 967 ms. (steps per millisecond=1068 )
Parikh walk visited 1 properties in 966 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Built C files in :
/tmp/ltsmin12587950132246087313
[2024-05-24 09:39:09] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-24 09:39:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:39:09] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-24 09:39:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:39:09] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-24 09:39:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:39:09] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12587950132246087313
Running compilation step : cd /tmp/ltsmin12587950132246087313;'/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 75 ms.
Running link step : cd /tmp/ltsmin12587950132246087313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin12587950132246087313;'/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/stateBased8318477746231108553.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 14/14 transitions.
Applied a total of 0 rules in 9 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-24 09:39:24] [INFO ] Invariant cache hit.
[2024-05-24 09:39:24] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-24 09:39:24] [INFO ] Invariant cache hit.
[2024-05-24 09:39:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 09:39:24] [INFO ] Invariant cache hit.
[2024-05-24 09:39:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 09:39:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:39:25] [INFO ] Invariant cache hit.
[2024-05-24 09:39:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 19/19 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin17600677331752587706
[2024-05-24 09:39:25] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-24 09:39:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:39:25] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-24 09:39:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:39:25] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-24 09:39:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:39:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17600677331752587706
Running compilation step : cd /tmp/ltsmin17600677331752587706;'/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 77 ms.
Running link step : cd /tmp/ltsmin17600677331752587706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin17600677331752587706;'/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/stateBased17306857208862188721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 09:39:40] [INFO ] Flatten gal took : 7 ms
[2024-05-24 09:39:40] [INFO ] Flatten gal took : 1 ms
[2024-05-24 09:39:40] [INFO ] Time to serialize gal into /tmp/LTL3874152536209890158.gal : 1 ms
[2024-05-24 09:39:40] [INFO ] Time to serialize properties into /tmp/LTL18173040271905693063.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3874152536209890158.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7869270853514642682.hoa' '-atoms' '/tmp/LTL18173040271905693063.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...318
Loading property file /tmp/LTL18173040271905693063.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7869270853514642682.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-24 09:39:40] [INFO ] Flatten gal took : 1 ms
[2024-05-24 09:39:40] [INFO ] Flatten gal took : 1 ms
[2024-05-24 09:39:40] [INFO ] Time to serialize gal into /tmp/LTL329916914706264261.gal : 1 ms
[2024-05-24 09:39:40] [INFO ] Time to serialize properties into /tmp/LTL11801757490080116217.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/LTL329916914706264261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11801757490080116217.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...275
Read 1 LTL properties
Checking formula 0 : !((F(("(GAP<=NADPH)")&&(G("(Lac<=NADPplus)")))))
Formula 0 simplified : G(!"(GAP<=NADPH)" | F!"(Lac<=NADPplus)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-24 09:39:40] [INFO ] Flatten gal took : 1 ms
[2024-05-24 09:39:40] [INFO ] Applying decomposition
[2024-05-24 09:39:40] [INFO ] Flatten gal took : 1 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/graph14529132738433859321.txt' '-o' '/tmp/graph14529132738433859321.bin' '-w' '/tmp/graph14529132738433859321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14529132738433859321.bin' '-l' '-1' '-v' '-w' '/tmp/graph14529132738433859321.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:39:40] [INFO ] Decomposing Gal with order
[2024-05-24 09:39:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:39:40] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-24 09:39:40] [INFO ] Flatten gal took : 3 ms
[2024-05-24 09:39:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 09:39:40] [INFO ] Time to serialize gal into /tmp/LTL14698494495897890603.gal : 1 ms
[2024-05-24 09:39:40] [INFO ] Time to serialize properties into /tmp/LTL9652708054055318127.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/LTL14698494495897890603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9652708054055318127.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 : !((F(("(gu1.GAP<=gu1.NADPH)")&&(G("(gu0.Lac<=gu0.NADPplus)")))))
Formula 0 simplified : G(!"(gu1.GAP<=gu1.NADPH)" | F!"(gu0.Lac<=gu0.NADPplus)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin6392335107656867272
[2024-05-24 09:39:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6392335107656867272
Running compilation step : cd /tmp/ltsmin6392335107656867272;'/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 66 ms.
Running link step : cd /tmp/ltsmin6392335107656867272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6392335107656867272;'/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' '<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-04 finished in 50199 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 p1)&&X(G(p2))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2024-05-24 09:39:55] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 09:39:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 09:39:55] [INFO ] Invariant cache hit.
[2024-05-24 09:39:55] [INFO ] Implicit Places using invariants in 32 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/29 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 66 ms. Remains : 28/29 places, 22/22 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p1), (NOT p2), true]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s1 s17), p0:(GT 3 s14), p2:(LEQ s3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 107 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 p0 p2), (X p2), (X p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 93 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4485868 steps, run timeout after 3001 ms. (steps per millisecond=1494 ) properties seen :{}
Probabilistic random walk after 4485868 steps, saw 869733 distinct states, run finished after 3001 ms. (steps per millisecond=1494 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 28 cols
[2024-05-24 09:39:59] [INFO ] Computed 8 invariants in 4 ms
[2024-05-24 09:39:59] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:39:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:39:59] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-24 09:39:59] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 09:39:59] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 09:39:59] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 9 edges and 28 vertex of which 2 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 15
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 21 transition count 14
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 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 19 transition count 12
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 19 place count 18 transition count 11
Applied a total of 19 rules in 4 ms. Remains 18 /28 variables (removed 10) and now considering 11/22 (removed 11) transitions.
// Phase 1: matrix 11 rows 18 cols
[2024-05-24 09:40:01] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 09:40:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 18/28 places, 11/22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2786217 steps, run timeout after 3001 ms. (steps per millisecond=928 ) properties seen :{}
Probabilistic random walk after 2786217 steps, saw 2045367 distinct states, run finished after 3001 ms. (steps per millisecond=928 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 09:40:04] [INFO ] Invariant cache hit.
[2024-05-24 09:40:04] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:40:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:04] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-24 09:40:04] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 09:40:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:40:04] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 09:40:04] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 09:40:04] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 399992 steps, including 0 resets, run visited all 1 properties in 458 ms. (steps per millisecond=873 )
Parikh walk visited 1 properties in 457 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 10 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-05 finished in 9589 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 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 5 edges and 29 vertex of which 2 / 29 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 16 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 17 transition count 12
Applied a total of 21 rules in 12 ms. Remains 17 /29 variables (removed 12) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-24 09:40:05] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 09:40:05] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:05] [INFO ] Implicit Places using invariants in 26 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 12/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 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 11
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 4 place count 14 transition count 10
Applied a total of 4 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-24 09:40:05] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 09:40:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 09:40:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/29 places, 10/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 159 ms. Remains : 14/29 places, 10/22 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-06 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:(LEQ 2 s9)], 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 8 steps with 2 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-06 finished in 234 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 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 5 edges and 29 vertex of which 2 / 29 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 16 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 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 21 place count 17 transition count 12
Applied a total of 21 rules in 4 ms. Remains 17 /29 variables (removed 12) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-24 09:40:05] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 09:40:05] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:05] [INFO ] Implicit Places using invariants in 22 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 12/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 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 11
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 4 place count 14 transition count 10
Applied a total of 4 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-24 09:40:05] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 09:40:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 09:40:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/29 places, 10/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 14/29 places, 10/22 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-08 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:(LEQ 2 s13)], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-08 finished in 242 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&&X(p1)&&(p2||G(p0))) U p3))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2024-05-24 09:40:05] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 09:40:05] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:05] [INFO ] Implicit Places using invariants in 25 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 66 ms. Remains : 28/29 places, 22/22 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p3), true, (OR (AND (NOT p1) p3) (AND p0 (NOT p1))), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p3 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ 2 s8), p0:(GT s24 s8), p2:(GT s21 s2), p1:(GT 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-09 finished in 203 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 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:05] [INFO ] Implicit Places using invariants in 29 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/29 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 84 ms. Remains : 28/29 places, 22/22 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-11 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:(LEQ 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-11 finished in 169 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(X(F(p0)))))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 09:40:05] [INFO ] Invariant cache hit.
[2024-05-24 09:40:06] [INFO ] Implicit Places using invariants in 26 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 71 ms. Remains : 28/29 places, 22/22 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 82 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-12 finished in 301 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(G(p0)))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 5 edges and 29 vertex of which 2 / 29 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 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 3 place count 28 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 26 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 16 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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 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 21 place count 17 transition count 12
Applied a total of 21 rules in 4 ms. Remains 17 /29 variables (removed 12) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-24 09:40:06] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 09:40:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-24 09:40:06] [INFO ] Invariant cache hit.
[2024-05-24 09:40:06] [INFO ] Implicit Places using invariants in 21 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 12/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 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 11
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-05-24 09:40:06] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 09:40:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 09:40:06] [INFO ] Invariant cache hit.
[2024-05-24 09:40:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 09:40:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/29 places, 11/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 15/29 places, 11/22 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-13 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(X((G(p0)||p1)))) U p2))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2024-05-24 09:40:06] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:40:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 09:40:06] [INFO ] Invariant cache hit.
[2024-05-24 09:40:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 09:40:06] [INFO ] Invariant cache hit.
[2024-05-24 09:40:06] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-24 09:40:06] [INFO ] Invariant cache hit.
[2024-05-24 09:40:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 29/29 places, 22/22 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LEQ s0 s8) (GT s19 s22)), p1:(LEQ s27 s13), p0:(LEQ s15 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 117 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 p2) (NOT p1) p0), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 09:40:07] [INFO ] Invariant cache hit.
[2024-05-24 09:40:07] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:40:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:07] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:40:07] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:40:07] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-24 09:40:07] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 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 29 transition count 21
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 28 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 26 transition count 19
Applied a total of 6 rules in 1 ms. Remains 26 /29 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 26 cols
[2024-05-24 09:40:11] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 09:40:11] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 26/29 places, 19/22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2082936 steps, run timeout after 3001 ms. (steps per millisecond=694 ) properties seen :{}
Probabilistic random walk after 2082936 steps, saw 632691 distinct states, run finished after 3001 ms. (steps per millisecond=694 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 09:40:14] [INFO ] Invariant cache hit.
[2024-05-24 09:40:14] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:40:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:14] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:40:14] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:40:15] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-24 09:40:15] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 19/19 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 26/26 places, 19/19 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-05-24 09:40:19] [INFO ] Invariant cache hit.
[2024-05-24 09:40:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 09:40:19] [INFO ] Invariant cache hit.
[2024-05-24 09:40:19] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-24 09:40:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:40:19] [INFO ] Invariant cache hit.
[2024-05-24 09:40:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 26/26 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-24 09:40:19] [INFO ] Invariant cache hit.
[2024-05-24 09:40:19] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:40:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:19] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:40:19] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:40:19] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-24 09:40:19] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
// Phase 1: matrix 22 rows 29 cols
[2024-05-24 09:40:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:40:20] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:20] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:40:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 09:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:40:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:20] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:40:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 09:40:20] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 09:40:20] [INFO ] Added : 20 causal constraints over 4 iterations in 26 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:40:20] [INFO ] Invariant cache hit.
[2024-05-24 09:40:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 09:40:20] [INFO ] Invariant cache hit.
[2024-05-24 09:40:20] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 09:40:20] [INFO ] Invariant cache hit.
[2024-05-24 09:40:20] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-24 09:40:20] [INFO ] Invariant cache hit.
[2024-05-24 09:40:20] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 29/29 places, 22/22 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 p2) p0 (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 09:40:20] [INFO ] Invariant cache hit.
[2024-05-24 09:40:20] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:40:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-24 09:40:20] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 09:40:20] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:40:20] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-24 09:40:20] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 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 29 transition count 21
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 28 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 26 transition count 19
Applied a total of 6 rules in 7 ms. Remains 26 /29 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 26 cols
[2024-05-24 09:40:24] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 09:40:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 26/29 places, 19/22 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2076279 steps, run timeout after 3001 ms. (steps per millisecond=691 ) properties seen :{}
Probabilistic random walk after 2076279 steps, saw 631686 distinct states, run finished after 3001 ms. (steps per millisecond=691 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 09:40:27] [INFO ] Invariant cache hit.
[2024-05-24 09:40:27] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:40:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:27] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:40:28] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:40:28] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-24 09:40:28] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 26/26 places, 19/19 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-05-24 09:40:32] [INFO ] Invariant cache hit.
[2024-05-24 09:40:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 09:40:32] [INFO ] Invariant cache hit.
[2024-05-24 09:40:32] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-24 09:40:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:40:32] [INFO ] Invariant cache hit.
[2024-05-24 09:40:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 26/26 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-24 09:40:32] [INFO ] Invariant cache hit.
[2024-05-24 09:40:32] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:40:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:32] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:40:32] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:40:32] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-24 09:40:32] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
// Phase 1: matrix 22 rows 29 cols
[2024-05-24 09:40:33] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 09:40:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:40:33] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:40:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 09:40:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:40:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-24 09:40:33] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:40:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 09:40:33] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:40:33] [INFO ] Added : 20 causal constraints over 4 iterations in 16 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 29 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2024-05-24 09:40:33] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 09:40:33] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-24 09:40:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:40:33] [INFO ] Invariant cache hit.
[2024-05-24 09:40:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/29 places, 22/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 29/29 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin3291483435446330825
[2024-05-24 09:40:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3291483435446330825
Running compilation step : cd /tmp/ltsmin3291483435446330825;'/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 82 ms.
Running link step : cd /tmp/ltsmin3291483435446330825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin3291483435446330825;'/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/stateBased15254109012609977175.hoa' '--buchi-type=spotba'
LTSmin run took 68 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000100000-LTLCardinality-14 finished in 27807 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||(p1&&F(p2))))))'
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&&G(p1))))'
[2024-05-24 09:40:34] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1683220929687770233
[2024-05-24 09:40:34] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-24 09:40:34] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:40:34] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-24 09:40:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:40:34] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-24 09:40:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:40:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1683220929687770233
Running compilation step : cd /tmp/ltsmin1683220929687770233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
[2024-05-24 09:40:34] [INFO ] Applying decomposition
[2024-05-24 09:40:34] [INFO ] Flatten gal took : 1 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/graph1070288983879467519.txt' '-o' '/tmp/graph1070288983879467519.bin' '-w' '/tmp/graph1070288983879467519.weights'
Compilation finished in 87 ms.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1070288983879467519.bin' '-l' '-1' '-v' '-w' '/tmp/graph1070288983879467519.weights' '-q' '0' '-e' '0.001'
Running link step : cd /tmp/ltsmin1683220929687770233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2024-05-24 09:40:34] [INFO ] Decomposing Gal with order
[2024-05-24 09:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:40:34] [INFO ] Removed a total of 3 redundant transitions.
[2024-05-24 09:40:34] [INFO ] Flatten gal took : 3 ms
[2024-05-24 09:40:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 09:40:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality8527171067692087254.gal : 1 ms
[2024-05-24 09:40:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality9032082493576521933.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/LTLCardinality8527171067692087254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9032082493576521933.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin1683220929687770233;'/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' '--ltl' '[](<>(((LTLAPp0==true)||((LTLAPp1==true)&&<>((LTLAPp2==true))))))' '--buchi-type=spotba'

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 2 LTL properties
Checking formula 0 : !((G(F(("(gu4.Gluc<=gu4.NADPplus)")||(("(gu0.GSSG>=3)")&&(F("(gi3.gi1.gu7.c1>=2)")))))))
Formula 0 simplified : FG(!"(gu4.Gluc<=gu4.NADPplus)" & (!"(gu0.GSSG>=3)" | G!"(gi3.gi1.gu7.c1>=2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-24 09:40:34] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:40:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality10230810843169824603.gal : 0 ms
[2024-05-24 09:40:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality7766634420993324190.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/LTLCardinality10230810843169824603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7766634420993324190.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...298
Read 2 LTL properties
Checking formula 0 : !((G(F(("(Gluc<=NADPplus)")||(("(GSSG>=3)")&&(F("(c1>=2)")))))))
Formula 0 simplified : FG(!"(Gluc<=NADPplus)" & (!"(GSSG>=3)" | G!"(c1>=2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-24 09:40:34] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:40:34] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-24 09:40:35] [INFO ] Transformed 29 places.
[2024-05-24 09:40:35] [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 09:40:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality13791180347520687661.gal : 0 ms
[2024-05-24 09:40:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality8680350609403774315.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/LTLCardinality13791180347520687661.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8680350609403774315.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(Gluc<=NADPplus)")||(("(GSSG>=3)")&&(F("(c1>=2)")))))))
Formula 0 simplified : FG(!"(Gluc<=NADPplus)" & (!"(GSSG>=3)" | G!"(c1>=2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
LTSmin run took 72084 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1683220929687770233;'/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' '--ltl' '<>(((LTLAPp3==true)&&[]((LTLAPp4==true))))' '--buchi-type=spotba'
LTSmin run took 52377 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Total runtime 326593 ms.

BK_STOP 1716543760130

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0001N0000100000"
export BK_EXAMINATION="LTLCardinality"
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-C0001N0000100000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625200232"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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