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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 59K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 306K Apr 12 09:12 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 28K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 424K Apr 12 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 484K 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-01-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716689636925

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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 02:13:59] [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 02:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:14:00] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-26 02:14:00] [INFO ] Transformed 168 places.
[2024-05-26 02:14:00] [INFO ] Transformed 592 transitions.
[2024-05-26 02:14:00] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 663 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-PT-01-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 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
Applied a total of 64 rules in 79 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2024-05-26 02:14:01] [INFO ] Computed 16 invariants in 69 ms
[2024-05-26 02:14:01] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-26 02:14:01] [INFO ] Invariant cache hit.
[2024-05-26 02:14:02] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-05-26 02:14:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD590 is UNSAT
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/120 constraints. Problems are: Problem set: 64 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/696 variables, and 120 constraints, problems are : Problem set: 64 solved, 524 unsolved in 30071 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 64 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 524/644 constraints. Problems are: Problem set: 64 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 644 constraints, problems are : Problem set: 64 solved, 524 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/588 constraints, Known Traps: 0/0 constraints]
After SMT, in 62436ms problems are : Problem set: 64 solved, 524 unsolved
Search for dead transitions found 64 dead transitions in 62478ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 528/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63902 ms. Remains : 104/168 places, 528/592 transitions.
Support contains 85 out of 104 places after structural reductions.
[2024-05-26 02:15:05] [INFO ] Flatten gal took : 158 ms
[2024-05-26 02:15:05] [INFO ] Flatten gal took : 140 ms
[2024-05-26 02:15:05] [INFO ] Input system was already deterministic with 528 transitions.
Support contains 83 out of 104 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (2352 resets) in 2411 ms. (16 steps per ms) remains 4/21 properties
BEST_FIRST walk for 40004 steps (816 resets) in 1335 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (816 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (816 resets) in 302 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (816 resets) in 302 ms. (132 steps per ms) remains 4/4 properties
// Phase 1: matrix 528 rows 104 cols
[2024-05-26 02:15:07] [INFO ] Computed 16 invariants in 15 ms
Problem AtomicPropp3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/96 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/104 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 4 solved, 0 unsolved in 347 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PermAdmissibility-PT-01-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-PT-01-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA PermAdmissibility-PT-01-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 528
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((G((p0 U p1))||((p0 U p1)&&X(F(!p2))))))'
Support contains 39 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-26 02:15:08] [INFO ] Invariant cache hit.
[2024-05-26 02:15:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-26 02:15:08] [INFO ] Invariant cache hit.
[2024-05-26 02:15:09] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-26 02:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61507ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61519ms
Finished structural reductions in LTL mode , in 1 iterations and 62590 ms. Remains : 104/104 places, 528/528 transitions.
Stuttering acceptance computed with spot in 494 ms :[(NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p1) p2), p2, (AND (NOT p1) p2)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-00 finished in 63174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Graph (complete) has 975 edges and 104 vertex of which 12 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.8 ms
Discarding 92 places :
Also discarding 512 output transitions
Drop transitions (Output transitions of discarded places.) removed 512 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 10 transition count 10
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 9 transition count 10
Applied a total of 6 rules in 46 ms. Remains 9 /104 variables (removed 95) and now considering 10/528 (removed 518) transitions.
// Phase 1: matrix 10 rows 9 cols
[2024-05-26 02:16:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-26 02:16:11] [INFO ] Implicit Places using invariants in 209 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/104 places, 10/528 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 9/10 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 7/104 places, 9/528 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 464 ms.
Product exploration explored 100000 steps with 25000 reset in 401 ms.
Computed a total of 7 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 9
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 p1)), (X p0), (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLFireability-02 finished in 1364 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)))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 14 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 104 cols
[2024-05-26 02:16:12] [INFO ] Computed 16 invariants in 9 ms
[2024-05-26 02:16:13] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-26 02:16:13] [INFO ] Invariant cache hit.
[2024-05-26 02:16:14] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-26 02:16:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61563ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61577ms
Finished structural reductions in LTL mode , in 1 iterations and 63059 ms. Remains : 104/104 places, 528/528 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-03 finished in 63203 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)))'
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 10 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-26 02:17:16] [INFO ] Invariant cache hit.
[2024-05-26 02:17:16] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-26 02:17:16] [INFO ] Invariant cache hit.
[2024-05-26 02:17:18] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-26 02:17:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61337ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61344ms
Finished structural reductions in LTL mode , in 1 iterations and 63293 ms. Remains : 104/104 places, 528/528 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-05 finished in 63480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-26 02:18:19] [INFO ] Invariant cache hit.
[2024-05-26 02:18:19] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-26 02:18:19] [INFO ] Invariant cache hit.
[2024-05-26 02:18:21] [INFO ] Implicit Places using invariants and state equation in 1903 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-26 02:18:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61268ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61277ms
Finished structural reductions in LTL mode , in 1 iterations and 63404 ms. Remains : 104/104 places, 528/528 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-06
Product exploration explored 100000 steps with 16666 reset in 680 ms.
Product exploration explored 100000 steps with 16666 reset in 308 ms.
Computed a total of 104 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 528
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-26 02:19:24] [INFO ] Invariant cache hit.
[2024-05-26 02:19:25] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 16 ms returned sat
[2024-05-26 02:19:26] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2024-05-26 02:19:26] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 496 transitions) in 148 ms.
[2024-05-26 02:19:26] [INFO ] Added : 3 causal constraints over 1 iterations in 272 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-26 02:19:26] [INFO ] Invariant cache hit.
[2024-05-26 02:19:26] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-26 02:19:26] [INFO ] Invariant cache hit.
[2024-05-26 02:19:28] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-26 02:19:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61206ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61212ms
Finished structural reductions in LTL mode , in 1 iterations and 62706 ms. Remains : 104/104 places, 528/528 transitions.
Computed a total of 104 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 528
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-26 02:20:30] [INFO ] Invariant cache hit.
[2024-05-26 02:20:30] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 14 ms returned sat
[2024-05-26 02:20:31] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2024-05-26 02:20:31] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 496 transitions) in 91 ms.
[2024-05-26 02:20:31] [INFO ] Added : 3 causal constraints over 1 iterations in 231 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 424 ms.
Product exploration explored 100000 steps with 16666 reset in 419 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Graph (complete) has 975 edges and 104 vertex of which 22 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.2 ms
Discarding 82 places :
Also discarding 480 output transitions
Drop transitions (Output transitions of discarded places.) removed 480 transitions
Applied a total of 1 rules in 7 ms. Remains 22 /104 variables (removed 82) and now considering 48/528 (removed 480) transitions.
[2024-05-26 02:20:33] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 22 cols
[2024-05-26 02:20:33] [INFO ] Computed 6 invariants in 1 ms
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
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 906 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 927 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 1855ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1855ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/104 places, 48/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1870 ms. Remains : 22/104 places, 48/528 transitions.
Built C files in :
/tmp/ltsmin4894944066052997705
[2024-05-26 02:20:35] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4894944066052997705
Running compilation step : cd /tmp/ltsmin4894944066052997705;'/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 2551 ms.
Running link step : cd /tmp/ltsmin4894944066052997705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin4894944066052997705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10164949134962230954.hoa' '--buchi-type=spotba'
LTSmin run took 552 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLFireability-06 finished in 138750 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)))'
Support contains 34 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 104 cols
[2024-05-26 02:20:38] [INFO ] Computed 16 invariants in 8 ms
[2024-05-26 02:20:38] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-26 02:20:38] [INFO ] Invariant cache hit.
[2024-05-26 02:20:40] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-26 02:20:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30061 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61190ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61202ms
Finished structural reductions in LTL mode , in 1 iterations and 63068 ms. Remains : 104/104 places, 528/528 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 444 ms.
Product exploration explored 100000 steps with 50000 reset in 410 ms.
Computed a total of 104 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 528
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLFireability-07 finished in 64201 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) U X(!p1)))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-26 02:21:42] [INFO ] Invariant cache hit.
[2024-05-26 02:21:42] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-26 02:21:42] [INFO ] Invariant cache hit.
[2024-05-26 02:21:44] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-26 02:21:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61271ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61280ms
Finished structural reductions in LTL mode , in 1 iterations and 63236 ms. Remains : 104/104 places, 528/528 transitions.
Stuttering acceptance computed with spot in 255 ms :[p1, p1, p1, true, p0]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-08
Product exploration explored 100000 steps with 24919 reset in 761 ms.
Product exploration explored 100000 steps with 24934 reset in 379 ms.
Computed a total of 104 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 528
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 (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Knowledge based reduction with 8 factoid took 479 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (AND p1 p0), (AND p1 p0), p0]
RANDOM walk for 310 steps (18 resets) in 15 ms. (19 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (F p0), (F p1)]
Knowledge based reduction with 8 factoid took 696 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 162 ms :[true, (AND p1 p0), (AND p1 p0), p0]
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-26 02:22:49] [INFO ] Invariant cache hit.
[2024-05-26 02:22:49] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-26 02:22:49] [INFO ] Invariant cache hit.
[2024-05-26 02:22:51] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-26 02:22:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61043ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61049ms
Finished structural reductions in LTL mode , in 1 iterations and 63255 ms. Remains : 104/104 places, 528/528 transitions.
Computed a total of 104 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 528
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 (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (AND p1 p0), (AND p1 p0), p0]
RANDOM walk for 378 steps (22 resets) in 9 ms. (37 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 166 ms :[true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 165 ms :[true, (AND p1 p0), (AND p1 p0), p0]
Product exploration explored 100000 steps with 17202 reset in 445 ms.
Product exploration explored 100000 steps with 17540 reset in 465 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 164 ms :[true, (AND p1 p0), (AND p1 p0), p0]
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Graph (complete) has 975 edges and 104 vertex of which 6 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.4 ms
Discarding 98 places :
Also discarding 520 output transitions
Drop transitions (Output transitions of discarded places.) removed 520 transitions
Applied a total of 1 rules in 5 ms. Remains 6 /104 variables (removed 98) and now considering 8/528 (removed 520) transitions.
[2024-05-26 02:23:54] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-26 02:23:54] [INFO ] Computed 2 invariants in 1 ms
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 94 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 76 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 185ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/104 places, 8/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 6/104 places, 8/528 transitions.
Built C files in :
/tmp/ltsmin8265631412205750025
[2024-05-26 02:23:55] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8265631412205750025
Running compilation step : cd /tmp/ltsmin8265631412205750025;'/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 2061 ms.
Running link step : cd /tmp/ltsmin8265631412205750025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin8265631412205750025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased553343373816599976.hoa' '--buchi-type=spotba'
LTSmin run took 481 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLFireability-08 finished in 135150 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) U (p1||X(G(!p1))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Graph (complete) has 975 edges and 104 vertex of which 32 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.4 ms
Discarding 72 places :
Also discarding 448 output transitions
Drop transitions (Output transitions of discarded places.) removed 448 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 27 transition count 46
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 27 transition count 46
Applied a total of 11 rules in 13 ms. Remains 27 /104 variables (removed 77) and now considering 46/528 (removed 482) transitions.
// Phase 1: matrix 46 rows 27 cols
[2024-05-26 02:23:57] [INFO ] Computed 8 invariants in 1 ms
[2024-05-26 02:23:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-26 02:23:57] [INFO ] Invariant cache hit.
[2024-05-26 02:23:57] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-26 02:23:57] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-26 02:23:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 46/73 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 35 constraints, problems are : Problem set: 0 solved, 42 unsolved in 946 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 46/73 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 42/77 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 77 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1202 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 2173ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2174ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/104 places, 46/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2366 ms. Remains : 27/104 places, 46/528 transitions.
Stuttering acceptance computed with spot in 158 ms :[false, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-09
Stuttering criterion allowed to conclude after 183 steps with 54 reset in 1 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-09 finished in 2554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Graph (complete) has 975 edges and 104 vertex of which 22 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.4 ms
Discarding 82 places :
Also discarding 480 output transitions
Drop transitions (Output transitions of discarded places.) removed 480 transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 19 transition count 28
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 19 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 17 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 17 transition count 20
Applied a total of 11 rules in 10 ms. Remains 17 /104 variables (removed 87) and now considering 20/528 (removed 508) transitions.
// Phase 1: matrix 20 rows 17 cols
[2024-05-26 02:24:00] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 02:24:00] [INFO ] Implicit Places using invariants in 59 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/104 places, 20/528 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 73 ms. Remains : 15/104 places, 20/528 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-10
Product exploration explored 100000 steps with 14285 reset in 172 ms.
Product exploration explored 100000 steps with 14285 reset in 190 ms.
Computed a total of 15 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 20
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 36 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLFireability-10 finished in 584 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 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 54 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 104 cols
[2024-05-26 02:24:00] [INFO ] Computed 16 invariants in 8 ms
[2024-05-26 02:24:01] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-26 02:24:01] [INFO ] Invariant cache hit.
[2024-05-26 02:24:02] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2024-05-26 02:24:02] [INFO ] Redundant transitions in 53 ms returned []
Running 524 sub problems to find dead transitions.
[2024-05-26 02:24:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61377ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61389ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63539 ms. Remains : 104/104 places, 528/528 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-12
Product exploration explored 100000 steps with 9586 reset in 531 ms.
Product exploration explored 100000 steps with 9548 reset in 550 ms.
Computed a total of 104 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 528
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 : [p0, (X p0), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLFireability-12 finished in 64925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 528/528 transitions.
Applied a total of 0 rules in 36 ms. Remains 104 /104 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-26 02:25:05] [INFO ] Invariant cache hit.
[2024-05-26 02:25:06] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-26 02:25:06] [INFO ] Invariant cache hit.
[2024-05-26 02:25:07] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
[2024-05-26 02:25:08] [INFO ] Redundant transitions in 21 ms returned []
Running 524 sub problems to find dead transitions.
[2024-05-26 02:25:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61315ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 61325ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63619 ms. Remains : 104/104 places, 528/528 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-15
Product exploration explored 100000 steps with 5882 reset in 307 ms.
Product exploration explored 100000 steps with 5882 reset in 321 ms.
Computed a total of 104 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 528
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLFireability-15 finished in 64500 ms.
All properties solved by simple procedures.
Total runtime 730284 ms.

BK_STOP 1716690370587

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-01"
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-01, 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-171654407000156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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