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.r136-tall-171631132700444.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 itstools
Input is DiscoveryGPU-PT-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132700444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 02:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 02:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 02:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K 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 DiscoveryGPU-PT-11a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716378153133

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 11:42: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]
[2024-05-22 11:42:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:42:34] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-22 11:42:34] [INFO ] Transformed 113 places.
[2024-05-22 11:42:34] [INFO ] Transformed 155 transitions.
[2024-05-22 11:42:34] [INFO ] Found NUPN structural information;
[2024-05-22 11:42:34] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 37 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 108 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 108 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 105 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 105 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 28 place count 104 transition count 135
Applied a total of 28 rules in 45 ms. Remains 104 /113 variables (removed 9) and now considering 135/155 (removed 20) transitions.
// Phase 1: matrix 135 rows 104 cols
[2024-05-22 11:42:34] [INFO ] Computed 2 invariants in 10 ms
[2024-05-22 11:42:34] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 11:42:34] [INFO ] Invariant cache hit.
[2024-05-22 11:42:34] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 11:42:35] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-22 11:42:35] [INFO ] Invariant cache hit.
[2024-05-22 11:42:35] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/239 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 191 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3412 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/239 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 134/325 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 325 constraints, problems are : Problem set: 0 solved, 134 unsolved in 2412 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 5889ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 5909ms
Starting structural reductions in LTL mode, iteration 1 : 104/113 places, 135/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6331 ms. Remains : 104/113 places, 135/155 transitions.
Support contains 37 out of 104 places after structural reductions.
[2024-05-22 11:42:41] [INFO ] Flatten gal took : 30 ms
[2024-05-22 11:42:41] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:42:41] [INFO ] Input system was already deterministic with 135 transitions.
Support contains 35 out of 104 places (down from 37) after GAL structural reductions.
RANDOM walk for 3570 steps (28 resets) in 212 ms. (16 steps per ms) remains 0/33 properties
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 299 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0 U (p1||G(p0))))))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 9 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:42:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:42:41] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 11:42:41] [INFO ] Invariant cache hit.
[2024-05-22 11:42:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:42:41] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/104 places, 114/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 82/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 324 ms.
Product exploration explored 100000 steps with 25000 reset in 180 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Detected a total of 13/82 stabilizing places and 12/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 303 steps (0 resets) in 8 ms. (33 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 114 rows 82 cols
[2024-05-22 11:42:43] [INFO ] Computed 1 invariants in 6 ms
[2024-05-22 11:42:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 11:42:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:42:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:42:43] [INFO ] [Real]Added 56 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:42:43] [INFO ] Computed and/alt/rep : 112/190/112 causal constraints (skipped 1 transitions) in 9 ms.
[2024-05-22 11:42:43] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-22 11:42:43] [INFO ] Invariant cache hit.
[2024-05-22 11:42:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 11:42:43] [INFO ] Invariant cache hit.
[2024-05-22 11:42:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:42:43] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:42:43] [INFO ] Invariant cache hit.
[2024-05-22 11:42:43] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3877ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3879ms
Finished structural reductions in LTL mode , in 1 iterations and 4039 ms. Remains : 82/82 places, 114/114 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Detected a total of 13/82 stabilizing places and 12/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 216 steps (0 resets) in 5 ms. (36 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 11:42:48] [INFO ] Invariant cache hit.
[2024-05-22 11:42:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 11:42:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:42:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:42:48] [INFO ] [Real]Added 56 Read/Feed constraints in 4 ms returned sat
[2024-05-22 11:42:48] [INFO ] Computed and/alt/rep : 112/190/112 causal constraints (skipped 1 transitions) in 11 ms.
[2024-05-22 11:42:48] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 114/114 transitions.
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 81 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 113
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 23 place count 81 transition count 134
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 32 place count 72 transition count 116
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 72 transition count 116
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 58 place count 55 transition count 82
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 75 place count 55 transition count 82
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 83 place count 47 transition count 74
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 47 transition count 74
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 99 place count 39 transition count 58
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 107 place count 39 transition count 58
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 123 place count 23 transition count 34
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 139 place count 23 transition count 34
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 139 rules in 42 ms. Remains 23 /82 variables (removed 59) and now considering 34/114 (removed 80) transitions.
[2024-05-22 11:42:49] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-22 11:42:49] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 23 cols
[2024-05-22 11:42:49] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:42:49] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD20 is UNSAT
At refinement iteration 3 (OVERLAPS) 30/53 variables, 23/24 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 16/40 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/40 constraints. Problems are: Problem set: 9 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/54 variables, 1/41 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/41 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/41 constraints. Problems are: Problem set: 9 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 41 constraints, problems are : Problem set: 9 solved, 24 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 29/47 variables, 18/19 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 15/34 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 24/58 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/58 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 4/51 variables, 4/62 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/62 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 2/53 variables, 2/64 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 1/54 variables, 1/65 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 9 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 9 solved, 24 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 24/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 9 solved, 24 unsolved
Search for dead transitions found 9 dead transitions in 578ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 23/82 places, 25/114 transitions.
Graph (complete) has 53 edges and 23 vertex of which 18 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 18 /23 variables (removed 5) and now considering 25/25 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/82 places, 25/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 636 ms. Remains : 18/82 places, 25/114 transitions.
Built C files in :
/tmp/ltsmin11789272875231279436
[2024-05-22 11:42:50] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11789272875231279436
Running compilation step : cd /tmp/ltsmin11789272875231279436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 337 ms.
Running link step : cd /tmp/ltsmin11789272875231279436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11789272875231279436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15333815149098748479.hoa' '--buchi-type=spotba'
LTSmin run took 78 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-00 finished in 8869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||(F(p1) U p2)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 11 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:42:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:42:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:42:50] [INFO ] Invariant cache hit.
[2024-05-22 11:42:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:42:50] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:42:50] [INFO ] Invariant cache hit.
[2024-05-22 11:42:50] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 163 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 113/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 276 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 4035ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 4038ms
Starting structural reductions in LTL mode, iteration 1 : 83/104 places, 114/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4180 ms. Remains : 83/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-01
Product exploration explored 100000 steps with 40012 reset in 169 ms.
Product exploration explored 100000 steps with 39946 reset in 151 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 262 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-01 finished in 4775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(p1)))&&(!p2 U (p3||G(!p2)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 92 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 89 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 89 transition count 120
Applied a total of 30 rules in 12 ms. Remains 89 /104 variables (removed 15) and now considering 120/135 (removed 15) transitions.
// Phase 1: matrix 120 rows 89 cols
[2024-05-22 11:42:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:42:55] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 11:42:55] [INFO ] Invariant cache hit.
[2024-05-22 11:42:55] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-22 11:42:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/104 places, 120/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 88/104 places, 120/135 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), true, (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-02
Product exploration explored 100000 steps with 2006 reset in 135 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-02 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 5 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:42:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:42:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:42:55] [INFO ] Invariant cache hit.
[2024-05-22 11:42:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:42:56] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/104 places, 114/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 82/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Product exploration explored 100000 steps with 25000 reset in 165 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 128 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 82 cols
[2024-05-22 11:42:57] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:42:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 11:42:57] [INFO ] Invariant cache hit.
[2024-05-22 11:42:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:42:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:42:57] [INFO ] Invariant cache hit.
[2024-05-22 11:42:57] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3848ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3849ms
Finished structural reductions in LTL mode , in 1 iterations and 3962 ms. Remains : 82/82 places, 114/114 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 215 steps (0 resets) in 5 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Product exploration explored 100000 steps with 25000 reset in 123 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 114/114 transitions.
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 81 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 113
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 23 place count 81 transition count 134
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 33 place count 71 transition count 114
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 43 place count 71 transition count 114
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 63 place count 51 transition count 74
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 83 place count 51 transition count 74
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 92 place count 42 transition count 65
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 101 place count 42 transition count 65
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 110 place count 33 transition count 47
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 119 place count 33 transition count 47
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 137 place count 15 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 155 place count 15 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 155 rules in 24 ms. Remains 15 /82 variables (removed 67) and now considering 20/114 (removed 94) transitions.
[2024-05-22 11:43:02] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 11:43:02] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2024-05-22 11:43:02] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:43:02] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 10/26 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/26 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/27 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 27 constraints, problems are : Problem set: 5 solved, 14 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 12/13 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 9/22 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 14/36 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/36 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/31 variables, 2/38 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/38 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/33 variables, 2/40 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/40 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/34 variables, 1/41 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 0/41 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/34 variables, 0/41 constraints. Problems are: Problem set: 5 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 41 constraints, problems are : Problem set: 5 solved, 14 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 14/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 5 solved, 14 unsolved
Search for dead transitions found 5 dead transitions in 357ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/82 places, 15/114 transitions.
Graph (complete) has 32 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 12 /15 variables (removed 3) and now considering 15/15 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/82 places, 15/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 398 ms. Remains : 12/82 places, 15/114 transitions.
Built C files in :
/tmp/ltsmin7374880274807834978
[2024-05-22 11:43:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7374880274807834978
Running compilation step : cd /tmp/ltsmin7374880274807834978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 216 ms.
Running link step : cd /tmp/ltsmin7374880274807834978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7374880274807834978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11426178947818890415.hoa' '--buchi-type=spotba'
LTSmin run took 369 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-03 finished in 7601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1))&&F(p2))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Graph (complete) has 299 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 98 transition count 121
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 90 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 26 place count 81 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 35 place count 81 transition count 112
Applied a total of 35 rules in 11 ms. Remains 81 /104 variables (removed 23) and now considering 112/135 (removed 23) transitions.
// Phase 1: matrix 112 rows 81 cols
[2024-05-22 11:43:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:43:03] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:43:03] [INFO ] Invariant cache hit.
[2024-05-22 11:43:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:43:03] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-22 11:43:03] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-22 11:43:03] [INFO ] Invariant cache hit.
[2024-05-22 11:43:03] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 112/193 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 78/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 161 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 112/193 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 78/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 111/272 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 272 constraints, problems are : Problem set: 0 solved, 111 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 3808ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 3810ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/104 places, 112/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3965 ms. Remains : 81/104 places, 112/135 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-04
Stuttering criterion allowed to conclude after 294 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-04 finished in 4185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(F(G(!p1)) U p2)&&X(p0)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 85 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 85 transition count 116
Applied a total of 38 rules in 6 ms. Remains 85 /104 variables (removed 19) and now considering 116/135 (removed 19) transitions.
// Phase 1: matrix 116 rows 85 cols
[2024-05-22 11:43:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:43:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 11:43:07] [INFO ] Invariant cache hit.
[2024-05-22 11:43:07] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:43:07] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-22 11:43:07] [INFO ] Invariant cache hit.
[2024-05-22 11:43:07] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/201 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 166 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2342 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/201 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 115/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 281 constraints, problems are : Problem set: 0 solved, 115 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 4113ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 4114ms
Starting structural reductions in LTL mode, iteration 1 : 85/104 places, 116/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4243 ms. Remains : 85/104 places, 116/135 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (NOT p2), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-05
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-05 finished in 4579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U p1)&&X(X(p2))))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 5 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:43:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:43:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:43:12] [INFO ] Invariant cache hit.
[2024-05-22 11:43:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:43:12] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/104 places, 114/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 82/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-06
Stuttering criterion allowed to conclude after 61317 steps with 1811 reset in 89 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-06 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 89 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 89 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 84 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 84 transition count 115
Applied a total of 40 rules in 4 ms. Remains 84 /104 variables (removed 20) and now considering 115/135 (removed 20) transitions.
// Phase 1: matrix 115 rows 84 cols
[2024-05-22 11:43:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:43:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 11:43:12] [INFO ] Invariant cache hit.
[2024-05-22 11:43:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:43:12] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/104 places, 115/135 transitions.
Applied a total of 0 rules in 0 ms. Remains 83 /83 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 83/104 places, 115/135 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 227 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-07 finished in 629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p0||F(G(p0))))||(p1 U p2)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 85 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 85 transition count 116
Applied a total of 38 rules in 7 ms. Remains 85 /104 variables (removed 19) and now considering 116/135 (removed 19) transitions.
// Phase 1: matrix 116 rows 85 cols
[2024-05-22 11:43:13] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:43:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 11:43:13] [INFO ] Invariant cache hit.
[2024-05-22 11:43:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:43:13] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-22 11:43:13] [INFO ] Invariant cache hit.
[2024-05-22 11:43:13] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/201 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 166 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/201 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 115/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 281 constraints, problems are : Problem set: 0 solved, 115 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 4142ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 4143ms
Starting structural reductions in LTL mode, iteration 1 : 85/104 places, 116/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4283 ms. Remains : 85/104 places, 116/135 transitions.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-08
Stuttering criterion allowed to conclude after 454 steps with 5 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-08 finished in 4603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 2 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:43:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:43:18] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 11:43:18] [INFO ] Invariant cache hit.
[2024-05-22 11:43:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:43:18] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/104 places, 114/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 82/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-09 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(X(G(p2))&&p1))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 86 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 86 transition count 117
Applied a total of 36 rules in 4 ms. Remains 86 /104 variables (removed 18) and now considering 117/135 (removed 18) transitions.
// Phase 1: matrix 117 rows 86 cols
[2024-05-22 11:43:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:43:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 11:43:18] [INFO ] Invariant cache hit.
[2024-05-22 11:43:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:43:18] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/104 places, 117/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 85/104 places, 117/135 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-10 finished in 284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 86 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 86 transition count 117
Applied a total of 36 rules in 3 ms. Remains 86 /104 variables (removed 18) and now considering 117/135 (removed 18) transitions.
// Phase 1: matrix 117 rows 86 cols
[2024-05-22 11:43:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:43:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 11:43:18] [INFO ] Invariant cache hit.
[2024-05-22 11:43:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:43:18] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/104 places, 117/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 85/104 places, 117/135 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-11 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Graph (complete) has 299 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 109 edges and 95 vertex of which 78 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Graph (trivial) has 86 edges and 78 vertex of which 42 / 78 are part of one of the 21 SCC in 6 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 57 transition count 100
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 48 place count 46 transition count 79
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 56 place count 38 transition count 63
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 38 transition count 63
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 30 transition count 47
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 30 transition count 47
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 22 transition count 31
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 22 transition count 31
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 104 place count 14 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 14 transition count 23
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 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 11 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 11 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 8 transition count 16
Applied a total of 122 rules in 21 ms. Remains 8 /104 variables (removed 96) and now considering 16/135 (removed 119) transitions.
[2024-05-22 11:43:18] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 8 cols
[2024-05-22 11:43:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:43:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 11:43:19] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 11:43:19] [INFO ] Invariant cache hit.
[2024-05-22 11:43:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-22 11:43:19] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 11:43:19] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 11:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/19 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 47 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 43 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/104 places, 16/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 8/104 places, 16/135 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-12 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 87 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 87 transition count 118
Applied a total of 34 rules in 3 ms. Remains 87 /104 variables (removed 17) and now considering 118/135 (removed 17) transitions.
// Phase 1: matrix 118 rows 87 cols
[2024-05-22 11:43:19] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:43:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 11:43:19] [INFO ] Invariant cache hit.
[2024-05-22 11:43:19] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:43:19] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 157 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/104 places, 118/135 transitions.
Applied a total of 0 rules in 0 ms. Remains 86 /86 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 86/104 places, 118/135 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-13 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Graph (complete) has 299 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 109 edges and 95 vertex of which 77 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 86 edges and 77 vertex of which 44 / 77 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 55 transition count 100
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 47 place count 45 transition count 78
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 35 transition count 58
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 35 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 26 transition count 40
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 26 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 17 transition count 22
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 17 transition count 22
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 112 place count 8 transition count 13
Iterating global reduction 2 with 9 rules applied. Total rules applied 121 place count 8 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 123 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 5 transition count 8
Applied a total of 127 rules in 12 ms. Remains 5 /104 variables (removed 99) and now considering 8/135 (removed 127) transitions.
[2024-05-22 11:43:19] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2024-05-22 11:43:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:43:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 11:43:19] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 11:43:19] [INFO ] Invariant cache hit.
[2024-05-22 11:43:19] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-22 11:43:19] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-22 11:43:19] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 11:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 29 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/104 places, 8/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 5/104 places, 8/135 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-14
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-14 finished in 172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 84 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 84 transition count 115
Applied a total of 40 rules in 3 ms. Remains 84 /104 variables (removed 20) and now considering 115/135 (removed 20) transitions.
// Phase 1: matrix 115 rows 84 cols
[2024-05-22 11:43:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:43:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 11:43:19] [INFO ] Invariant cache hit.
[2024-05-22 11:43:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:43:19] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/104 places, 115/135 transitions.
Applied a total of 0 rules in 0 ms. Remains 83 /83 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 83/104 places, 115/135 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-15
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-15 finished in 295 ms.
All properties solved by simple procedures.
Total runtime 45709 ms.

BK_STOP 1716378200041

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="DiscoveryGPU-PT-11a"
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-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-11a, 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 r136-tall-171631132700444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a 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 ;