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.r268-smll-171654407100172.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 PermAdmissibility-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407100172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 296K Apr 12 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 09:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 12 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 590K Apr 12 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K May 18 16:43 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 PermAdmissibility-PT-05-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716700889064

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 05:21:31] [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-26 05:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:21:31] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-05-26 05:21:31] [INFO ] Transformed 168 places.
[2024-05-26 05:21:31] [INFO ] Transformed 592 transitions.
[2024-05-26 05:21:31] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 511 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA PermAdmissibility-PT-05-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 91 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 91 transition count 468
Applied a total of 90 rules in 106 ms. Remains 91 /168 variables (removed 77) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2024-05-26 05:21:32] [INFO ] Computed 16 invariants in 52 ms
[2024-05-26 05:21:33] [INFO ] Implicit Places using invariants in 477 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 549 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/168 places, 468/592 transitions.
Applied a total of 0 rules in 9 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 724 ms. Remains : 90/168 places, 468/592 transitions.
Support contains 64 out of 90 places after structural reductions.
[2024-05-26 05:21:33] [INFO ] Flatten gal took : 174 ms
[2024-05-26 05:21:33] [INFO ] Flatten gal took : 124 ms
[2024-05-26 05:21:34] [INFO ] Input system was already deterministic with 468 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40007 steps (412 resets) in 1209 ms. (33 steps per ms) remains 1/16 properties
BEST_FIRST walk for 4924 steps (1 resets) in 43 ms. (111 steps per ms) remains 0/1 properties
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((G(F(p1))||p0))))'
Support contains 39 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 90 cols
[2024-05-26 05:21:34] [INFO ] Computed 15 invariants in 7 ms
[2024-05-26 05:21:35] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-26 05:21:35] [INFO ] Invariant cache hit.
[2024-05-26 05:21:35] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-05-26 05:21:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 105 constraints, problems are : Problem set: 0 solved, 464 unsolved in 16012 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 464/569 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 569 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 47883ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 47914ms
Finished structural reductions in LTL mode , in 1 iterations and 48489 ms. Remains : 90/90 places, 468/468 transitions.
Stuttering acceptance computed with spot in 415 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 13741 reset in 1442 ms.
Product exploration explored 100000 steps with 13767 reset in 1047 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 247 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 20548 steps (211 resets) in 252 ms. (81 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 603 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-26 05:22:28] [INFO ] Invariant cache hit.
[2024-05-26 05:22:31] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 16 ms returned sat
[2024-05-26 05:22:31] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2024-05-26 05:22:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:22:33] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 37 ms returned sat
[2024-05-26 05:22:34] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-05-26 05:22:34] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 91 ms.
[2024-05-26 05:22:34] [INFO ] Added : 20 causal constraints over 5 iterations in 285 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 39 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 41 ms. Remains 86 /90 variables (removed 4) and now considering 464/468 (removed 4) transitions.
// Phase 1: matrix 464 rows 86 cols
[2024-05-26 05:22:34] [INFO ] Computed 14 invariants in 7 ms
[2024-05-26 05:22:34] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-26 05:22:34] [INFO ] Invariant cache hit.
[2024-05-26 05:22:34] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-26 05:22:34] [INFO ] Redundant transitions in 30 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-26 05:22:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 100 constraints, problems are : Problem set: 0 solved, 460 unsolved in 15786 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 460/560 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 560 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 47077ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 47083ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/90 places, 464/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47619 ms. Remains : 86/90 places, 464/468 transitions.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 382 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 12084 steps (141 resets) in 130 ms. (92 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 956 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-26 05:23:24] [INFO ] Invariant cache hit.
[2024-05-26 05:23:27] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 37 ms returned sat
[2024-05-26 05:23:27] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-05-26 05:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:23:29] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 30 ms returned sat
[2024-05-26 05:23:30] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-26 05:23:30] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 92 ms.
[2024-05-26 05:23:30] [INFO ] Added : 10 causal constraints over 2 iterations in 232 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 14670 reset in 1272 ms.
Product exploration explored 100000 steps with 14734 reset in 1147 ms.
Built C files in :
/tmp/ltsmin890231019297979045
[2024-05-26 05:23:33] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-26 05:23:33] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:23:33] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-26 05:23:33] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:23:33] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-26 05:23:33] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:23:33] [INFO ] Built C files in 181ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin890231019297979045
Running compilation step : cd /tmp/ltsmin890231019297979045;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin890231019297979045;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin890231019297979045;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 39 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 464/464 transitions.
Applied a total of 0 rules in 25 ms. Remains 86 /86 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-26 05:23:36] [INFO ] Invariant cache hit.
[2024-05-26 05:23:36] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-26 05:23:36] [INFO ] Invariant cache hit.
[2024-05-26 05:23:36] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-26 05:23:36] [INFO ] Redundant transitions in 7 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-26 05:23:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 100 constraints, problems are : Problem set: 0 solved, 460 unsolved in 15857 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 460/560 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 560 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 47272ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 47283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47968 ms. Remains : 86/86 places, 464/464 transitions.
Built C files in :
/tmp/ltsmin15811229467857705237
[2024-05-26 05:24:24] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-26 05:24:24] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:24:24] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-26 05:24:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:24:24] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-26 05:24:24] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:24:24] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15811229467857705237
Running compilation step : cd /tmp/ltsmin15811229467857705237;'/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 2362 ms.
Running link step : cd /tmp/ltsmin15811229467857705237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin15811229467857705237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2393545090689486027.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 05:24:39] [INFO ] Flatten gal took : 50 ms
[2024-05-26 05:24:39] [INFO ] Flatten gal took : 65 ms
[2024-05-26 05:24:39] [INFO ] Time to serialize gal into /tmp/LTL5308802334788059316.gal : 11 ms
[2024-05-26 05:24:39] [INFO ] Time to serialize properties into /tmp/LTL8991811823570370390.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5308802334788059316.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13186412388644171622.hoa' '-atoms' '/tmp/LTL8991811823570370390.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8991811823570370390.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13186412388644171622.hoa
Detected timeout of ITS tools.
[2024-05-26 05:24:54] [INFO ] Flatten gal took : 40 ms
[2024-05-26 05:24:54] [INFO ] Flatten gal took : 67 ms
[2024-05-26 05:24:54] [INFO ] Time to serialize gal into /tmp/LTL9718896884636849099.gal : 8 ms
[2024-05-26 05:24:54] [INFO ] Time to serialize properties into /tmp/LTL13347908995613207215.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9718896884636849099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13347908995613207215.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((((((((G(F("(((((in4_6>=1)&&(in2_2>=1))&&(c8>=1))||(((in4_7>=1)&&(in2_3>=1))&&(c8>=1)))||((((in4_7>=1)&&(in2_2>=1))&&(c8>=1))|...5856
Formula 0 simplified : XG(!"(((((((((aux12_0>=1)&&(aux10_1>=1))&&(c16>=1))||(((aux15_5>=1)&&(aux13_7>=1))&&(c17>=1)))||((((aux15_3>=1)&&(aux13_3>=1))&&(c17...5832
Detected timeout of ITS tools.
[2024-05-26 05:25:09] [INFO ] Flatten gal took : 30 ms
[2024-05-26 05:25:09] [INFO ] Applying decomposition
[2024-05-26 05:25:09] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10660933379765381487.txt' '-o' '/tmp/graph10660933379765381487.bin' '-w' '/tmp/graph10660933379765381487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10660933379765381487.bin' '-l' '-1' '-v' '-w' '/tmp/graph10660933379765381487.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:25:09] [INFO ] Decomposing Gal with order
[2024-05-26 05:25:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:25:10] [INFO ] Removed a total of 456 redundant transitions.
[2024-05-26 05:25:10] [INFO ] Flatten gal took : 164 ms
[2024-05-26 05:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 23 ms.
[2024-05-26 05:25:10] [INFO ] Time to serialize gal into /tmp/LTL11213527244806881323.gal : 10 ms
[2024-05-26 05:25:10] [INFO ] Time to serialize properties into /tmp/LTL10595050873003287250.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11213527244806881323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10595050873003287250.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(((((((((G(F("(((((i0.u1.in4_6>=1)&&(i0.u1.in2_2>=1))&&(i0.u1.c8>=1))||(((i0.u1.in4_7>=1)&&(i0.u1.in2_3>=1))&&(i0.u1.c8>=1)))||(...8040
Formula 0 simplified : XG(!"(((((((((i1.u2.aux12_0>=1)&&(i1.u2.aux10_1>=1))&&(i1.u2.c16>=1))||(((i1.u0.aux15_5>=1)&&(u3.aux13_7>=1))&&(i1.u2.c17>=1)))||(((...8016
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-05-LTLFireability-00 finished in 230442 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)||(F(G(p1))&&(p2 U p3))))'
Support contains 48 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 17 ms. Remains 86 /90 variables (removed 4) and now considering 464/468 (removed 4) transitions.
[2024-05-26 05:25:25] [INFO ] Invariant cache hit.
[2024-05-26 05:25:25] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 05:25:25] [INFO ] Invariant cache hit.
[2024-05-26 05:25:25] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-26 05:25:25] [INFO ] Redundant transitions in 3 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-26 05:25:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 100 constraints, problems are : Problem set: 0 solved, 460 unsolved in 15493 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 460/560 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 560 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 46758ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 46764ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/90 places, 464/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47204 ms. Remains : 86/90 places, 464/468 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-02 finished in 47500 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 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 6 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.2 ms
Discarding 84 places :
Also discarding 460 output transitions
Drop transitions (Output transitions of discarded places.) removed 460 transitions
Applied a total of 1 rules in 4 ms. Remains 6 /90 variables (removed 84) and now considering 8/468 (removed 460) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-26 05:26:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 05:26:12] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-26 05:26:12] [INFO ] Invariant cache hit.
[2024-05-26 05:26:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-26 05:26:12] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-26 05:26:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 80 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/90 places, 8/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 6/90 places, 8/468 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-04
Stuttering criterion allowed to conclude after 26 steps with 4 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-04 finished in 342 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((F((G(F(p1))||(!p1&&F(p1))))&&p0)))'
Support contains 14 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 22 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.3 ms
Discarding 68 places :
Also discarding 420 output transitions
Drop transitions (Output transitions of discarded places.) removed 420 transitions
Applied a total of 1 rules in 6 ms. Remains 22 /90 variables (removed 68) and now considering 48/468 (removed 420) transitions.
// Phase 1: matrix 48 rows 22 cols
[2024-05-26 05:26:13] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 05:26:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-26 05:26:13] [INFO ] Invariant cache hit.
[2024-05-26 05:26:13] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-26 05:26:13] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-26 05:26:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 48/70 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 28 constraints, problems are : Problem set: 0 solved, 44 unsolved in 904 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 48/70 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 44/72 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/70 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 72 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1319 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2261ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/90 places, 48/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2393 ms. Remains : 22/90 places, 48/468 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 7408 reset in 788 ms.
Product exploration explored 100000 steps with 7401 reset in 469 ms.
Computed a total of 22 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLFireability-07 finished in 3880 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||X(p1)))))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 77 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 77 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 48 place count 55 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 70 place count 55 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 53 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 53 transition count 98
Applied a total of 74 rules in 18 ms. Remains 53 /90 variables (removed 37) and now considering 98/468 (removed 370) transitions.
// Phase 1: matrix 98 rows 53 cols
[2024-05-26 05:26:17] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 05:26:17] [INFO ] Implicit Places using invariants in 75 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/90 places, 98/468 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 52/90 places, 98/468 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-08
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-08 finished in 305 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)))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 50 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 260 output transitions
Drop transitions (Output transitions of discarded places.) removed 260 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 38 transition count 88
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 38 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 34 transition count 60
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 34 transition count 60
Applied a total of 33 rules in 10 ms. Remains 34 /90 variables (removed 56) and now considering 60/468 (removed 408) transitions.
// Phase 1: matrix 60 rows 34 cols
[2024-05-26 05:26:17] [INFO ] Computed 10 invariants in 0 ms
[2024-05-26 05:26:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-26 05:26:17] [INFO ] Invariant cache hit.
[2024-05-26 05:26:17] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-26 05:26:17] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-26 05:26:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 60/94 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/94 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 44 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1180 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 60/94 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 56/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 100 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2244 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 3467ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3468ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 60/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3660 ms. Remains : 34/90 places, 60/468 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-09
Stuttering criterion allowed to conclude after 86 steps with 1 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-09 finished in 3807 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((!p0&&G(!p1))) U (p2 U p1)))))'
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 77 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 77 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 48 place count 55 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 70 place count 55 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 54 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 54 transition count 114
Applied a total of 72 rules in 11 ms. Remains 54 /90 variables (removed 36) and now considering 114/468 (removed 354) transitions.
// Phase 1: matrix 114 rows 54 cols
[2024-05-26 05:26:21] [INFO ] Computed 15 invariants in 3 ms
[2024-05-26 05:26:21] [INFO ] Implicit Places using invariants in 133 ms returned [4, 18, 25]
[2024-05-26 05:26:21] [INFO ] Actually due to overlaps returned [4, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 135 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/90 places, 114/468 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 52/90 places, 114/468 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-10
Product exploration explored 100000 steps with 1640 reset in 784 ms.
Product exploration explored 100000 steps with 1588 reset in 410 ms.
Computed a total of 52 stabilizing places and 114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 1103 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 31789 steps (326 resets) in 62 ms. (504 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p1) p0))), (F p0), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 2590 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 114 rows 52 cols
[2024-05-26 05:26:27] [INFO ] Computed 13 invariants in 2 ms
[2024-05-26 05:26:27] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 12 ms returned sat
[2024-05-26 05:26:27] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-26 05:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:26:27] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2024-05-26 05:26:27] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-26 05:26:27] [INFO ] Computed and/alt/rep : 22/130/22 causal constraints (skipped 88 transitions) in 13 ms.
[2024-05-26 05:26:27] [INFO ] Added : 16 causal constraints over 4 iterations in 90 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 6 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 114/114 transitions.
Graph (complete) has 247 edges and 52 vertex of which 41 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 37 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 37 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 34 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 34 transition count 64
Applied a total of 15 rules in 8 ms. Remains 34 /52 variables (removed 18) and now considering 64/114 (removed 50) transitions.
// Phase 1: matrix 64 rows 34 cols
[2024-05-26 05:26:27] [INFO ] Computed 10 invariants in 1 ms
[2024-05-26 05:26:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-26 05:26:27] [INFO ] Invariant cache hit.
[2024-05-26 05:26:27] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-26 05:26:27] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-26 05:26:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 64/98 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 44 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1533 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 64/98 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 60/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 104 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2032 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3613ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3614ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/52 places, 64/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3815 ms. Remains : 34/52 places, 64/114 transitions.
Computed a total of 34 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 455 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40008 steps (652 resets) in 76 ms. (519 steps per ms) remains 1/6 properties
BEST_FIRST walk for 1641 steps (0 resets) in 12 ms. (126 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 690 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (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 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-26 05:26:33] [INFO ] Invariant cache hit.
[2024-05-26 05:26:33] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-26 05:26:33] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-26 05:26:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:26:33] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-26 05:26:33] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-26 05:26:33] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 32 transitions) in 10 ms.
[2024-05-26 05:26:33] [INFO ] Added : 14 causal constraints over 3 iterations in 62 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 265 steps with 13 reset in 2 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-10 finished in 12925 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((p0&&F(G(p0))))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 77 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 77 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 48 place count 55 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 70 place count 55 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 52 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 52 transition count 90
Applied a total of 76 rules in 10 ms. Remains 52 /90 variables (removed 38) and now considering 90/468 (removed 378) transitions.
// Phase 1: matrix 90 rows 52 cols
[2024-05-26 05:26:34] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 05:26:34] [INFO ] Implicit Places using invariants in 115 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/90 places, 90/468 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 51/90 places, 90/468 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-12
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-12 finished in 230 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(p0))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 75 transition count 348
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 75 transition count 348
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 43 place count 55 transition count 128
Iterating global reduction 0 with 20 rules applied. Total rules applied 63 place count 55 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 54 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 54 transition count 120
Applied a total of 65 rules in 26 ms. Remains 54 /90 variables (removed 36) and now considering 120/468 (removed 348) transitions.
// Phase 1: matrix 120 rows 54 cols
[2024-05-26 05:26:34] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 05:26:34] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-26 05:26:34] [INFO ] Invariant cache hit.
[2024-05-26 05:26:34] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-26 05:26:34] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-26 05:26:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 120/174 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/174 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 68 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3533 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 120/174 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 116/184 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/174 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 184 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7615 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 11259ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 11262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/90 places, 120/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11598 ms. Remains : 54/90 places, 120/468 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-13
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-13 finished in 11661 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(p0))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 68 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 132 output transitions
Drop transitions (Output transitions of discarded places.) removed 132 transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 42 transition count 90
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 42 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 58 place count 37 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 37 transition count 58
Applied a total of 63 rules in 14 ms. Remains 37 /90 variables (removed 53) and now considering 58/468 (removed 410) transitions.
// Phase 1: matrix 58 rows 37 cols
[2024-05-26 05:26:45] [INFO ] Computed 12 invariants in 1 ms
[2024-05-26 05:26:46] [INFO ] Implicit Places using invariants in 82 ms returned [11, 20]
[2024-05-26 05:26:46] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/90 places, 58/468 transitions.
Applied a total of 0 rules in 23 ms. Remains 36 /36 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 36/90 places, 58/468 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-14
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-14 finished in 260 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((G(F(p1))||p0))))'
Found a Shortening insensitive property : PermAdmissibility-PT-05-LTLFireability-00
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 39 out of 90 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 13 ms. Remains 86 /90 variables (removed 4) and now considering 464/468 (removed 4) transitions.
// Phase 1: matrix 464 rows 86 cols
[2024-05-26 05:26:46] [INFO ] Computed 14 invariants in 5 ms
[2024-05-26 05:26:46] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-26 05:26:46] [INFO ] Invariant cache hit.
[2024-05-26 05:26:47] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-26 05:26:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 100 constraints, problems are : Problem set: 0 solved, 460 unsolved in 14474 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 460/560 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 560 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 46144ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 46153ms
Starting structural reductions in LI_LTL mode, iteration 1 : 86/90 places, 464/468 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 46840 ms. Remains : 86/90 places, 464/468 transitions.
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 13694 reset in 1552 ms.
Product exploration explored 100000 steps with 13728 reset in 1082 ms.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 20782 steps (243 resets) in 67 ms. (305 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 623 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-26 05:27:37] [INFO ] Invariant cache hit.
[2024-05-26 05:27:40] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 17 ms returned sat
[2024-05-26 05:27:40] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2024-05-26 05:27:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:27:42] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 16 ms returned sat
[2024-05-26 05:27:43] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2024-05-26 05:27:43] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 66 ms.
[2024-05-26 05:27:43] [INFO ] Added : 17 causal constraints over 4 iterations in 287 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 39 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 464/464 transitions.
Applied a total of 0 rules in 16 ms. Remains 86 /86 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-26 05:27:43] [INFO ] Invariant cache hit.
[2024-05-26 05:27:43] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-26 05:27:43] [INFO ] Invariant cache hit.
[2024-05-26 05:27:43] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-05-26 05:27:43] [INFO ] Redundant transitions in 3 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-26 05:27:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 100 constraints, problems are : Problem set: 0 solved, 460 unsolved in 14771 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 460/560 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 560 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 45812ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 45818ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46402 ms. Remains : 86/86 places, 464/464 transitions.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 282 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 11856 steps (138 resets) in 83 ms. (141 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 824 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-26 05:28:31] [INFO ] Invariant cache hit.
[2024-05-26 05:28:34] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 37 ms returned sat
[2024-05-26 05:28:34] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-05-26 05:28:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:28:36] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 19 ms returned sat
[2024-05-26 05:28:36] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-05-26 05:28:36] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 61 ms.
[2024-05-26 05:28:36] [INFO ] Added : 10 causal constraints over 2 iterations in 171 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 14837 reset in 1375 ms.
Product exploration explored 100000 steps with 14731 reset in 1158 ms.
Built C files in :
/tmp/ltsmin5730963608715715461
[2024-05-26 05:28:39] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-26 05:28:39] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:28:39] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-26 05:28:39] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:28:39] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-26 05:28:39] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:28:39] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5730963608715715461
Running compilation step : cd /tmp/ltsmin5730963608715715461;'/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 2492 ms.
Running link step : cd /tmp/ltsmin5730963608715715461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin5730963608715715461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3988900462333391748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 464/464 transitions.
Applied a total of 0 rules in 12 ms. Remains 86 /86 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-26 05:28:54] [INFO ] Invariant cache hit.
[2024-05-26 05:28:54] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-26 05:28:54] [INFO ] Invariant cache hit.
[2024-05-26 05:28:54] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-26 05:28:54] [INFO ] Redundant transitions in 3 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-26 05:28:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 100 constraints, problems are : Problem set: 0 solved, 460 unsolved in 14739 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 460/560 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 560 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 45720ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 45726ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46156 ms. Remains : 86/86 places, 464/464 transitions.
Built C files in :
/tmp/ltsmin2233681463452734130
[2024-05-26 05:29:40] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-26 05:29:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:29:40] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-26 05:29:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:29:40] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-26 05:29:40] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:29:40] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2233681463452734130
Running compilation step : cd /tmp/ltsmin2233681463452734130;'/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 2410 ms.
Running link step : cd /tmp/ltsmin2233681463452734130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin2233681463452734130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4250060715870817630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 05:29:55] [INFO ] Flatten gal took : 28 ms
[2024-05-26 05:29:55] [INFO ] Flatten gal took : 26 ms
[2024-05-26 05:29:55] [INFO ] Time to serialize gal into /tmp/LTL2083157005506284884.gal : 9 ms
[2024-05-26 05:29:55] [INFO ] Time to serialize properties into /tmp/LTL7830712968407365511.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2083157005506284884.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6670083289778583229.hoa' '-atoms' '/tmp/LTL7830712968407365511.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((((((((G(F("(((((in4_6>=1)&&(in2_2>=1))&&(c8>=1))||(((in4_7>=1)&&(in2_3>=1))&&(c8>=1)))||((((in4_7>=1)&&(in2_2>=1))&&(c8>=1))|...5856
Formula 0 simplified : XG(!"(((((((((aux12_0>=1)&&(aux10_1>=1))&&(c16>=1))||(((aux15_5>=1)&&(aux13_7>=1))&&(c17>=1)))||((((aux15_3>=1)&&(aux13_3>=1))&&(c17...5832
Detected timeout of ITS tools.
[2024-05-26 05:30:25] [INFO ] Flatten gal took : 21 ms
[2024-05-26 05:30:25] [INFO ] Applying decomposition
[2024-05-26 05:30:25] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15587762055910009015.txt' '-o' '/tmp/graph15587762055910009015.bin' '-w' '/tmp/graph15587762055910009015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15587762055910009015.bin' '-l' '-1' '-v' '-w' '/tmp/graph15587762055910009015.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:30:25] [INFO ] Decomposing Gal with order
[2024-05-26 05:30:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:30:26] [INFO ] Removed a total of 456 redundant transitions.
[2024-05-26 05:30:26] [INFO ] Flatten gal took : 84 ms
[2024-05-26 05:30:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 19 ms.
[2024-05-26 05:30:26] [INFO ] Time to serialize gal into /tmp/LTL17208874012412397318.gal : 6 ms
[2024-05-26 05:30:26] [INFO ] Time to serialize properties into /tmp/LTL15923454549511658042.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17208874012412397318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15923454549511658042.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(((((((((G(F("(((((i1.u2.in4_6>=1)&&(i1.u2.in2_2>=1))&&(i1.u2.c8>=1))||(((i1.u2.in4_7>=1)&&(i1.u2.in2_3>=1))&&(i1.u2.c8>=1)))||(...8040
Formula 0 simplified : XG(!"(((((((((i0.u1.aux12_0>=1)&&(i0.u1.aux10_1>=1))&&(i0.u1.c16>=1))||(((i0.u0.aux15_5>=1)&&(u3.aux13_7>=1))&&(i0.u1.c17>=1)))||(((...8016
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-05-LTLFireability-00 finished in 234958 ms.
[2024-05-26 05:30:41] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12850984819334135545
[2024-05-26 05:30:41] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2024-05-26 05:30:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:30:41] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2024-05-26 05:30:41] [INFO ] Applying decomposition
[2024-05-26 05:30:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:30:41] [INFO ] Flatten gal took : 22 ms
[2024-05-26 05:30:41] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2024-05-26 05:30:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:30:41] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12850984819334135545
Running compilation step : cd /tmp/ltsmin12850984819334135545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1160974746244077379.txt' '-o' '/tmp/graph1160974746244077379.bin' '-w' '/tmp/graph1160974746244077379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1160974746244077379.bin' '-l' '-1' '-v' '-w' '/tmp/graph1160974746244077379.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:30:41] [INFO ] Decomposing Gal with order
[2024-05-26 05:30:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:30:41] [INFO ] Removed a total of 253 redundant transitions.
[2024-05-26 05:30:41] [INFO ] Flatten gal took : 135 ms
[2024-05-26 05:30:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 16 ms.
[2024-05-26 05:30:41] [INFO ] Time to serialize gal into /tmp/LTLFireability1895790510100501925.gal : 8 ms
[2024-05-26 05:30:41] [INFO ] Time to serialize properties into /tmp/LTLFireability18328376641772405679.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1895790510100501925.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18328376641772405679.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((u1.aux12_6>=1)&&(u1.aux10_6>=1))&&(u1.c16>=1))||(((u1.aux12_7>=1)&&(u1.aux10_0>=1))&&(u1.c16>=1)))||((((u1.aux12_3>...7052
Formula 0 simplified : XG(!"((((((((((u1.aux12_6>=1)&&(u1.aux10_6>=1))&&(u1.c16>=1))||(((u1.aux12_7>=1)&&(u1.aux10_0>=1))&&(u1.c16>=1)))||((((u1.aux12_3>=1...7042
Compilation finished in 2606 ms.
Running link step : cd /tmp/ltsmin12850984819334135545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12850984819334135545;'/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' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: LTL layer: formula: X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.057: "X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.057: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.090: buchi has 3 states
pins2lts-mc-linux64( 1/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.092: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.167: DFS-FIFO for weak LTL, using special progress label 471
pins2lts-mc-linux64( 0/ 8), 0.167: There are 472 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.167: State length is 91, there are 472 groups
pins2lts-mc-linux64( 0/ 8), 0.167: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.167: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.167: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.167: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.185: ~11 levels ~960 states ~1592 transitions
pins2lts-mc-linux64( 3/ 8), 0.206: ~11 levels ~1920 states ~2664 transitions
pins2lts-mc-linux64( 3/ 8), 0.236: ~11 levels ~3840 states ~5312 transitions
pins2lts-mc-linux64( 3/ 8), 0.307: ~11 levels ~7680 states ~10792 transitions
pins2lts-mc-linux64( 3/ 8), 0.446: ~11 levels ~15360 states ~22328 transitions
pins2lts-mc-linux64( 3/ 8), 0.686: ~11 levels ~30720 states ~46576 transitions
pins2lts-mc-linux64( 3/ 8), 1.374: ~16 levels ~61440 states ~100944 transitions
pins2lts-mc-linux64( 3/ 8), 2.587: ~16 levels ~122880 states ~184304 transitions
pins2lts-mc-linux64( 3/ 8), 4.506: ~16 levels ~245760 states ~359728 transitions
pins2lts-mc-linux64( 3/ 8), 7.660: ~16 levels ~491520 states ~706272 transitions
pins2lts-mc-linux64( 5/ 8), 12.275: ~16 levels ~983040 states ~1242920 transitions
pins2lts-mc-linux64( 5/ 8), 20.066: ~16 levels ~1966080 states ~2530584 transitions
pins2lts-mc-linux64( 5/ 8), 35.004: ~16 levels ~3932160 states ~5156888 transitions
pins2lts-mc-linux64( 0/ 8), 66.011: ~16 levels ~7864320 states ~10772600 transitions
pins2lts-mc-linux64( 2/ 8), 127.460: ~16 levels ~15728640 states ~22199048 transitions
pins2lts-mc-linux64( 7/ 8), 249.388: ~16 levels ~31457280 states ~44243520 transitions
pins2lts-mc-linux64( 5/ 8), 494.228: ~16 levels ~62914560 states ~89153896 transitions
pins2lts-mc-linux64( 3/ 8), 967.580: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 967.662:
pins2lts-mc-linux64( 0/ 8), 967.662: mean standard work distribution: 2.0% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 967.662:
pins2lts-mc-linux64( 0/ 8), 967.662: Explored 120195664 states 178117811 transitions, fanout: 1.482
pins2lts-mc-linux64( 0/ 8), 967.662: Total exploration time 967.470 sec (967.380 sec minimum, 967.414 sec on average)
pins2lts-mc-linux64( 0/ 8), 967.662: States per second: 124237, Transitions per second: 184107
pins2lts-mc-linux64( 0/ 8), 967.662:
pins2lts-mc-linux64( 0/ 8), 967.662: Progress states detected: 991
pins2lts-mc-linux64( 0/ 8), 967.662: Redundant explorations: -0.0010
pins2lts-mc-linux64( 0/ 8), 967.662:
pins2lts-mc-linux64( 0/ 8), 967.662: Queue width: 8B, total height: 1500, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 967.662: Tree memory: 1173.0MB, 10.2 B/state, compr.: 2.8%
pins2lts-mc-linux64( 0/ 8), 967.662: Tree fill ratio (roots/leafs): 89.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 967.662: Stored 506 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 967.662: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 967.662: Est. total memory use: 1173.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12850984819334135545;'/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' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12850984819334135545;'/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' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 05:53:45] [INFO ] Flatten gal took : 21 ms
[2024-05-26 05:53:45] [INFO ] Time to serialize gal into /tmp/LTLFireability8348533161017138559.gal : 4 ms
[2024-05-26 05:53:45] [INFO ] Time to serialize properties into /tmp/LTLFireability177808309545869915.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8348533161017138559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability177808309545869915.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(...5828
Formula 0 simplified : XG(!"((((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c1...5818
ITS-tools command line returned an error code 137
[2024-05-26 06:07:25] [INFO ] Flatten gal took : 25 ms
[2024-05-26 06:07:25] [INFO ] Input system was already deterministic with 468 transitions.
[2024-05-26 06:07:25] [INFO ] Transformed 90 places.
[2024-05-26 06:07:25] [INFO ] Transformed 468 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 06:07:25] [INFO ] Time to serialize gal into /tmp/LTLFireability5153138130789638261.gal : 6 ms
[2024-05-26 06:07:25] [INFO ] Time to serialize properties into /tmp/LTLFireability9142418662953423896.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5153138130789638261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9142418662953423896.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("((((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(...5828
Formula 0 simplified : XG(!"((((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c1...5818
ITS-tools command line returned an error code 137
Total runtime 3460694 ms.

BK_STOP 1716704352541

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="PermAdmissibility-PT-05"
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 PermAdmissibility-PT-05, 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 r268-smll-171654407100172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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