Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 123M
-rw-r--r-- 1 mcc users 3.1M Feb 26 07:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 11M Feb 26 07:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Feb 26 05:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 9.7M Feb 26 05:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.7M Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.5M Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.3M Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6M Feb 26 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23M Feb 26 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2M Feb 26 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31M Feb 26 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 172K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 346K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:22 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-060-LTLFireability-00
FORMULA_NAME BART-PT-060-LTLFireability-01
FORMULA_NAME BART-PT-060-LTLFireability-02
FORMULA_NAME BART-PT-060-LTLFireability-03
FORMULA_NAME BART-PT-060-LTLFireability-04
FORMULA_NAME BART-PT-060-LTLFireability-05
FORMULA_NAME BART-PT-060-LTLFireability-06
FORMULA_NAME BART-PT-060-LTLFireability-07
FORMULA_NAME BART-PT-060-LTLFireability-08
FORMULA_NAME BART-PT-060-LTLFireability-09
FORMULA_NAME BART-PT-060-LTLFireability-10
FORMULA_NAME BART-PT-060-LTLFireability-11
FORMULA_NAME BART-PT-060-LTLFireability-12
FORMULA_NAME BART-PT-060-LTLFireability-13
FORMULA_NAME BART-PT-060-LTLFireability-14
FORMULA_NAME BART-PT-060-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678527555185

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-060
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 09:39:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 09:39:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:39:18] [INFO ] Load time of PNML (sax parser for PT used): 836 ms
[2023-03-11 09:39:19] [INFO ] Transformed 8130 places.
[2023-03-11 09:39:19] [INFO ] Transformed 12120 transitions.
[2023-03-11 09:39:19] [INFO ] Found NUPN structural information;
[2023-03-11 09:39:19] [INFO ] Parsed PT model containing 8130 places and 12120 transitions and 97200 arcs in 1048 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 153 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-060-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7920 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 73 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
// Phase 1: matrix 12120 rows 7920 cols
[2023-03-11 09:39:20] [INFO ] Computed 60 place invariants in 191 ms
[2023-03-11 09:39:22] [INFO ] Implicit Places using invariants in 1817 ms returned []
Implicit Place search using SMT only with invariants took 1868 ms to find 0 implicit places.
[2023-03-11 09:39:22] [INFO ] Invariant cache hit.
[2023-03-11 09:39:23] [INFO ] Dead Transitions using invariants and state equation in 1250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3196 ms. Remains : 7920/7920 places, 12120/12120 transitions.
Support contains 7920 out of 7920 places after structural reductions.
[2023-03-11 09:39:24] [INFO ] Flatten gal took : 662 ms
[2023-03-11 09:39:26] [INFO ] Flatten gal took : 535 ms
[2023-03-11 09:39:27] [INFO ] Input system was already deterministic with 12120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 09:39:28] [INFO ] Invariant cache hit.
[2023-03-11 09:39:30] [INFO ] [Real]Absence check using 60 positive place invariants in 280 ms returned sat
[2023-03-11 09:39:43] [INFO ] After 12858ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 09:39:45] [INFO ] After 14801ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1018 ms.
[2023-03-11 09:39:46] [INFO ] After 18169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-11 09:39:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 109 ms returned sat
[2023-03-11 09:40:00] [INFO ] After 11479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 09:40:02] [INFO ] After 13417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 836 ms.
[2023-03-11 09:40:03] [INFO ] After 16641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 431 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 59 ms.
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((F(p2)&&p1)||p0))))'
Support contains 5880 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 189 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
[2023-03-11 09:40:04] [INFO ] Invariant cache hit.
[2023-03-11 09:40:05] [INFO ] Implicit Places using invariants in 1324 ms returned []
Implicit Place search using SMT only with invariants took 1327 ms to find 0 implicit places.
[2023-03-11 09:40:05] [INFO ] Invariant cache hit.
[2023-03-11 09:40:06] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2772 ms. Remains : 7920/7920 places, 12120/12120 transitions.
Stuttering acceptance computed with spot in 532 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s3876 0) (EQ s4244 0) (EQ s7630 0) (EQ s2583 0) (EQ s6052 0) (EQ s1833 0) (EQ s7217 0) (EQ s1649 0) (EQ s1884 0) (EQ s4810 0) (EQ s4759 0)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 75180 steps with 37590 reset in 10001 ms.
Product exploration timeout after 77210 steps with 38605 reset in 10001 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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-060-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-060-LTLFireability-02 finished in 23931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p1&&(!p2 U G(p2))))||p0))))'
Support contains 5880 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 153 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
[2023-03-11 09:40:28] [INFO ] Invariant cache hit.
[2023-03-11 09:40:29] [INFO ] Implicit Places using invariants in 1248 ms returned []
Implicit Place search using SMT only with invariants took 1249 ms to find 0 implicit places.
[2023-03-11 09:40:29] [INFO ] Invariant cache hit.
[2023-03-11 09:40:30] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2767 ms. Remains : 7920/7920 places, 12120/12120 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BART-PT-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(OR (EQ s5 1) (EQ s53 1) (EQ s43 1) (EQ s19 1) (EQ s29 1) (EQ s8 1) (EQ s40 1) (EQ s6 1) (EQ s4 1) (EQ s7 1) (EQ s30 1) (EQ s18 1) (EQ s44 1) (EQ s39 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 63770 steps with 677 reset in 10001 ms.
Product exploration timeout after 65930 steps with 690 reset in 10002 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) (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2)))]
Knowledge based reduction with 3 factoid took 580 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1531 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:40:54] [INFO ] Invariant cache hit.
[2023-03-11 09:40:58] [INFO ] [Real]Absence check using 60 positive place invariants in 116 ms returned sat
[2023-03-11 09:41:10] [INFO ] After 11770ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 09:41:11] [INFO ] After 12810ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 487 ms.
[2023-03-11 09:41:12] [INFO ] After 15412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 551 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 40 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 560 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2023-03-11 09:42:28] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5880 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 572 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
[2023-03-11 09:42:43] [INFO ] Invariant cache hit.
[2023-03-11 09:42:45] [INFO ] Implicit Places using invariants in 1414 ms returned []
Implicit Place search using SMT only with invariants took 1427 ms to find 0 implicit places.
[2023-03-11 09:42:45] [INFO ] Invariant cache hit.
[2023-03-11 09:42:46] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3402 ms. Remains : 7920/7920 places, 12120/12120 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) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1))]
False Knowledge obtained : [(X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 610 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1513 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:42:51] [INFO ] Invariant cache hit.
[2023-03-11 09:43:02] [INFO ] [Real]Absence check using 60 positive place invariants in 134 ms returned sat
[2023-03-11 09:43:21] [INFO ] After 18339ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 09:43:22] [INFO ] After 19493ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 603 ms.
[2023-03-11 09:43:23] [INFO ] After 22360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 551 steps, including 0 resets, run visited all 1 properties in 49 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 56 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1))]
False Knowledge obtained : [(X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 977 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2023-03-11 09:44:52] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 698 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1054 reset in 9440 ms.
Product exploration explored 100000 steps with 1052 reset in 9810 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 431 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 5880 out of 7920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Performed 540 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 7920 transition count 12120
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 540 place count 7920 transition count 12120
Deduced a syphon composed of 600 places in 7 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 600 place count 7920 transition count 12120
Performed 840 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1440 places in 4 ms
Iterating global reduction 1 with 840 rules applied. Total rules applied 1440 place count 7920 transition count 12120
Discarding 840 places :
Symmetric choice reduction at 1 with 840 rule applications. Total rules 2280 place count 7080 transition count 11280
Deduced a syphon composed of 600 places in 7 ms
Iterating global reduction 1 with 840 rules applied. Total rules applied 3120 place count 7080 transition count 11280
Deduced a syphon composed of 600 places in 8 ms
Applied a total of 3120 rules in 2322 ms. Remains 7080 /7920 variables (removed 840) and now considering 11280/12120 (removed 840) transitions.
// Phase 1: matrix 11280 rows 7080 cols
[2023-03-11 09:45:30] [INFO ] Computed 60 place invariants in 57 ms
[2023-03-11 09:45:44] [INFO ] Dead Transitions using invariants and state equation in 13308 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7080/7920 places, 11280/12120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15636 ms. Remains : 7080/7920 places, 11280/12120 transitions.
Built C files in :
/tmp/ltsmin6338574630164137222
[2023-03-11 09:45:44] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6338574630164137222
Running compilation step : cd /tmp/ltsmin6338574630164137222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin6338574630164137222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6338574630164137222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5880 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 142 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
// Phase 1: matrix 12120 rows 7920 cols
[2023-03-11 09:45:47] [INFO ] Computed 60 place invariants in 47 ms
[2023-03-11 09:45:49] [INFO ] Implicit Places using invariants in 2077 ms returned []
Implicit Place search using SMT only with invariants took 2078 ms to find 0 implicit places.
[2023-03-11 09:45:50] [INFO ] Invariant cache hit.
[2023-03-11 09:45:52] [INFO ] Dead Transitions using invariants and state equation in 2065 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4300 ms. Remains : 7920/7920 places, 12120/12120 transitions.
Built C files in :
/tmp/ltsmin7812930129454994557
[2023-03-11 09:45:52] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7812930129454994557
Running compilation step : cd /tmp/ltsmin7812930129454994557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7812930129454994557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7812930129454994557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 09:45:56] [INFO ] Flatten gal took : 313 ms
[2023-03-11 09:45:56] [INFO ] Flatten gal took : 321 ms
[2023-03-11 09:45:56] [INFO ] Time to serialize gal into /tmp/LTL5908164563926062381.gal : 92 ms
[2023-03-11 09:45:57] [INFO ] Time to serialize properties into /tmp/LTL2940842744157705193.prop : 34 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5908164563926062381.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15784859938325146595.hoa' '-atoms' '/tmp/LTL2940842744157705193.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2940842744157705193.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15784859938325146595.hoa
Detected timeout of ITS tools.
[2023-03-11 09:46:12] [INFO ] Flatten gal took : 256 ms
[2023-03-11 09:46:13] [INFO ] Flatten gal took : 275 ms
[2023-03-11 09:46:13] [INFO ] Time to serialize gal into /tmp/LTL13010908350914851696.gal : 35 ms
[2023-03-11 09:46:13] [INFO ] Time to serialize properties into /tmp/LTL15775053445872474830.ltl : 66 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13010908350914851696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15775053445872474830.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((TrainState_5_4_13==1)||(TrainState_48_4_13==1))||((TrainState_51_2_4==1)||(TrainState_56_3_7==1)))||(((TrainState_5...353101
Formula 0 simplified : XG(!"((((((((((TrainState_5_4_13==1)||(TrainState_48_4_13==1))||((TrainState_51_2_4==1)||(TrainState_56_3_7==1)))||(((TrainState_5_4...353082
Detected timeout of ITS tools.
[2023-03-11 09:46:28] [INFO ] Flatten gal took : 378 ms
[2023-03-11 09:46:28] [INFO ] Applying decomposition
[2023-03-11 09:46:29] [INFO ] Flatten gal took : 340 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph992345729417363103.txt' '-o' '/tmp/graph992345729417363103.bin' '-w' '/tmp/graph992345729417363103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph992345729417363103.bin' '-l' '-1' '-v' '-w' '/tmp/graph992345729417363103.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:46:30] [INFO ] Decomposing Gal with order
[2023-03-11 09:46:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:46:34] [INFO ] Removed a total of 996 redundant transitions.
[2023-03-11 09:46:35] [INFO ] Flatten gal took : 907 ms
[2023-03-11 09:46:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 66 ms.
[2023-03-11 09:46:48] [INFO ] Time to serialize gal into /tmp/LTL17060922370042475566.gal : 95 ms
[2023-03-11 09:46:48] [INFO ] Time to serialize properties into /tmp/LTL13650037992902054052.ltl : 38 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17060922370042475566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13650037992902054052.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((i13.i2.u634.TrainState_5_4_13==1)||(i33.i0.u913.TrainState_48_4_13==1))||((i30.i0.u62.TrainState_51_2_4==1)||(i31.i...516557
Formula 0 simplified : XG(!"((((((((((i13.i2.u634.TrainState_5_4_13==1)||(i33.i0.u913.TrainState_48_4_13==1))||((i30.i0.u62.TrainState_51_2_4==1)||(i31.i4....516538
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5828633914744767040
[2023-03-11 09:47:03] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5828633914744767040
Running compilation step : cd /tmp/ltsmin5828633914744767040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin5828633914744767040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5828633914744767040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BART-PT-060-LTLFireability-03 finished in 399999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 60 out of 7920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Drop transitions removed 3840 transitions
Trivial Post-agglo rules discarded 3840 transitions
Performed 3840 trivial Post agglomeration. Transition count delta: 3840
Iterating post reduction 0 with 3840 rules applied. Total rules applied 3840 place count 7920 transition count 8280
Reduce places removed 3840 places and 0 transitions.
Iterating post reduction 1 with 3840 rules applied. Total rules applied 7680 place count 4080 transition count 8280
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 7680 place count 4080 transition count 7980
Deduced a syphon composed of 300 places in 1 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 8280 place count 3780 transition count 7980
Discarding 360 places :
Symmetric choice reduction at 2 with 360 rule applications. Total rules 8640 place count 3420 transition count 7620
Iterating global reduction 2 with 360 rules applied. Total rules applied 9000 place count 3420 transition count 7620
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 9060 place count 3420 transition count 7560
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 9300 place count 3180 transition count 7320
Iterating global reduction 3 with 240 rules applied. Total rules applied 9540 place count 3180 transition count 7320
Discarding 180 places :
Symmetric choice reduction at 3 with 180 rule applications. Total rules 9720 place count 3000 transition count 7140
Iterating global reduction 3 with 180 rules applied. Total rules applied 9900 place count 3000 transition count 7140
Discarding 180 places :
Symmetric choice reduction at 3 with 180 rule applications. Total rules 10080 place count 2820 transition count 6960
Iterating global reduction 3 with 180 rules applied. Total rules applied 10260 place count 2820 transition count 6960
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 10380 place count 2700 transition count 6840
Iterating global reduction 3 with 120 rules applied. Total rules applied 10500 place count 2700 transition count 6840
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 10620 place count 2580 transition count 6720
Iterating global reduction 3 with 120 rules applied. Total rules applied 10740 place count 2580 transition count 6720
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 10800 place count 2520 transition count 6660
Iterating global reduction 3 with 60 rules applied. Total rules applied 10860 place count 2520 transition count 6660
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 420
Deduced a syphon composed of 420 places in 1 ms
Reduce places removed 420 places and 0 transitions.
Iterating global reduction 3 with 840 rules applied. Total rules applied 11700 place count 2100 transition count 6240
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 3 with 240 rules applied. Total rules applied 11940 place count 2100 transition count 6000
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 12180 place count 1980 transition count 5880
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 4 with 240 rules applied. Total rules applied 12420 place count 1980 transition count 5640
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 5 with 240 rules applied. Total rules applied 12660 place count 1860 transition count 5520
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 5 with 240 rules applied. Total rules applied 12900 place count 1860 transition count 5280
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 2 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 6 with 240 rules applied. Total rules applied 13140 place count 1740 transition count 5160
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 6 with 240 rules applied. Total rules applied 13380 place count 1740 transition count 4920
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 7 with 240 rules applied. Total rules applied 13620 place count 1620 transition count 4800
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 7 with 240 rules applied. Total rules applied 13860 place count 1620 transition count 4560
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 8 with 240 rules applied. Total rules applied 14100 place count 1500 transition count 4440
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 8 with 240 rules applied. Total rules applied 14340 place count 1500 transition count 4200
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 9 with 240 rules applied. Total rules applied 14580 place count 1380 transition count 4080
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 9 with 240 rules applied. Total rules applied 14820 place count 1380 transition count 3840
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 10 with 240 rules applied. Total rules applied 15060 place count 1260 transition count 3720
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 10 with 240 rules applied. Total rules applied 15300 place count 1260 transition count 3480
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 11 with 240 rules applied. Total rules applied 15540 place count 1140 transition count 3360
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 11 with 240 rules applied. Total rules applied 15780 place count 1140 transition count 3120
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 12 with 240 rules applied. Total rules applied 16020 place count 1020 transition count 3000
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 12 with 240 rules applied. Total rules applied 16260 place count 1020 transition count 2760
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 13 with 240 rules applied. Total rules applied 16500 place count 900 transition count 2640
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 13 with 240 rules applied. Total rules applied 16740 place count 900 transition count 2400
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 14 with 240 rules applied. Total rules applied 16980 place count 780 transition count 2280
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 14 with 240 rules applied. Total rules applied 17220 place count 780 transition count 2040
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 15 with 240 rules applied. Total rules applied 17460 place count 660 transition count 1920
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 15 with 240 rules applied. Total rules applied 17700 place count 660 transition count 1680
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 16 with 240 rules applied. Total rules applied 17940 place count 540 transition count 1560
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 16 with 240 rules applied. Total rules applied 18180 place count 540 transition count 1320
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 17 with 240 rules applied. Total rules applied 18420 place count 420 transition count 1200
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 17 with 240 rules applied. Total rules applied 18660 place count 420 transition count 960
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 18 with 240 rules applied. Total rules applied 18900 place count 300 transition count 840
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 18 with 240 rules applied. Total rules applied 19140 place count 300 transition count 600
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 19 with 240 rules applied. Total rules applied 19380 place count 180 transition count 480
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 19 with 300 rules applied. Total rules applied 19680 place count 180 transition count 180
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 120 rules applied. Total rules applied 19800 place count 120 transition count 120
Applied a total of 19800 rules in 4060 ms. Remains 120 /7920 variables (removed 7800) and now considering 120/12120 (removed 12000) transitions.
// Phase 1: matrix 120 rows 120 cols
[2023-03-11 09:47:12] [INFO ] Computed 60 place invariants in 0 ms
[2023-03-11 09:47:12] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-11 09:47:12] [INFO ] Invariant cache hit.
[2023-03-11 09:47:13] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-11 09:47:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 09:47:13] [INFO ] Invariant cache hit.
[2023-03-11 09:47:13] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/7920 places, 120/12120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4570 ms. Remains : 120/7920 places, 120/12120 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s5 1) (NEQ s53 1) (NEQ s43 1) (NEQ s19 1) (NEQ s29 1) (NEQ s8 1) (NEQ s40 1) (NEQ s6 1) (NEQ s4 1) (NEQ s7 1) (NEQ s30 1) (NEQ s18 1) (NEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 559 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA BART-PT-060-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-060-LTLFireability-04 finished in 6336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7260 out of 7920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 7920 transition count 12000
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 7800 transition count 12000
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 7 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 720 place count 7560 transition count 11760
Applied a total of 720 rules in 412 ms. Remains 7560 /7920 variables (removed 360) and now considering 11760/12120 (removed 360) transitions.
// Phase 1: matrix 11760 rows 7560 cols
[2023-03-11 09:47:14] [INFO ] Computed 60 place invariants in 38 ms
[2023-03-11 09:47:16] [INFO ] Implicit Places using invariants in 1844 ms returned []
Implicit Place search using SMT only with invariants took 1846 ms to find 0 implicit places.
[2023-03-11 09:47:16] [INFO ] Invariant cache hit.
[2023-03-11 09:47:18] [INFO ] Dead Transitions using invariants and state equation in 2256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7560/7920 places, 11760/12120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4516 ms. Remains : 7560/7920 places, 11760/12120 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s3516 1) (EQ s3884 1) (EQ s7270 1) (EQ s2223 1) (EQ s5692 1) (EQ s1533 1) (EQ s6857 1) (EQ s1409 1) (EQ s1584 1) (EQ s4450 1) (EQ s4399 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2427 ms.
Product exploration explored 100000 steps with 0 reset in 2765 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]

BK_STOP 1678529733795

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BART-PT-060, 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 r005-oct2-167813593700812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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