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.r026-smll-171620167700460.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 BART-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167700460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 1020K Apr 12 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 356K Apr 12 21:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 21:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 377K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 386K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 1010K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 23:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.4M Apr 12 23:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 22:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.1M Apr 12 22:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 172K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.4M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-010-LTLFireability-00
FORMULA_NAME BART-PT-010-LTLFireability-01
FORMULA_NAME BART-PT-010-LTLFireability-02
FORMULA_NAME BART-PT-010-LTLFireability-03
FORMULA_NAME BART-PT-010-LTLFireability-04
FORMULA_NAME BART-PT-010-LTLFireability-05
FORMULA_NAME BART-PT-010-LTLFireability-06
FORMULA_NAME BART-PT-010-LTLFireability-07
FORMULA_NAME BART-PT-010-LTLFireability-08
FORMULA_NAME BART-PT-010-LTLFireability-09
FORMULA_NAME BART-PT-010-LTLFireability-10
FORMULA_NAME BART-PT-010-LTLFireability-11
FORMULA_NAME BART-PT-010-LTLFireability-12
FORMULA_NAME BART-PT-010-LTLFireability-13
FORMULA_NAME BART-PT-010-LTLFireability-14
FORMULA_NAME BART-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716384818046

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 13:33:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:33:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:33:41] [INFO ] Load time of PNML (sax parser for PT used): 691 ms
[2024-05-22 13:33:41] [INFO ] Transformed 1530 places.
[2024-05-22 13:33:41] [INFO ] Transformed 2020 transitions.
[2024-05-22 13:33:41] [INFO ] Found NUPN structural information;
[2024-05-22 13:33:41] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 988 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 109 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1320 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 55 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2024-05-22 13:33:42] [INFO ] Computed 10 invariants in 78 ms
[2024-05-22 13:33:43] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2024-05-22 13:33:43] [INFO ] Invariant cache hit.
[2024-05-22 13:33:45] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-22 13:33:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30159 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30059 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 61281ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 61451ms
Finished structural reductions in LTL mode , in 1 iterations and 64331 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1320 out of 1320 places after structural reductions.
[2024-05-22 13:34:47] [INFO ] Flatten gal took : 301 ms
[2024-05-22 13:34:47] [INFO ] Flatten gal took : 142 ms
[2024-05-22 13:34:48] [INFO ] Input system was already deterministic with 2020 transitions.
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 12488 steps (1 resets) in 1007 ms. (12 steps per ms) remains 0/15 properties
FORMULA BART-PT-010-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-PT-010-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 100 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 230 places :
Symmetric choice reduction at 0 with 230 rule applications. Total rules 230 place count 1090 transition count 1790
Iterating global reduction 0 with 230 rules applied. Total rules applied 460 place count 1090 transition count 1790
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 650 place count 900 transition count 1600
Iterating global reduction 0 with 190 rules applied. Total rules applied 840 place count 900 transition count 1600
Applied a total of 840 rules in 363 ms. Remains 900 /1320 variables (removed 420) and now considering 1600/2020 (removed 420) transitions.
// Phase 1: matrix 1600 rows 900 cols
[2024-05-22 13:34:49] [INFO ] Computed 10 invariants in 19 ms
[2024-05-22 13:34:49] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-22 13:34:49] [INFO ] Invariant cache hit.
[2024-05-22 13:34:50] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Running 1240 sub problems to find dead transitions.
[2024-05-22 13:34:50] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 890/2500 variables, and 0 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/900 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/2500 variables, and 0 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/900 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 0/0 constraints]
After SMT, in 60806ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 60854ms
Starting structural reductions in LTL mode, iteration 1 : 900/1320 places, 1600/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62468 ms. Remains : 900/1320 places, 1600/2020 transitions.
Stuttering acceptance computed with spot in 456 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-01
Product exploration explored 100000 steps with 1656 reset in 1290 ms.
Product exploration explored 100000 steps with 1651 reset in 951 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 245 steps (0 resets) in 18 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 467 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-22 13:35:56] [INFO ] Invariant cache hit.
[2024-05-22 13:35:58] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2024-05-22 13:36:00] [INFO ] [Real]Absence check using state equation in 1721 ms returned sat
[2024-05-22 13:36:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:36:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2024-05-22 13:36:05] [INFO ] [Nat]Absence check using state equation in 1826 ms returned sat
[2024-05-22 13:36:05] [INFO ] Computed and/alt/rep : 1240/2280/1240 causal constraints (skipped 0 transitions) in 162 ms.
Could not prove EG (NOT p0)
Support contains 100 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 900 transition count 1490
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 220 place count 790 transition count 1490
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 220 place count 790 transition count 1440
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 320 place count 740 transition count 1440
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 720 place count 540 transition count 1240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 730 place count 540 transition count 1230
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 750 place count 530 transition count 1220
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 760 place count 530 transition count 1210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 780 place count 520 transition count 1200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 790 place count 520 transition count 1190
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 810 place count 510 transition count 1180
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 820 place count 510 transition count 1170
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 840 place count 500 transition count 1160
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 860 place count 500 transition count 1140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 880 place count 490 transition count 1130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 900 place count 490 transition count 1110
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 920 place count 480 transition count 1100
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 940 place count 480 transition count 1080
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 960 place count 470 transition count 1070
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 980 place count 470 transition count 1050
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1000 place count 460 transition count 1040
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1020 place count 460 transition count 1020
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1040 place count 450 transition count 1010
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1060 place count 450 transition count 990
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1080 place count 440 transition count 980
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 1100 place count 440 transition count 960
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 1120 place count 430 transition count 950
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 1140 place count 430 transition count 930
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 1160 place count 420 transition count 920
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 14 with 20 rules applied. Total rules applied 1180 place count 420 transition count 900
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 1200 place count 410 transition count 890
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 1220 place count 410 transition count 870
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 1240 place count 400 transition count 860
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 16 with 20 rules applied. Total rules applied 1260 place count 400 transition count 840
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 17 with 20 rules applied. Total rules applied 1280 place count 390 transition count 830
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 17 with 20 rules applied. Total rules applied 1300 place count 390 transition count 810
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 18 with 20 rules applied. Total rules applied 1320 place count 380 transition count 800
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 18 with 20 rules applied. Total rules applied 1340 place count 380 transition count 780
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 1360 place count 370 transition count 770
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 19 with 20 rules applied. Total rules applied 1380 place count 370 transition count 750
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 20 with 20 rules applied. Total rules applied 1400 place count 360 transition count 740
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 20 with 20 rules applied. Total rules applied 1420 place count 360 transition count 720
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 21 with 20 rules applied. Total rules applied 1440 place count 350 transition count 710
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 21 with 20 rules applied. Total rules applied 1460 place count 350 transition count 690
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 22 with 20 rules applied. Total rules applied 1480 place count 340 transition count 680
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 22 with 20 rules applied. Total rules applied 1500 place count 340 transition count 660
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 23 with 20 rules applied. Total rules applied 1520 place count 330 transition count 650
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 23 with 20 rules applied. Total rules applied 1540 place count 330 transition count 630
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 24 with 20 rules applied. Total rules applied 1560 place count 320 transition count 620
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 24 with 20 rules applied. Total rules applied 1580 place count 320 transition count 600
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 25 with 20 rules applied. Total rules applied 1600 place count 310 transition count 590
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 25 with 10 rules applied. Total rules applied 1610 place count 310 transition count 580
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 26 with 20 rules applied. Total rules applied 1630 place count 300 transition count 570
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 1640 place count 300 transition count 560
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 27 with 20 rules applied. Total rules applied 1660 place count 290 transition count 550
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 1670 place count 290 transition count 540
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 28 with 20 rules applied. Total rules applied 1690 place count 280 transition count 530
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 28 with 20 rules applied. Total rules applied 1710 place count 280 transition count 510
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 29 with 20 rules applied. Total rules applied 1730 place count 270 transition count 500
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 29 with 20 rules applied. Total rules applied 1750 place count 270 transition count 480
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 30 with 20 rules applied. Total rules applied 1770 place count 260 transition count 470
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 30 with 20 rules applied. Total rules applied 1790 place count 260 transition count 450
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 31 with 20 rules applied. Total rules applied 1810 place count 250 transition count 440
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 31 with 20 rules applied. Total rules applied 1830 place count 250 transition count 420
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 32 with 20 rules applied. Total rules applied 1850 place count 240 transition count 410
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 32 with 10 rules applied. Total rules applied 1860 place count 240 transition count 400
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 33 with 20 rules applied. Total rules applied 1880 place count 230 transition count 390
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 33 with 10 rules applied. Total rules applied 1890 place count 230 transition count 380
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 34 with 20 rules applied. Total rules applied 1910 place count 220 transition count 370
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 34 with 20 rules applied. Total rules applied 1930 place count 220 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 35 with 20 rules applied. Total rules applied 1950 place count 210 transition count 340
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 35 with 20 rules applied. Total rules applied 1970 place count 210 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 36 with 10 rules applied. Total rules applied 1980 place count 210 transition count 310
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 36 with 10 rules applied. Total rules applied 1990 place count 210 transition count 310
Discarding 10 places :
Symmetric choice reduction at 36 with 10 rule applications. Total rules 2000 place count 200 transition count 300
Iterating global reduction 36 with 10 rules applied. Total rules applied 2010 place count 200 transition count 300
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 36 with 10 rules applied. Total rules applied 2020 place count 200 transition count 290
Applied a total of 2020 rules in 806 ms. Remains 200 /900 variables (removed 700) and now considering 290/1600 (removed 1310) transitions.
// Phase 1: matrix 290 rows 200 cols
[2024-05-22 13:36:16] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 13:36:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 13:36:16] [INFO ] Invariant cache hit.
[2024-05-22 13:36:16] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-22 13:36:16] [INFO ] Redundant transitions in 17 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-22 13:36:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 10/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 290/490 variables, 200/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/490 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 210 constraints, problems are : Problem set: 0 solved, 190 unsolved in 10475 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 10/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 290/490 variables, 200/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 190/400 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 400 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7618 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 18124ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 18127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/900 places, 290/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19193 ms. Remains : 200/900 places, 290/1600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 318 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 53 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 457 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-22 13:36:36] [INFO ] Invariant cache hit.
[2024-05-22 13:36:37] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-22 13:36:37] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2024-05-22 13:36:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:36:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-22 13:36:38] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-05-22 13:36:38] [INFO ] Computed and/alt/rep : 190/280/190 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-22 13:36:38] [INFO ] Added : 23 causal constraints over 6 iterations in 225 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8481 reset in 1313 ms.
Stack based approach found an accepted trace after 133 steps with 12 reset with depth 6 and stack size 6 in 2 ms.
FORMULA BART-PT-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-010-LTLFireability-01 finished in 111557 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 90 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1780 edges and 1320 vertex of which 410 / 1320 are part of one of the 10 SCC in 5 ms
Free SCC test removed 400 places
Ensure Unique test removed 750 transitions
Reduce isomorphic transitions removed 750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 561 place count 920 transition count 710
Reduce places removed 560 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 680 rules applied. Total rules applied 1241 place count 360 transition count 590
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 2 with 120 rules applied. Total rules applied 1361 place count 320 transition count 510
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 120 rules applied. Total rules applied 1481 place count 280 transition count 430
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 1561 place count 240 transition count 390
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 1611 place count 190 transition count 340
Iterating global reduction 5 with 50 rules applied. Total rules applied 1661 place count 190 transition count 340
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 1711 place count 190 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 1721 place count 190 transition count 280
Applied a total of 1721 rules in 48 ms. Remains 190 /1320 variables (removed 1130) and now considering 280/2020 (removed 1740) transitions.
[2024-05-22 13:36:40] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
// Phase 1: matrix 271 rows 190 cols
[2024-05-22 13:36:40] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 13:36:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 13:36:40] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
[2024-05-22 13:36:40] [INFO ] Invariant cache hit.
[2024-05-22 13:36:40] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-22 13:36:40] [INFO ] Redundant transitions in 4 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-22 13:36:40] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
[2024-05-22 13:36:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 10/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 270/460 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 0/460 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/461 variables, and 200 constraints, problems are : Problem set: 0 solved, 180 unsolved in 8876 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 10/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 270/460 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 180/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/461 variables, and 380 constraints, problems are : Problem set: 0 solved, 180 unsolved in 6916 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
After SMT, in 15835ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 15837ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/1320 places, 280/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16165 ms. Remains : 190/1320 places, 280/2020 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-03 finished in 16297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U (p0 U p1)))))'
Support contains 890 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 1230 transition count 1930
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 1230 transition count 1930
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 240 place count 1170 transition count 1870
Iterating global reduction 0 with 60 rules applied. Total rules applied 300 place count 1170 transition count 1870
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 330 place count 1140 transition count 1840
Iterating global reduction 0 with 30 rules applied. Total rules applied 360 place count 1140 transition count 1840
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 390 place count 1110 transition count 1810
Iterating global reduction 0 with 30 rules applied. Total rules applied 420 place count 1110 transition count 1810
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 450 place count 1080 transition count 1780
Iterating global reduction 0 with 30 rules applied. Total rules applied 480 place count 1080 transition count 1780
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 510 place count 1050 transition count 1750
Iterating global reduction 0 with 30 rules applied. Total rules applied 540 place count 1050 transition count 1750
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 560 place count 1030 transition count 1730
Iterating global reduction 0 with 20 rules applied. Total rules applied 580 place count 1030 transition count 1730
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 600 place count 1010 transition count 1710
Iterating global reduction 0 with 20 rules applied. Total rules applied 620 place count 1010 transition count 1710
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 630 place count 1000 transition count 1700
Iterating global reduction 0 with 10 rules applied. Total rules applied 640 place count 1000 transition count 1700
Applied a total of 640 rules in 100 ms. Remains 1000 /1320 variables (removed 320) and now considering 1700/2020 (removed 320) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2024-05-22 13:36:57] [INFO ] Computed 10 invariants in 22 ms
[2024-05-22 13:36:57] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-22 13:36:57] [INFO ] Invariant cache hit.
[2024-05-22 13:36:58] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
Running 1340 sub problems to find dead transitions.
[2024-05-22 13:36:58] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1340/1340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1340 constraints, Known Traps: 0/0 constraints]
After SMT, in 60611ms problems are : Problem set: 0 solved, 1340 unsolved
Search for dead transitions found 0 dead transitions in 60643ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1320 places, 1700/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62298 ms. Remains : 1000/1320 places, 1700/2020 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-04
Product exploration explored 100000 steps with 6 reset in 3069 ms.
Product exploration explored 100000 steps with 8 reset in 3165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 230 steps (0 resets) in 8 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 473 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-22 13:38:07] [INFO ] Invariant cache hit.
[2024-05-22 13:38:08] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-22 13:38:09] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2024-05-22 13:38:09] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 123 ms.
[2024-05-22 13:38:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:38:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-22 13:38:12] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2024-05-22 13:38:12] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 124 ms.
Could not prove EG (NOT p1)
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 13:38:25] [INFO ] Invariant cache hit.
[2024-05-22 13:38:25] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-22 13:38:25] [INFO ] Invariant cache hit.
[2024-05-22 13:38:26] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
Running 1340 sub problems to find dead transitions.
[2024-05-22 13:38:26] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1340/1340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1340 constraints, Known Traps: 0/0 constraints]
After SMT, in 60680ms problems are : Problem set: 0 solved, 1340 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Finished structural reductions in LTL mode , in 1 iterations and 62109 ms. Remains : 1000/1000 places, 1700/1700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 390 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 207 steps (0 resets) in 10 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 481 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-22 13:39:28] [INFO ] Invariant cache hit.
[2024-05-22 13:39:30] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-22 13:39:31] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2024-05-22 13:39:31] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 197 ms.
[2024-05-22 13:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:39:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-22 13:39:34] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2024-05-22 13:39:34] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 162 ms.
[2024-05-22 13:39:47] [INFO ] Added : 370 causal constraints over 74 iterations in 12540 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 19 reset in 3214 ms.
Product exploration explored 100000 steps with 0 reset in 2871 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 1700
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 10 place count 1000 transition count 1700
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 20 place count 1000 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 990 transition count 1690
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 990 transition count 1690
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 110 place count 990 transition count 1690
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 990 transition count 1680
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 180 place count 930 transition count 1620
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 240 place count 930 transition count 1620
Deduced a syphon composed of 20 places in 1 ms
Applied a total of 240 rules in 145 ms. Remains 930 /1000 variables (removed 70) and now considering 1620/1700 (removed 80) transitions.
[2024-05-22 13:39:54] [INFO ] Redundant transitions in 186 ms returned []
Running 1260 sub problems to find dead transitions.
// Phase 1: matrix 1620 rows 930 cols
[2024-05-22 13:39:54] [INFO ] Computed 10 invariants in 16 ms
Error getting values : (error "ParserException while parsing response: ((s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 920/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/930 constraints, PredecessorRefiner: 1260/1260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 920/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/930 constraints, PredecessorRefiner: 0/1260 constraints, Known Traps: 0/0 constraints]
After SMT, in 60499ms problems are : Problem set: 0 solved, 1260 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Starting structural reductions in SI_LTL mode, iteration 1 : 930/1000 places, 1620/1700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60868 ms. Remains : 930/1000 places, 1620/1700 transitions.
Built C files in :
/tmp/ltsmin895075114409636656
[2024-05-22 13:40:54] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin895075114409636656
Running compilation step : cd /tmp/ltsmin895075114409636656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin895075114409636656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin895075114409636656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Applied a total of 0 rules in 5 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2024-05-22 13:40:57] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 13:40:58] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-22 13:40:58] [INFO ] Invariant cache hit.
[2024-05-22 13:40:59] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 1340 sub problems to find dead transitions.
[2024-05-22 13:40:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1340/1340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1340 unsolved
Error getting values : (error "ParserException while parsing response: ((s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1340 constraints, Known Traps: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 1340 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Finished structural reductions in LTL mode , in 1 iterations and 61616 ms. Remains : 1000/1000 places, 1700/1700 transitions.
Built C files in :
/tmp/ltsmin11912256166917651792
[2024-05-22 13:41:59] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11912256166917651792
Running compilation step : cd /tmp/ltsmin11912256166917651792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11912256166917651792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11912256166917651792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 13:42:02] [INFO ] Flatten gal took : 82 ms
[2024-05-22 13:42:03] [INFO ] Flatten gal took : 70 ms
[2024-05-22 13:42:03] [INFO ] Time to serialize gal into /tmp/LTL11047832875146729535.gal : 38 ms
[2024-05-22 13:42:03] [INFO ] Time to serialize properties into /tmp/LTL11426585933462640403.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11047832875146729535.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8068412996710877895.hoa' '-atoms' '/tmp/LTL11426585933462640403.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11426585933462640403.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8068412996710877895.hoa
Detected timeout of ITS tools.
[2024-05-22 13:42:18] [INFO ] Flatten gal took : 82 ms
[2024-05-22 13:42:18] [INFO ] Flatten gal took : 74 ms
[2024-05-22 13:42:18] [INFO ] Time to serialize gal into /tmp/LTL10990182541532529072.gal : 14 ms
[2024-05-22 13:42:18] [INFO ] Time to serialize properties into /tmp/LTL17419277964837372006.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10990182541532529072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17419277964837372006.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(((((((((((TrainState_1_2_13==1)||(TrainState_3_2_12==1))||((TrainState_5_2_11==1)||(TrainState_3_1_40==1)))||(((TrainSta...46149
Formula 0 simplified : XF(GF!"(((((((((((TrainState_1_2_13==1)||(TrainState_3_2_12==1))||((TrainState_5_2_11==1)||(TrainState_3_1_40==1)))||(((TrainState_5...46141
Detected timeout of ITS tools.
[2024-05-22 13:42:33] [INFO ] Flatten gal took : 70 ms
[2024-05-22 13:42:33] [INFO ] Applying decomposition
[2024-05-22 13:42:33] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8515068526408428267.txt' '-o' '/tmp/graph8515068526408428267.bin' '-w' '/tmp/graph8515068526408428267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8515068526408428267.bin' '-l' '-1' '-v' '-w' '/tmp/graph8515068526408428267.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:42:34] [INFO ] Decomposing Gal with order
[2024-05-22 13:42:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:42:34] [INFO ] Removed a total of 354 redundant transitions.
[2024-05-22 13:42:34] [INFO ] Flatten gal took : 300 ms
[2024-05-22 13:42:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 25 ms.
[2024-05-22 13:42:34] [INFO ] Time to serialize gal into /tmp/LTL1069154712908046525.gal : 25 ms
[2024-05-22 13:42:34] [INFO ] Time to serialize properties into /tmp/LTL10037808284447481048.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1069154712908046525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10037808284447481048.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(((((((((((i2.u24.TrainState_1_2_13==1)||(i6.u11.TrainState_3_2_12==1))||((i0.u17.TrainState_5_2_11==1)||(i6.u279.TrainSt...60451
Formula 0 simplified : XF(GF!"(((((((((((i2.u24.TrainState_1_2_13==1)||(i6.u11.TrainState_3_2_12==1))||((i0.u17.TrainState_5_2_11==1)||(i6.u279.TrainState_...60443
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
153 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.76426,54064,1,0,50744,11662,11611,167450,2350,28398,108727
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-010-LTLFireability-04 finished in 339780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 690 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1290 transition count 1990
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1290 transition count 1990
Applied a total of 60 rules in 37 ms. Remains 1290 /1320 variables (removed 30) and now considering 1990/2020 (removed 30) transitions.
// Phase 1: matrix 1990 rows 1290 cols
[2024-05-22 13:42:36] [INFO ] Computed 10 invariants in 18 ms
[2024-05-22 13:42:36] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-22 13:42:37] [INFO ] Invariant cache hit.
[2024-05-22 13:42:38] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-22 13:42:38] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/3280 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/3280 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 0/0 constraints]
After SMT, in 60652ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 60670ms
Starting structural reductions in LTL mode, iteration 1 : 1290/1320 places, 1990/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62530 ms. Remains : 1290/1320 places, 1990/2020 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 2315 ms.
Product exploration explored 100000 steps with 50000 reset in 2087 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-06 finished in 67225 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(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||(!p1&&(X(p0) U ((p1&&X(p0))||X(G(p0))))))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1000 transition count 1700
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1000 transition count 1700
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 909 place count 731 transition count 1431
Iterating global reduction 0 with 269 rules applied. Total rules applied 1178 place count 731 transition count 1431
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1218 place count 691 transition count 1391
Iterating global reduction 0 with 40 rules applied. Total rules applied 1258 place count 691 transition count 1391
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1288 place count 661 transition count 1361
Iterating global reduction 0 with 30 rules applied. Total rules applied 1318 place count 661 transition count 1361
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1348 place count 631 transition count 1331
Iterating global reduction 0 with 30 rules applied. Total rules applied 1378 place count 631 transition count 1331
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1408 place count 601 transition count 1301
Iterating global reduction 0 with 30 rules applied. Total rules applied 1438 place count 601 transition count 1301
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1468 place count 571 transition count 1271
Iterating global reduction 0 with 30 rules applied. Total rules applied 1498 place count 571 transition count 1271
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1528 place count 541 transition count 1241
Iterating global reduction 0 with 30 rules applied. Total rules applied 1558 place count 541 transition count 1241
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1578 place count 521 transition count 1221
Iterating global reduction 0 with 20 rules applied. Total rules applied 1598 place count 521 transition count 1221
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1618 place count 501 transition count 1201
Iterating global reduction 0 with 20 rules applied. Total rules applied 1638 place count 501 transition count 1201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1648 place count 491 transition count 1191
Iterating global reduction 0 with 10 rules applied. Total rules applied 1658 place count 491 transition count 1191
Applied a total of 1658 rules in 316 ms. Remains 491 /1320 variables (removed 829) and now considering 1191/2020 (removed 829) transitions.
// Phase 1: matrix 1191 rows 491 cols
[2024-05-22 13:43:44] [INFO ] Computed 10 invariants in 10 ms
[2024-05-22 13:43:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 13:43:44] [INFO ] Invariant cache hit.
[2024-05-22 13:43:44] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 831 sub problems to find dead transitions.
[2024-05-22 13:43:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (OVERLAPS) 10/491 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/1682 variables, and 10 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 831 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (OVERLAPS) 10/491 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 3 (OVERLAPS) 1191/1682 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 831/1332 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1682/1682 variables, and 1332 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 491/1320 places, 1191/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61226 ms. Remains : 491/1320 places, 1191/2020 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Running random walk in product with property : BART-PT-010-LTLFireability-09
Product exploration explored 100000 steps with 12755 reset in 1690 ms.
Product exploration explored 100000 steps with 12726 reset in 1325 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 391 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0), (NOT p0), false]
RANDOM walk for 30236 steps (6 resets) in 2184 ms. (13 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 423 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), false]
[2024-05-22 13:44:50] [INFO ] Invariant cache hit.
[2024-05-22 13:44:51] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 607 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-09 finished in 68283 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||X((p1||F(G(p2))))))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 318 place count 1002 transition count 1702
Iterating global reduction 0 with 318 rules applied. Total rules applied 636 place count 1002 transition count 1702
Discarding 268 places :
Symmetric choice reduction at 0 with 268 rule applications. Total rules 904 place count 734 transition count 1434
Iterating global reduction 0 with 268 rules applied. Total rules applied 1172 place count 734 transition count 1434
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1211 place count 695 transition count 1395
Iterating global reduction 0 with 39 rules applied. Total rules applied 1250 place count 695 transition count 1395
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1279 place count 666 transition count 1366
Iterating global reduction 0 with 29 rules applied. Total rules applied 1308 place count 666 transition count 1366
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1336 place count 638 transition count 1338
Iterating global reduction 0 with 28 rules applied. Total rules applied 1364 place count 638 transition count 1338
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1392 place count 610 transition count 1310
Iterating global reduction 0 with 28 rules applied. Total rules applied 1420 place count 610 transition count 1310
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1448 place count 582 transition count 1282
Iterating global reduction 0 with 28 rules applied. Total rules applied 1476 place count 582 transition count 1282
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1504 place count 554 transition count 1254
Iterating global reduction 0 with 28 rules applied. Total rules applied 1532 place count 554 transition count 1254
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1550 place count 536 transition count 1236
Iterating global reduction 0 with 18 rules applied. Total rules applied 1568 place count 536 transition count 1236
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1586 place count 518 transition count 1218
Iterating global reduction 0 with 18 rules applied. Total rules applied 1604 place count 518 transition count 1218
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 1612 place count 510 transition count 1210
Iterating global reduction 0 with 8 rules applied. Total rules applied 1620 place count 510 transition count 1210
Applied a total of 1620 rules in 320 ms. Remains 510 /1320 variables (removed 810) and now considering 1210/2020 (removed 810) transitions.
// Phase 1: matrix 1210 rows 510 cols
[2024-05-22 13:44:52] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 13:44:52] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 13:44:52] [INFO ] Invariant cache hit.
[2024-05-22 13:44:53] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-22 13:44:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1720 variables, and 10 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 850/1370 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1370 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Starting structural reductions in LTL mode, iteration 1 : 510/1320 places, 1210/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61489 ms. Remains : 510/1320 places, 1210/2020 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BART-PT-010-LTLFireability-10
Product exploration explored 100000 steps with 39 reset in 380 ms.
Product exploration explored 100000 steps with 30 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 242 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 4214 steps (0 resets) in 47 ms. (87 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 339 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Applied a total of 0 rules in 20 ms. Remains 510 /510 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
[2024-05-22 13:45:56] [INFO ] Invariant cache hit.
[2024-05-22 13:45:56] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 13:45:56] [INFO ] Invariant cache hit.
[2024-05-22 13:45:56] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-22 13:45:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1720 variables, and 10 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 850/1370 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1370 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Finished structural reductions in LTL mode , in 1 iterations and 61176 ms. Remains : 510/510 places, 1210/1210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 11880 steps (1 resets) in 97 ms. (121 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 346 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 49 reset in 367 ms.
Product exploration explored 100000 steps with 10 reset in 428 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Graph (trivial) has 1200 edges and 510 vertex of which 440 / 510 are part of one of the 9 SCC in 2 ms
Free SCC test removed 431 places
Ensure Unique test removed 1042 transitions
Reduce isomorphic transitions removed 1042 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 73 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 73 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 73 transition count 161
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 73 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 72 transition count 160
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 72 transition count 160
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 38 place count 72 transition count 161
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 55 place count 72 transition count 144
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 77 place count 50 transition count 122
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 99 place count 50 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 50 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 49 transition count 119
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 49 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 49 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 49 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 48 transition count 116
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 48 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 48 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 48 transition count 114
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 47 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 47 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 47 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 117 place count 47 transition count 111
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 118 place count 46 transition count 110
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 119 place count 46 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 46 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 122 place count 46 transition count 108
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 123 place count 45 transition count 107
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 124 place count 45 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 125 place count 45 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 127 place count 45 transition count 105
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 128 place count 44 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 44 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 44 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 132 place count 44 transition count 102
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 133 place count 43 transition count 101
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 134 place count 43 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 135 place count 43 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 137 place count 43 transition count 99
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 138 place count 42 transition count 98
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 139 place count 42 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 140 place count 42 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 142 place count 42 transition count 96
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 143 place count 41 transition count 95
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 144 place count 41 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 145 place count 41 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 147 place count 41 transition count 93
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 148 place count 40 transition count 92
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 149 place count 40 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 150 place count 40 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 152 place count 40 transition count 90
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 153 place count 39 transition count 89
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 154 place count 39 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 155 place count 39 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 157 place count 39 transition count 87
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 158 place count 38 transition count 86
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 159 place count 38 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 160 place count 38 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 162 place count 38 transition count 84
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 163 place count 37 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 164 place count 37 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 165 place count 37 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 167 place count 37 transition count 81
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 168 place count 36 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 169 place count 36 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 170 place count 36 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 172 place count 36 transition count 78
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 173 place count 35 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 174 place count 35 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 175 place count 35 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 177 place count 35 transition count 75
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 178 place count 34 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 179 place count 34 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 180 place count 34 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 182 place count 34 transition count 72
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 183 place count 33 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 184 place count 33 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 185 place count 33 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 187 place count 33 transition count 69
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 188 place count 32 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 189 place count 32 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 190 place count 32 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 192 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 193 place count 31 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 194 place count 31 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 195 place count 31 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 197 place count 31 transition count 63
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 198 place count 30 transition count 62
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 199 place count 30 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 200 place count 30 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 202 place count 30 transition count 60
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 203 place count 29 transition count 59
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 204 place count 29 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 205 place count 29 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 207 place count 29 transition count 57
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 208 place count 28 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 209 place count 28 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 210 place count 28 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 212 place count 28 transition count 54
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 213 place count 27 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 214 place count 27 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 215 place count 27 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 217 place count 27 transition count 51
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 218 place count 26 transition count 50
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 219 place count 26 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 220 place count 26 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 222 place count 26 transition count 48
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 223 place count 25 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 224 place count 25 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 225 place count 25 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 227 place count 25 transition count 45
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 228 place count 24 transition count 44
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 229 place count 24 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 230 place count 24 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 232 place count 24 transition count 42
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 233 place count 23 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 234 place count 23 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 235 place count 23 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 237 place count 23 transition count 39
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 238 place count 22 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 239 place count 22 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 240 place count 22 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 242 place count 22 transition count 36
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 243 place count 21 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 244 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 245 place count 21 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 247 place count 21 transition count 33
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 248 place count 20 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 249 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 250 place count 20 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 252 place count 20 transition count 30
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 253 place count 19 transition count 29
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 254 place count 19 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 255 place count 19 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 257 place count 19 transition count 27
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 258 place count 18 transition count 26
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 259 place count 18 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 260 place count 18 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 262 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 263 place count 17 transition count 23
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 264 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 265 place count 17 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 267 place count 17 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 267 place count 17 transition count 21
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 268 place count 17 transition count 21
Discarding 4 places :
Symmetric choice reduction at 37 with 4 rule applications. Total rules 272 place count 13 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 4 rules applied. Total rules applied 276 place count 13 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 37 with 3 rules applied. Total rules applied 279 place count 13 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 2 Pre rules applied. Total rules applied 279 place count 13 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 281 place count 13 transition count 14
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 283 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 285 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 285 rules in 141 ms. Remains 11 /510 variables (removed 499) and now considering 12/1210 (removed 1198) transitions.
[2024-05-22 13:47:00] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-05-22 13:47:00] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 13:47:00] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 8 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-22 13:47:00] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem TDEAD1 is UNSAT
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/17 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 17 constraints, problems are : Problem set: 3 solved, 4 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/17 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 4/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 21 constraints, problems are : Problem set: 3 solved, 4 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 309ms problems are : Problem set: 3 solved, 4 unsolved
Search for dead transitions found 3 dead transitions in 309ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 11/510 places, 9/1210 transitions.
Graph (complete) has 8 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 8 /11 variables (removed 3) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/510 places, 9/1210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 462 ms. Remains : 8/510 places, 9/1210 transitions.
Built C files in :
/tmp/ltsmin4104444462289918425
[2024-05-22 13:47:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4104444462289918425
Running compilation step : cd /tmp/ltsmin4104444462289918425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4104444462289918425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4104444462289918425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Applied a total of 0 rules in 10 ms. Remains 510 /510 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
// Phase 1: matrix 1210 rows 510 cols
[2024-05-22 13:47:03] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 13:47:03] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 13:47:03] [INFO ] Invariant cache hit.
[2024-05-22 13:47:04] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-22 13:47:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1720 variables, and 10 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 850/1370 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1370 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
After SMT, in 60319ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in LTL mode , in 1 iterations and 61271 ms. Remains : 510/510 places, 1210/1210 transitions.
Built C files in :
/tmp/ltsmin15718283076545652983
[2024-05-22 13:48:04] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15718283076545652983
Running compilation step : cd /tmp/ltsmin15718283076545652983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15718283076545652983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15718283076545652983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 13:48:07] [INFO ] Flatten gal took : 23 ms
[2024-05-22 13:48:07] [INFO ] Flatten gal took : 26 ms
[2024-05-22 13:48:07] [INFO ] Time to serialize gal into /tmp/LTL16213389774332945070.gal : 5 ms
[2024-05-22 13:48:07] [INFO ] Time to serialize properties into /tmp/LTL4718109774204509387.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16213389774332945070.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2406099412003657530.hoa' '-atoms' '/tmp/LTL4718109774204509387.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4718109774204509387.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2406099412003657530.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
380 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.91366,84340,1,0,62,408649,34,36,13528,209565,185
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-010-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-PT-010-LTLFireability-10 finished in 200004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||X(F(p2))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1215 place count 693 transition count 1393
Iterating global reduction 0 with 39 rules applied. Total rules applied 1254 place count 693 transition count 1393
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1284 place count 663 transition count 1363
Iterating global reduction 0 with 30 rules applied. Total rules applied 1314 place count 663 transition count 1363
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1344 place count 633 transition count 1333
Iterating global reduction 0 with 30 rules applied. Total rules applied 1374 place count 633 transition count 1333
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1404 place count 603 transition count 1303
Iterating global reduction 0 with 30 rules applied. Total rules applied 1434 place count 603 transition count 1303
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1463 place count 574 transition count 1274
Iterating global reduction 0 with 29 rules applied. Total rules applied 1492 place count 574 transition count 1274
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1521 place count 545 transition count 1245
Iterating global reduction 0 with 29 rules applied. Total rules applied 1550 place count 545 transition count 1245
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1569 place count 526 transition count 1226
Iterating global reduction 0 with 19 rules applied. Total rules applied 1588 place count 526 transition count 1226
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1607 place count 507 transition count 1207
Iterating global reduction 0 with 19 rules applied. Total rules applied 1626 place count 507 transition count 1207
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 1635 place count 498 transition count 1198
Iterating global reduction 0 with 9 rules applied. Total rules applied 1644 place count 498 transition count 1198
Applied a total of 1644 rules in 210 ms. Remains 498 /1320 variables (removed 822) and now considering 1198/2020 (removed 822) transitions.
// Phase 1: matrix 1198 rows 498 cols
[2024-05-22 13:48:12] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 13:48:12] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 13:48:12] [INFO ] Invariant cache hit.
[2024-05-22 13:48:13] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 838 sub problems to find dead transitions.
[2024-05-22 13:48:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 1 (OVERLAPS) 10/498 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1696 variables, and 10 constraints, problems are : Problem set: 0 solved, 838 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 838/838 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 838 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 1 (OVERLAPS) 10/498 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 3 (OVERLAPS) 1198/1696 variables, 498/508 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 838/1346 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 1346 constraints, problems are : Problem set: 0 solved, 838 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 838/838 constraints, Known Traps: 0/0 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 838 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 498/1320 places, 1198/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61185 ms. Remains : 498/1320 places, 1198/2020 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-010-LTLFireability-11
Product exploration explored 100000 steps with 164 reset in 374 ms.
Product exploration explored 100000 steps with 143 reset in 294 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 153 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2024-05-22 13:49:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/184 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/184 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/1696 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 1/10 constraints, State Equation: 57/498 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 57/1696 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/10 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X p1)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-11 finished in 62955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2018 edges and 1320 vertex of which 1188 / 1320 are part of one of the 9 SCC in 1 ms
Free SCC test removed 1179 places
Ensure Unique test removed 1809 transitions
Reduce isomorphic transitions removed 1809 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 137 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 137 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 145 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 202 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 206 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 214 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 222 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 226 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 230 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 234 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 238 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 242 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 246 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 250 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 254 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 258 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 262 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 266 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 270 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 274 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 278 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 282 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 286 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 290 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 294 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 298 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 302 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 306 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 310 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 314 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 318 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 322 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 326 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 330 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 335 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 337 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 337 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 339 place count 2 transition count 3
Applied a total of 339 rules in 19 ms. Remains 2 /1320 variables (removed 1318) and now considering 3/2020 (removed 2017) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 13:49:15] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 13:49:15] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 13:49:15] [INFO ] Invariant cache hit.
[2024-05-22 13:49:15] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-22 13:49:15] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 13:49:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 51ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1320 places, 3/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 2/1320 places, 3/2020 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-15 finished in 163 ms.
All properties solved by simple procedures.
Total runtime 934687 ms.

BK_STOP 1716385755334

--------------------
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="BART-PT-010"
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 BART-PT-010, 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 r026-smll-171620167700460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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