fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r485-tall-167912699700652
Last Updated
May 14, 2023

About the Execution of ITS-Tools for TokenRing-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
872.287 58904.00 50288.00 10373.60 FFFFFFTTTTFTTFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 72K Feb 25 14:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 423K Feb 25 14:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 106K Feb 25 14:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 415K Feb 25 14:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 49K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 156K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 68K Feb 25 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 390K Feb 25 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 235K Feb 25 14:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 947K Feb 25 14:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:23 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 TokenRing-PT-005-LTLFireability-00
FORMULA_NAME TokenRing-PT-005-LTLFireability-01
FORMULA_NAME TokenRing-PT-005-LTLFireability-02
FORMULA_NAME TokenRing-PT-005-LTLFireability-03
FORMULA_NAME TokenRing-PT-005-LTLFireability-04
FORMULA_NAME TokenRing-PT-005-LTLFireability-05
FORMULA_NAME TokenRing-PT-005-LTLFireability-06
FORMULA_NAME TokenRing-PT-005-LTLFireability-07
FORMULA_NAME TokenRing-PT-005-LTLFireability-08
FORMULA_NAME TokenRing-PT-005-LTLFireability-09
FORMULA_NAME TokenRing-PT-005-LTLFireability-10
FORMULA_NAME TokenRing-PT-005-LTLFireability-11
FORMULA_NAME TokenRing-PT-005-LTLFireability-12
FORMULA_NAME TokenRing-PT-005-LTLFireability-13
FORMULA_NAME TokenRing-PT-005-LTLFireability-14
FORMULA_NAME TokenRing-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679267193255

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-005
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 23:06:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 23:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:06:35] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-19 23:06:35] [INFO ] Transformed 36 places.
[2023-03-19 23:06:35] [INFO ] Transformed 156 transitions.
[2023-03-19 23:06:35] [INFO ] Found NUPN structural information;
[2023-03-19 23:06:35] [INFO ] Parsed PT model containing 36 places and 156 transitions and 624 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA TokenRing-PT-005-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 36 cols
[2023-03-19 23:06:35] [INFO ] Computed 6 place invariants in 13 ms
[2023-03-19 23:06:35] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-19 23:06:35] [INFO ] Invariant cache hit.
[2023-03-19 23:06:35] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:35] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-19 23:06:35] [INFO ] Invariant cache hit.
[2023-03-19 23:06:35] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 36/36 places, 156/156 transitions.
Support contains 36 out of 36 places after structural reductions.
[2023-03-19 23:06:35] [INFO ] Flatten gal took : 33 ms
[2023-03-19 23:06:35] [INFO ] Flatten gal took : 25 ms
[2023-03-19 23:06:35] [INFO ] Input system was already deterministic with 156 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1460 ms. (steps per millisecond=6 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 23:06:37] [INFO ] Invariant cache hit.
[2023-03-19 23:06:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 23:06:38] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:06:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:06:38] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:06:38] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:38] [INFO ] After 39ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 23:06:38] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 23:06:38] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 8 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 12 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 36/36 places, 156/156 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Probably explored full state space saw : 166 states, properties seen :0
Probabilistic random walk after 531 steps, saw 166 distinct states, run finished after 21 ms. (steps per millisecond=25 ) properties seen :0
Explored full state space saw : 166 states, properties seen :0
Exhaustive walk after 531 steps, saw 166 distinct states, run finished after 3 ms. (steps per millisecond=177 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA TokenRing-PT-005-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA TokenRing-PT-005-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&F(p2))))))'
Support contains 36 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:06:39] [INFO ] Invariant cache hit.
[2023-03-19 23:06:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 23:06:39] [INFO ] Invariant cache hit.
[2023-03-19 23:06:39] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:39] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 23:06:39] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 23:06:39] [INFO ] Invariant cache hit.
[2023-03-19 23:06:39] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 36/36 places, 156/156 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TokenRing-PT-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s3 1) (EQ s27 1)) (AND (EQ s9 1) (EQ s28 1)) (AND (EQ s15 1) (EQ s30 1)) (AND (EQ s16 1) (EQ s35 1)) (AND (EQ s21 1) (EQ s31 1)) (AND (EQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9941 reset in 635 ms.
Product exploration explored 100000 steps with 9986 reset in 541 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1483 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(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 267 ms. (steps per millisecond=37 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 23:06:43] [INFO ] Invariant cache hit.
[2023-03-19 23:06:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:06:43] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 23:06:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:06:43] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 23:06:43] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:44] [INFO ] After 308ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-19 23:06:44] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-19 23:06:44] [INFO ] After 1325ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 36 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 36/36 places, 156/156 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Probably explored full state space saw : 166 states, properties seen :0
Probabilistic random walk after 531 steps, saw 166 distinct states, run finished after 10 ms. (steps per millisecond=53 ) properties seen :0
Explored full state space saw : 166 states, properties seen :0
Exhaustive walk after 531 steps, saw 166 distinct states, run finished after 4 ms. (steps per millisecond=132 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 18 factoid took 725 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1)) (AND p0 p1)), (NOT p2)]
Stuttering acceptance computed with spot in 1349 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1)) (AND p0 p1)), (NOT p2)]
[2023-03-19 23:06:47] [INFO ] Invariant cache hit.
[2023-03-19 23:06:47] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-19 23:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:06:48] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-19 23:06:48] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:48] [INFO ] [Real]Added 130 Read/Feed constraints in 8 ms returned sat
[2023-03-19 23:06:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:06:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-19 23:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:06:48] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-19 23:06:48] [INFO ] [Nat]Added 130 Read/Feed constraints in 8 ms returned sat
[2023-03-19 23:06:48] [INFO ] Computed and/alt/rep : 67/340/67 causal constraints (skipped 84 transitions) in 10 ms.
[2023-03-19 23:06:48] [INFO ] Added : 50 causal constraints over 12 iterations in 157 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 36 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:06:48] [INFO ] Invariant cache hit.
[2023-03-19 23:06:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 23:06:48] [INFO ] Invariant cache hit.
[2023-03-19 23:06:48] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-19 23:06:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 23:06:48] [INFO ] Invariant cache hit.
[2023-03-19 23:06:48] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 36/36 places, 156/156 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) (NOT p0) p1), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND p2 (NOT p0) (NOT p1)) (AND p0 p1)))), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p2 (NOT p0) (NOT p1)) (AND p0 p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 377 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1)) (AND p0 p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:06:49] [INFO ] Invariant cache hit.
[2023-03-19 23:06:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:06:49] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:06:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:06:50] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:06:50] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:50] [INFO ] After 480ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:06:51] [INFO ] After 941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 456 ms.
[2023-03-19 23:06:51] [INFO ] After 1902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 36 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 36/36 places, 156/156 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Probably explored full state space saw : 166 states, properties seen :0
Probabilistic random walk after 531 steps, saw 166 distinct states, run finished after 8 ms. (steps per millisecond=66 ) properties seen :0
Explored full state space saw : 166 states, properties seen :0
Exhaustive walk after 531 steps, saw 166 distinct states, run finished after 2 ms. (steps per millisecond=265 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND p2 (NOT p0) (NOT p1)) (AND p0 p1)))), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p2 (NOT p0) (NOT p1)) (AND p0 p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (G (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND p0 p1) (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 10 factoid took 2883 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
[2023-03-19 23:06:54] [INFO ] Invariant cache hit.
[2023-03-19 23:06:55] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-19 23:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:06:55] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-19 23:06:55] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:55] [INFO ] [Real]Added 130 Read/Feed constraints in 8 ms returned sat
[2023-03-19 23:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:06:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 23:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:06:55] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-19 23:06:55] [INFO ] [Nat]Added 130 Read/Feed constraints in 7 ms returned sat
[2023-03-19 23:06:55] [INFO ] Computed and/alt/rep : 67/340/67 causal constraints (skipped 84 transitions) in 9 ms.
[2023-03-19 23:06:55] [INFO ] Added : 50 causal constraints over 12 iterations in 137 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 9960 reset in 491 ms.
Product exploration explored 100000 steps with 9929 reset in 450 ms.
Built C files in :
/tmp/ltsmin6599387733217405712
[2023-03-19 23:06:57] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2023-03-19 23:06:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:06:57] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2023-03-19 23:06:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:06:57] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2023-03-19 23:06:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:06:57] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6599387733217405712
Running compilation step : cd /tmp/ltsmin6599387733217405712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 421 ms.
Running link step : cd /tmp/ltsmin6599387733217405712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6599387733217405712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18264271075645187675.hoa' '--buchi-type=spotba'
LTSmin run took 230 ms.
FORMULA TokenRing-PT-005-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TokenRing-PT-005-LTLFireability-00 finished in 18834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 36 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:06:57] [INFO ] Invariant cache hit.
[2023-03-19 23:06:57] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 23:06:57] [INFO ] Invariant cache hit.
[2023-03-19 23:06:57] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:57] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-19 23:06:57] [INFO ] Invariant cache hit.
[2023-03-19 23:06:58] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 36/36 places, 156/156 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s4 1) (EQ s8 1)) (AND (EQ s10 1) (EQ s23 1)) (AND (EQ s1 1) (EQ s35 1)) (AND (EQ s5 1) (EQ s22 1)) (AND (EQ s6 1) (EQ s28 1)) (AND (EQ s15...], 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 10 steps with 0 reset in 2 ms.
FORMULA TokenRing-PT-005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-005-LTLFireability-03 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 12 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:06:58] [INFO ] Invariant cache hit.
[2023-03-19 23:06:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 23:06:58] [INFO ] Invariant cache hit.
[2023-03-19 23:06:58] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:58] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-19 23:06:58] [INFO ] Invariant cache hit.
[2023-03-19 23:06:58] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 36/36 places, 156/156 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s3 1) (EQ s27 1)) (AND (EQ s9 1) (EQ s28 1)) (AND (EQ s15 1) (EQ s30 1)) (AND (EQ s16 1) (EQ s35 1)) (AND (EQ s21 1) (EQ s31 1)) (AND (EQ ...], 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 TokenRing-PT-005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-005-LTLFireability-04 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 36 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:06:58] [INFO ] Invariant cache hit.
[2023-03-19 23:06:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 23:06:58] [INFO ] Invariant cache hit.
[2023-03-19 23:06:58] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:06:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-19 23:06:58] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 23:06:58] [INFO ] Invariant cache hit.
[2023-03-19 23:06:58] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 36/36 places, 156/156 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : TokenRing-PT-005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s4 0) (EQ s8 0)) (OR (EQ s10 0) (EQ s23 0)) (OR (EQ s1 0) (EQ s35 0)) (OR (EQ s5 0) (EQ s22 0)) (OR (EQ s6 0) (EQ s28 0)) (OR (EQ s15 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9971 reset in 396 ms.
Product exploration explored 100000 steps with 9975 reset in 372 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-19 23:06:59] [INFO ] Invariant cache hit.
[2023-03-19 23:07:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 23:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:00] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-19 23:07:00] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:00] [INFO ] [Real]Added 130 Read/Feed constraints in 8 ms returned sat
[2023-03-19 23:07:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:07:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 23:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:00] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-19 23:07:00] [INFO ] [Nat]Added 130 Read/Feed constraints in 8 ms returned sat
[2023-03-19 23:07:00] [INFO ] Computed and/alt/rep : 67/340/67 causal constraints (skipped 84 transitions) in 8 ms.
[2023-03-19 23:07:00] [INFO ] Added : 50 causal constraints over 12 iterations in 145 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:07:00] [INFO ] Invariant cache hit.
[2023-03-19 23:07:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 23:07:00] [INFO ] Invariant cache hit.
[2023-03-19 23:07:00] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:00] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 23:07:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 23:07:00] [INFO ] Invariant cache hit.
[2023-03-19 23:07:00] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 36/36 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 2327 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
[2023-03-19 23:07:03] [INFO ] Invariant cache hit.
[2023-03-19 23:07:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 23:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-19 23:07:03] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:03] [INFO ] [Real]Added 130 Read/Feed constraints in 9 ms returned sat
[2023-03-19 23:07:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:07:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-19 23:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-19 23:07:04] [INFO ] [Nat]Added 130 Read/Feed constraints in 8 ms returned sat
[2023-03-19 23:07:04] [INFO ] Computed and/alt/rep : 67/340/67 causal constraints (skipped 84 transitions) in 11 ms.
[2023-03-19 23:07:04] [INFO ] Added : 50 causal constraints over 12 iterations in 133 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9999 reset in 371 ms.
Product exploration explored 100000 steps with 9975 reset in 369 ms.
Built C files in :
/tmp/ltsmin4771718213176504986
[2023-03-19 23:07:05] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2023-03-19 23:07:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:05] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2023-03-19 23:07:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:05] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2023-03-19 23:07:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4771718213176504986
Running compilation step : cd /tmp/ltsmin4771718213176504986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 466 ms.
Running link step : cd /tmp/ltsmin4771718213176504986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4771718213176504986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7500160612459554890.hoa' '--buchi-type=spotba'
LTSmin run took 170 ms.
FORMULA TokenRing-PT-005-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TokenRing-PT-005-LTLFireability-06 finished in 7619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:07:06] [INFO ] Invariant cache hit.
[2023-03-19 23:07:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 23:07:06] [INFO ] Invariant cache hit.
[2023-03-19 23:07:06] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:06] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-19 23:07:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 23:07:06] [INFO ] Invariant cache hit.
[2023-03-19 23:07:06] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 36/36 places, 156/156 transitions.
Stuttering acceptance computed with spot in 1638 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s15 1) (EQ s30 1)) (AND (EQ s9 1) (EQ s28 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3571 reset in 93 ms.
Product exploration explored 100000 steps with 3571 reset in 88 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-19 23:07:08] [INFO ] Invariant cache hit.
[2023-03-19 23:07:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-19 23:07:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:07:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:08] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-19 23:07:08] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:08] [INFO ] [Nat]Added 130 Read/Feed constraints in 11 ms returned sat
[2023-03-19 23:07:08] [INFO ] Computed and/alt/rep : 67/340/67 causal constraints (skipped 84 transitions) in 9 ms.
[2023-03-19 23:07:08] [INFO ] Added : 25 causal constraints over 5 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:07:08] [INFO ] Invariant cache hit.
[2023-03-19 23:07:08] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 23:07:08] [INFO ] Invariant cache hit.
[2023-03-19 23:07:08] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:09] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-19 23:07:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 23:07:09] [INFO ] Invariant cache hit.
[2023-03-19 23:07:09] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 36/36 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2023-03-19 23:07:09] [INFO ] Invariant cache hit.
[2023-03-19 23:07:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:09] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-19 23:07:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:07:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-19 23:07:09] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:09] [INFO ] [Nat]Added 130 Read/Feed constraints in 9 ms returned sat
[2023-03-19 23:07:09] [INFO ] Computed and/alt/rep : 67/340/67 causal constraints (skipped 84 transitions) in 10 ms.
[2023-03-19 23:07:09] [INFO ] Added : 25 causal constraints over 5 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3570 reset in 98 ms.
Product exploration explored 100000 steps with 3564 reset in 94 ms.
Built C files in :
/tmp/ltsmin16560338775355319112
[2023-03-19 23:07:10] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2023-03-19 23:07:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:10] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2023-03-19 23:07:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:10] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2023-03-19 23:07:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16560338775355319112
Running compilation step : cd /tmp/ltsmin16560338775355319112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 475 ms.
Running link step : cd /tmp/ltsmin16560338775355319112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16560338775355319112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6307697957397557116.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA TokenRing-PT-005-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TokenRing-PT-005-LTLFireability-11 finished in 4882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X((X(p0) U (!p2&&X(p0))))||p1))))'
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:07:10] [INFO ] Invariant cache hit.
[2023-03-19 23:07:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 23:07:10] [INFO ] Invariant cache hit.
[2023-03-19 23:07:10] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:11] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-19 23:07:11] [INFO ] Invariant cache hit.
[2023-03-19 23:07:11] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 36/36 places, 156/156 transitions.
Stuttering acceptance computed with spot in 2262 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) p2), (NOT p0), true, (NOT p0)]
Running random walk in product with property : TokenRing-PT-005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=true, acceptance={} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s32 1)), p1:(OR (NEQ s12 1) (NEQ s33 1)), p2:(AND (EQ s12 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TokenRing-PT-005-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TokenRing-PT-005-LTLFireability-14 finished in 2874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:07:13] [INFO ] Invariant cache hit.
[2023-03-19 23:07:13] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 23:07:13] [INFO ] Invariant cache hit.
[2023-03-19 23:07:13] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:13] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-19 23:07:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 23:07:13] [INFO ] Invariant cache hit.
[2023-03-19 23:07:13] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 36/36 places, 156/156 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p0)]
Running random walk in product with property : TokenRing-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-19 23:07:15] [INFO ] Invariant cache hit.
[2023-03-19 23:07:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:07:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:15] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-19 23:07:15] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:15] [INFO ] [Real]Added 130 Read/Feed constraints in 8 ms returned sat
[2023-03-19 23:07:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:07:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 0 ms returned sat
[2023-03-19 23:07:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-19 23:07:15] [INFO ] [Nat]Added 130 Read/Feed constraints in 10 ms returned sat
[2023-03-19 23:07:15] [INFO ] Computed and/alt/rep : 67/340/67 causal constraints (skipped 84 transitions) in 8 ms.
[2023-03-19 23:07:15] [INFO ] Added : 25 causal constraints over 6 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-19 23:07:15] [INFO ] Invariant cache hit.
[2023-03-19 23:07:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 23:07:15] [INFO ] Invariant cache hit.
[2023-03-19 23:07:15] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:15] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-19 23:07:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 23:07:15] [INFO ] Invariant cache hit.
[2023-03-19 23:07:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 36/36 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 587 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-19 23:07:16] [INFO ] Invariant cache hit.
[2023-03-19 23:07:16] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-19 23:07:16] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-19 23:07:16] [INFO ] [Real]Added 130 Read/Feed constraints in 10 ms returned sat
[2023-03-19 23:07:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:07:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 23:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:07:16] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-19 23:07:16] [INFO ] [Nat]Added 130 Read/Feed constraints in 13 ms returned sat
[2023-03-19 23:07:16] [INFO ] Computed and/alt/rep : 67/340/67 causal constraints (skipped 84 transitions) in 9 ms.
[2023-03-19 23:07:16] [INFO ] Added : 25 causal constraints over 6 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Built C files in :
/tmp/ltsmin1172186872781073131
[2023-03-19 23:07:17] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2023-03-19 23:07:17] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:17] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2023-03-19 23:07:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:17] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2023-03-19 23:07:17] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:07:17] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1172186872781073131
Running compilation step : cd /tmp/ltsmin1172186872781073131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin1172186872781073131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1172186872781073131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16240581120296728701.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA TokenRing-PT-005-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TokenRing-PT-005-LTLFireability-15 finished in 3803 ms.
All properties solved by simple procedures.
Total runtime 42637 ms.

BK_STOP 1679267252159

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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