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.r361-smll-167891811600484.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ServersAndClients-PT-100160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811600484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 6.7K Feb 26 03:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 03:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 03:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 03:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 03:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 9.8M Mar 5 18:23 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 ServersAndClients-PT-100160-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679304170371

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100160
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:22:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:22:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:22:54] [INFO ] Load time of PNML (sax parser for PT used): 1034 ms
[2023-03-20 09:22:54] [INFO ] Transformed 16561 places.
[2023-03-20 09:22:54] [INFO ] Transformed 32200 transitions.
[2023-03-20 09:22:54] [INFO ] Parsed PT model containing 16561 places and 32200 transitions and 96800 arcs in 1322 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-100160-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 380 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2023-03-20 09:22:56] [INFO ] Computed 361 place invariants in 671 ms
[2023-03-20 09:22:59] [INFO ] Implicit Places using invariants in 3628 ms returned []
Implicit Place search using SMT only with invariants took 3685 ms to find 0 implicit places.
[2023-03-20 09:22:59] [INFO ] Invariant cache hit.
[2023-03-20 09:23:01] [INFO ] Dead Transitions using invariants and state equation in 2540 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6616 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Support contains 41 out of 16561 places after structural reductions.
[2023-03-20 09:23:04] [INFO ] Flatten gal took : 1639 ms
[2023-03-20 09:23:05] [INFO ] Flatten gal took : 1169 ms
[2023-03-20 09:23:07] [INFO ] Input system was already deterministic with 32200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1344 ms. (steps per millisecond=7 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-20 09:23:10] [INFO ] Invariant cache hit.
[2023-03-20 09:23:17] [INFO ] [Real]Absence check using 261 positive place invariants in 1704 ms returned sat
[2023-03-20 09:23:17] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 350 ms returned sat
[2023-03-20 09:23:35] [INFO ] After 15107ms SMT Verify possible using state equation in real domain returned unsat :3 sat :5
[2023-03-20 09:23:35] [INFO ] After 15170ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 09:23:35] [INFO ] After 25099ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :5
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 16561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15994 transitions
Trivial Post-agglo rules discarded 15994 transitions
Performed 15994 trivial Post agglomeration. Transition count delta: 15994
Iterating post reduction 0 with 15994 rules applied. Total rules applied 15994 place count 16561 transition count 16206
Reduce places removed 16148 places and 0 transitions.
Ensure Unique test removed 15300 transitions
Reduce isomorphic transitions removed 15300 transitions.
Iterating post reduction 1 with 31448 rules applied. Total rules applied 47442 place count 413 transition count 906
Drop transitions removed 594 transitions
Redundant transition composition rules discarded 594 transitions
Iterating global reduction 2 with 594 rules applied. Total rules applied 48036 place count 413 transition count 312
Discarding 94 places :
Implicit places reduction removed 94 places
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 2 with 282 rules applied. Total rules applied 48318 place count 319 transition count 124
Reduce places removed 282 places and 0 transitions.
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 3 with 376 rules applied. Total rules applied 48694 place count 37 transition count 30
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 48700 place count 37 transition count 30
Applied a total of 48700 rules in 679 ms. Remains 37 /16561 variables (removed 16524) and now considering 30/32200 (removed 32170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 37/16561 places, 30/32200 transitions.
Finished random walk after 52 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=17 )
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA ServersAndClients-PT-100160-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((G(p0)||F(G((p1 U p2)))))'
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15997 transitions
Trivial Post-agglo rules discarded 15997 transitions
Performed 15997 trivial Post agglomeration. Transition count delta: 15997
Iterating post reduction 0 with 15997 rules applied. Total rules applied 15997 place count 16561 transition count 16203
Reduce places removed 16154 places and 0 transitions.
Ensure Unique test removed 15600 transitions
Reduce isomorphic transitions removed 15600 transitions.
Iterating post reduction 1 with 31754 rules applied. Total rules applied 47751 place count 407 transition count 603
Drop transitions removed 297 transitions
Redundant transition composition rules discarded 297 transitions
Iterating global reduction 2 with 297 rules applied. Total rules applied 48048 place count 407 transition count 306
Discarding 97 places :
Implicit places reduction removed 97 places
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 2 with 291 rules applied. Total rules applied 48339 place count 310 transition count 112
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 387 rules applied. Total rules applied 48726 place count 19 transition count 16
Applied a total of 48726 rules in 465 ms. Remains 19 /16561 variables (removed 16542) and now considering 16/32200 (removed 32184) transitions.
// Phase 1: matrix 16 rows 19 cols
[2023-03-20 09:23:36] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-20 09:23:36] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 69 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16561 places, 16/32200 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Applied a total of 1 rules in 6 ms. Remains 4 /10 variables (removed 6) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-20 09:23:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-20 09:23:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 09:23:37] [INFO ] Invariant cache hit.
[2023-03-20 09:23:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/16561 places, 7/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 598 ms. Remains : 4/16561 places, 7/32200 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s2 1) (LT s1 1) (GEQ s3 1)), p2:(GEQ s1 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 3 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-00 finished in 1050 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((G(p0)||F((G(p2)||p1)))))'
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15483 transitions
Trivial Post-agglo rules discarded 15483 transitions
Performed 15483 trivial Post agglomeration. Transition count delta: 15483
Iterating post reduction 0 with 15483 rules applied. Total rules applied 15483 place count 16561 transition count 16717
Reduce places removed 15483 places and 0 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 15799 rules applied. Total rules applied 31282 place count 1078 transition count 16401
Reduce places removed 473 places and 0 transitions.
Ensure Unique test removed 15600 transitions
Reduce isomorphic transitions removed 15600 transitions.
Iterating post reduction 2 with 16073 rules applied. Total rules applied 47355 place count 605 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 47454 place count 605 transition count 702
Applied a total of 47454 rules in 819 ms. Remains 605 /16561 variables (removed 15956) and now considering 702/32200 (removed 31498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2023-03-20 09:23:38] [INFO ] Computed 204 place invariants in 15 ms
[2023-03-20 09:23:38] [INFO ] Implicit Places using invariants in 635 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 603]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 639 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/16561 places, 702/32200 transitions.
Graph (trivial) has 296 edges and 404 vertex of which 197 / 404 are part of one of the 1 SCC in 0 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 13 transition count 214
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 13 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 11 transition count 18
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 591 place count 10 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 8 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 8 transition count 15
Applied a total of 595 rules in 19 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2023-03-20 09:23:38] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-20 09:23:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 09:23:38] [INFO ] Invariant cache hit.
[2023-03-20 09:23:38] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/16561 places, 15/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1538 ms. Remains : 8/16561 places, 15/32200 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1), p1:(OR (LT s0 1) (LT s3 1)), p2:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4091 reset in 471 ms.
Product exploration explored 100000 steps with 3991 reset in 209 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 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 09:23:40] [INFO ] Invariant cache hit.
[2023-03-20 09:23:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 09:23:40] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 387 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-20 09:23:40] [INFO ] Invariant cache hit.
[2023-03-20 09:23:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 09:23:40] [INFO ] Invariant cache hit.
[2023-03-20 09:23:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-20 09:23:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 09:23:40] [INFO ] Invariant cache hit.
[2023-03-20 09:23:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 8/8 places, 15/15 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)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3894 reset in 183 ms.
Product exploration explored 100000 steps with 3986 reset in 133 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 15/15 transitions.
Graph (trivial) has 3 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 5 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 5 transition count 8
Applied a total of 6 rules in 5 ms. Remains 5 /8 variables (removed 3) and now considering 8/15 (removed 7) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-20 09:23:41] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 09:23:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 09:23:41] [INFO ] Invariant cache hit.
[2023-03-20 09:23:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-20 09:23:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 09:23:41] [INFO ] Invariant cache hit.
[2023-03-20 09:23:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 8/15 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 5/8 places, 8/15 transitions.
Treatment of property ServersAndClients-PT-100160-LTLFireability-03 finished in 6078 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' '!(F(G(!p0)))'
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15484 transitions
Trivial Post-agglo rules discarded 15484 transitions
Performed 15484 trivial Post agglomeration. Transition count delta: 15484
Iterating post reduction 0 with 15484 rules applied. Total rules applied 15484 place count 16561 transition count 16716
Reduce places removed 15484 places and 0 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 15800 rules applied. Total rules applied 31284 place count 1077 transition count 16400
Reduce places removed 474 places and 0 transitions.
Ensure Unique test removed 15700 transitions
Reduce isomorphic transitions removed 15700 transitions.
Iterating post reduction 2 with 16174 rules applied. Total rules applied 47458 place count 603 transition count 700
Applied a total of 47458 rules in 408 ms. Remains 603 /16561 variables (removed 15958) and now considering 700/32200 (removed 31500) transitions.
// Phase 1: matrix 700 rows 603 cols
[2023-03-20 09:23:43] [INFO ] Computed 203 place invariants in 5 ms
[2023-03-20 09:23:44] [INFO ] Implicit Places using invariants in 515 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 519 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/16561 places, 700/32200 transitions.
Graph (trivial) has 296 edges and 403 vertex of which 197 / 403 are part of one of the 1 SCC in 0 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 12 transition count 212
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 12 transition count 212
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 10 transition count 16
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 591 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 7 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 7 transition count 13
Applied a total of 595 rules in 10 ms. Remains 7 /403 variables (removed 396) and now considering 13/700 (removed 687) transitions.
// Phase 1: matrix 13 rows 7 cols
[2023-03-20 09:23:44] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-20 09:23:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 09:23:44] [INFO ] Invariant cache hit.
[2023-03-20 09:23:44] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/16561 places, 13/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 985 ms. Remains : 7/16561 places, 13/32200 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 319 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-04 finished in 1376 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' '!(F(G(p0)))'
Support contains 1 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15999 transitions
Trivial Post-agglo rules discarded 15999 transitions
Performed 15999 trivial Post agglomeration. Transition count delta: 15999
Iterating post reduction 0 with 15999 rules applied. Total rules applied 15999 place count 16561 transition count 16201
Reduce places removed 16158 places and 0 transitions.
Ensure Unique test removed 15800 transitions
Reduce isomorphic transitions removed 15800 transitions.
Iterating post reduction 1 with 31958 rules applied. Total rules applied 47957 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 48056 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 48353 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 48748 place count 7 transition count 6
Applied a total of 48748 rules in 284 ms. Remains 7 /16561 variables (removed 16554) and now considering 6/32200 (removed 32194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-20 09:23:45] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 09:23:45] [INFO ] Implicit Places using invariants in 23 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/16561 places, 6/32200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-20 09:23:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 09:23:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 09:23:45] [INFO ] Invariant cache hit.
[2023-03-20 09:23:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/16561 places, 3/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 351 ms. Remains : 2/16561 places, 3/32200 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-05 finished in 421 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(X(p0)) U ((G(p2)||G(p0))&&p1)))'
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 96 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2023-03-20 09:23:45] [INFO ] Computed 361 place invariants in 281 ms
[2023-03-20 09:23:48] [INFO ] Implicit Places using invariants in 2533 ms returned []
Implicit Place search using SMT only with invariants took 2550 ms to find 0 implicit places.
[2023-03-20 09:23:48] [INFO ] Invariant cache hit.
[2023-03-20 09:23:50] [INFO ] Dead Transitions using invariants and state equation in 2440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5093 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 591 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=0 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=2 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}, { cond=p2, acceptance={} source=3 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p2) (AND p2 (NOT p0))), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={1} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s371 1) (GEQ s11915 1)), p2:(AND (GEQ s321 1) (GEQ s6865 1)), p0:(GEQ s8413 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 6 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-07 finished in 5850 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((F(p0)&&(X(p0)||p1)))))'
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 167 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-20 09:23:51] [INFO ] Invariant cache hit.
[2023-03-20 09:23:53] [INFO ] Implicit Places using invariants in 2211 ms returned []
Implicit Place search using SMT only with invariants took 2215 ms to find 0 implicit places.
[2023-03-20 09:23:53] [INFO ] Invariant cache hit.
[2023-03-20 09:23:55] [INFO ] Dead Transitions using invariants and state equation in 2272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4663 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s213 1) (LT s9491 1)), p1:(OR (LT s363 1) (LT s13733 1))], 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 52480 steps with 25990 reset in 10008 ms.
Product exploration timeout after 54630 steps with 27064 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), (X (X p0))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100160-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100160-LTLFireability-08 finished in 25290 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 2 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15741 transitions
Trivial Post-agglo rules discarded 15741 transitions
Performed 15741 trivial Post agglomeration. Transition count delta: 15741
Iterating post reduction 0 with 15741 rules applied. Total rules applied 15741 place count 16561 transition count 16459
Reduce places removed 15741 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 15900 rules applied. Total rules applied 31641 place count 820 transition count 16300
Reduce places removed 318 places and 0 transitions.
Ensure Unique test removed 15800 transitions
Reduce isomorphic transitions removed 15800 transitions.
Iterating post reduction 2 with 16118 rules applied. Total rules applied 47759 place count 502 transition count 500
Applied a total of 47759 rules in 344 ms. Remains 502 /16561 variables (removed 16059) and now considering 500/32200 (removed 31700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2023-03-20 09:24:16] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-20 09:24:17] [INFO ] Implicit Places using invariants in 688 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 692 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/16561 places, 500/32200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 2 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 4 transition count 6
Applied a total of 299 rules in 11 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-20 09:24:17] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 09:24:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 09:24:17] [INFO ] Invariant cache hit.
[2023-03-20 09:24:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/16561 places, 6/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1110 ms. Remains : 4/16561 places, 6/32200 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-09 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 (LT s0 1) (LT s2 1))], 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 8649 reset in 66 ms.
Product exploration explored 100000 steps with 8809 reset in 79 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 131 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 159 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 09:24:18] [INFO ] Invariant cache hit.
[2023-03-20 09:24:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 09:24:18] [INFO ] Invariant cache hit.
[2023-03-20 09:24:18] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-20 09:24:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 09:24:18] [INFO ] Invariant cache hit.
[2023-03-20 09:24:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 4/4 places, 6/6 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 138 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 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 160 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8672 reset in 68 ms.
Product exploration explored 100000 steps with 8671 reset in 90 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 09:24:19] [INFO ] Invariant cache hit.
[2023-03-20 09:24:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 09:24:19] [INFO ] Invariant cache hit.
[2023-03-20 09:24:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-20 09:24:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 09:24:19] [INFO ] Invariant cache hit.
[2023-03-20 09:24:19] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 4/4 places, 6/6 transitions.
Treatment of property ServersAndClients-PT-100160-LTLFireability-09 finished in 3844 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(p0))||G((p1 U X(p2)))))'
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 260 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2023-03-20 09:24:20] [INFO ] Computed 361 place invariants in 319 ms
[2023-03-20 09:24:23] [INFO ] Implicit Places using invariants in 2587 ms returned []
Implicit Place search using SMT only with invariants took 2588 ms to find 0 implicit places.
[2023-03-20 09:24:23] [INFO ] Invariant cache hit.
[2023-03-20 09:24:25] [INFO ] Dead Transitions using invariants and state equation in 2172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5035 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s273 1) (GEQ s1714 1)), p2:(LT s3152 1), p0:(AND (GEQ s365 1) (GEQ s12723 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 71080 steps with 23737 reset in 10004 ms.
Product exploration timeout after 73570 steps with 24584 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 (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 690 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 09:24:47] [INFO ] Invariant cache hit.
[2023-03-20 09:24:52] [INFO ] [Real]Absence check using 261 positive place invariants in 1601 ms returned sat
[2023-03-20 09:24:52] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 361 ms returned sat
[2023-03-20 09:24:52] [INFO ] After 5162ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 825 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 148 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-20 09:24:54] [INFO ] Invariant cache hit.
[2023-03-20 09:24:56] [INFO ] Implicit Places using invariants in 2198 ms returned []
Implicit Place search using SMT only with invariants took 2199 ms to find 0 implicit places.
[2023-03-20 09:24:56] [INFO ] Invariant cache hit.
[2023-03-20 09:24:58] [INFO ] Dead Transitions using invariants and state equation in 2228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4579 ms. Remains : 16561/16561 places, 32200/32200 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) p2 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 4 factoid took 390 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 09:25:00] [INFO ] Invariant cache hit.
[2023-03-20 09:25:04] [INFO ] [Real]Absence check using 261 positive place invariants in 1721 ms returned sat
[2023-03-20 09:25:05] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 353 ms returned sat
[2023-03-20 09:25:25] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15740 transitions
Trivial Post-agglo rules discarded 15740 transitions
Performed 15740 trivial Post agglomeration. Transition count delta: 15740
Iterating post reduction 0 with 15740 rules applied. Total rules applied 15740 place count 16561 transition count 16460
Reduce places removed 15740 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 15899 rules applied. Total rules applied 31639 place count 821 transition count 16301
Reduce places removed 317 places and 0 transitions.
Ensure Unique test removed 15700 transitions
Reduce isomorphic transitions removed 15700 transitions.
Iterating post reduction 2 with 16017 rules applied. Total rules applied 47656 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 47755 place count 504 transition count 502
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 47854 place count 504 transition count 502
Applied a total of 47854 rules in 553 ms. Remains 504 /16561 variables (removed 16057) and now considering 502/32200 (removed 31698) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 504/16561 places, 502/32200 transitions.
Finished random walk after 712 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 538 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 225 reset in 5760 ms.
Product exploration explored 100000 steps with 251 reset in 5857 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Performed 15799 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15799 rules applied. Total rules applied 15799 place count 16561 transition count 32200
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 15955 place count 16405 transition count 16600
Deduced a syphon composed of 15799 places in 4 ms
Iterating global reduction 1 with 156 rules applied. Total rules applied 16111 place count 16405 transition count 16600
Deduced a syphon composed of 15799 places in 3 ms
Applied a total of 16111 rules in 8039 ms. Remains 16405 /16561 variables (removed 156) and now considering 16600/32200 (removed 15600) transitions.
[2023-03-20 09:25:46] [INFO ] Flow matrix only has 16501 transitions (discarded 99 similar events)
// Phase 1: matrix 16501 rows 16405 cols
[2023-03-20 09:25:52] [INFO ] Computed 205 place invariants in 5488 ms
[2023-03-20 09:25:54] [INFO ] Dead Transitions using invariants and state equation in 7791 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16405/16561 places, 16600/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15835 ms. Remains : 16405/16561 places, 16600/32200 transitions.
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 152 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2023-03-20 09:25:55] [INFO ] Computed 361 place invariants in 270 ms
[2023-03-20 09:25:57] [INFO ] Implicit Places using invariants in 2618 ms returned []
Implicit Place search using SMT only with invariants took 2620 ms to find 0 implicit places.
[2023-03-20 09:25:57] [INFO ] Invariant cache hit.
[2023-03-20 09:25:59] [INFO ] Dead Transitions using invariants and state equation in 2340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5114 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Treatment of property ServersAndClients-PT-100160-LTLFireability-10 finished in 100680 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(p0)))'
Support contains 2 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 154 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-20 09:26:01] [INFO ] Invariant cache hit.
[2023-03-20 09:26:03] [INFO ] Implicit Places using invariants in 2324 ms returned []
Implicit Place search using SMT only with invariants took 2325 ms to find 0 implicit places.
[2023-03-20 09:26:03] [INFO ] Invariant cache hit.
[2023-03-20 09:26:05] [INFO ] Dead Transitions using invariants and state equation in 2349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4834 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s367 1) (GEQ s2825 1))], 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][false, false]]
Product exploration explored 100000 steps with 250 reset in 5928 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 4 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-11 finished in 10921 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((p0&&X(X(G((X(p0)&&p1)))))))'
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 178 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-20 09:26:12] [INFO ] Invariant cache hit.
[2023-03-20 09:26:14] [INFO ] Implicit Places using invariants in 2162 ms returned []
Implicit Place search using SMT only with invariants took 2164 ms to find 0 implicit places.
[2023-03-20 09:26:14] [INFO ] Invariant cache hit.
[2023-03-20 09:26:16] [INFO ] Dead Transitions using invariants and state equation in 2307 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4652 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s369 1) (LT s11309 1)), p1:(AND (OR (LT s367 1) (LT s15753 1)) (OR (LT s369 1) (LT s11309 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 293 steps with 0 reset in 18 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-12 finished in 4979 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' '!(((F(p0) U p1)&&X(F(((!p1&&X(F(p1)))||G(F(p1)))))))'
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 223 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-20 09:26:17] [INFO ] Invariant cache hit.
[2023-03-20 09:26:19] [INFO ] Implicit Places using invariants in 2350 ms returned []
Implicit Place search using SMT only with invariants took 2352 ms to find 0 implicit places.
[2023-03-20 09:26:19] [INFO ] Invariant cache hit.
[2023-03-20 09:26:21] [INFO ] Dead Transitions using invariants and state equation in 2225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4803 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s6698 1), p0:(AND (GEQ s283 1) (GEQ s10905 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 5136 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-15 finished in 10232 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((G(p0)||F((G(p2)||p1)))))'
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)))'
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(p0))||G((p1 U X(p2)))))'
[2023-03-20 09:26:28] [INFO ] Flatten gal took : 1072 ms
[2023-03-20 09:26:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 09:26:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16561 places, 32200 transitions and 96800 arcs took 127 ms.
Total runtime 215379 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1430/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1430/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1430/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ServersAndClients-PT-100160-LTLFireability-03
Could not compute solution for formula : ServersAndClients-PT-100160-LTLFireability-09
Could not compute solution for formula : ServersAndClients-PT-100160-LTLFireability-10

BK_STOP 1679304627197

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ServersAndClients-PT-100160-LTLFireability-03
ltl formula formula --ltl=/tmp/1430/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1430/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 4.230 real 1.390 user 1.460 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1430/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1430/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1430/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ServersAndClients-PT-100160-LTLFireability-09
ltl formula formula --ltl=/tmp/1430/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.060 real 1.260 user 1.520 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1430/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1430/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1430/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1430/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ServersAndClients-PT-100160-LTLFireability-10
ltl formula formula --ltl=/tmp/1430/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.990 real 1.330 user 1.440 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1430/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1430/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1430/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1430/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x557f01e613f4]
1: pnml2lts-mc(+0xa2496) [0x557f01e61496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ff2b2639140]
3: pnml2lts-mc(+0x405be5) [0x557f021c4be5]
4: pnml2lts-mc(+0x16b3f9) [0x557f01f2a3f9]
5: pnml2lts-mc(+0x164ac4) [0x557f01f23ac4]
6: pnml2lts-mc(+0x272e0a) [0x557f02031e0a]
7: pnml2lts-mc(+0xb61f0) [0x557f01e751f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ff2b248c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ff2b248c67a]
10: pnml2lts-mc(+0xa1581) [0x557f01e60581]
11: pnml2lts-mc(+0xa1910) [0x557f01e60910]
12: pnml2lts-mc(+0xa32a2) [0x557f01e622a2]
13: pnml2lts-mc(+0xa50f4) [0x557f01e640f4]
14: pnml2lts-mc(+0xa516b) [0x557f01e6416b]
15: pnml2lts-mc(+0x3f34b3) [0x557f021b24b3]
16: pnml2lts-mc(+0x7c63d) [0x557f01e3b63d]
17: pnml2lts-mc(+0x67d86) [0x557f01e26d86]
18: pnml2lts-mc(+0x60a8a) [0x557f01e1fa8a]
19: pnml2lts-mc(+0x5eb15) [0x557f01e1db15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ff2b2474d0a]
21: pnml2lts-mc(+0x6075e) [0x557f01e1f75e]

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="ServersAndClients-PT-100160"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ServersAndClients-PT-100160, 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 r361-smll-167891811600484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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