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.r169-tall-167838855700308.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 FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855700308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Feb 26 11:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 11:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 11:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 135K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678505866511

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=FamilyReunion-COL-L00020M0002C001P001G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 03:37:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:37:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:37:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 03:37:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 03:37:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 557 ms
[2023-03-11 03:37:48] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2023-03-11 03:37:48] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 03:37:49] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-11 03:37:49] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10017 steps, including 7 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 03:37:49] [INFO ] Computed 33 place invariants in 13 ms
[2023-03-11 03:37:49] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-11 03:37:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2023-03-11 03:37:49] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:37:49] [INFO ] After 65ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 03:37:49] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 152 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 3 ms.
[2023-03-11 03:37:49] [INFO ] Flatten gal took : 47 ms
[2023-03-11 03:37:49] [INFO ] Flatten gal took : 8 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
[2023-03-11 03:37:49] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 39 ms.
[2023-03-11 03:37:49] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 21 places in 18 ms
Reduce places removed 30 places and 0 transitions.
Support contains 862 out of 3065 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Reduce places removed 73 places and 0 transitions.
Discarding 357 places :
Implicit places reduction removed 357 places
Iterating post reduction 0 with 430 rules applied. Total rules applied 430 place count 2635 transition count 2438
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 599 place count 2466 transition count 2269
Iterating global reduction 1 with 169 rules applied. Total rules applied 768 place count 2466 transition count 2269
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 831 place count 2403 transition count 2186
Iterating global reduction 1 with 63 rules applied. Total rules applied 894 place count 2403 transition count 2186
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 915 place count 2382 transition count 2186
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 978 place count 2319 transition count 2123
Iterating global reduction 2 with 63 rules applied. Total rules applied 1041 place count 2319 transition count 2123
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1064 place count 2296 transition count 2060
Iterating global reduction 2 with 23 rules applied. Total rules applied 1087 place count 2296 transition count 2060
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 1108 place count 2275 transition count 2060
Applied a total of 1108 rules in 957 ms. Remains 2275 /3065 variables (removed 790) and now considering 2060/2438 (removed 378) transitions.
// Phase 1: matrix 2060 rows 2275 cols
[2023-03-11 03:37:50] [INFO ] Computed 299 place invariants in 89 ms
[2023-03-11 03:37:51] [INFO ] Implicit Places using invariants in 778 ms returned [483, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1475, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 2022]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 785 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2230/3065 places, 2060/2438 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2189 transition count 2019
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2189 transition count 2019
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2169 transition count 1979
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2169 transition count 1979
Applied a total of 122 rules in 344 ms. Remains 2169 /2230 variables (removed 61) and now considering 1979/2060 (removed 81) transitions.
// Phase 1: matrix 1979 rows 2169 cols
[2023-03-11 03:37:51] [INFO ] Computed 254 place invariants in 35 ms
[2023-03-11 03:37:52] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-11 03:37:52] [INFO ] Invariant cache hit.
[2023-03-11 03:37:54] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2169/3065 places, 1979/2438 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4295 ms. Remains : 2169/3065 places, 1979/2438 transitions.
Support contains 862 out of 2169 places after structural reductions.
[2023-03-11 03:37:54] [INFO ] Flatten gal took : 105 ms
[2023-03-11 03:37:54] [INFO ] Flatten gal took : 89 ms
[2023-03-11 03:37:54] [INFO ] Input system was already deterministic with 1979 transitions.
Support contains 820 out of 2169 places (down from 862) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:37:54] [INFO ] Invariant cache hit.
[2023-03-11 03:37:55] [INFO ] [Real]Absence check using 0 positive and 254 generalized place invariants in 82 ms returned sat
[2023-03-11 03:37:56] [INFO ] After 1678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:37:56] [INFO ] [Nat]Absence check using 0 positive and 254 generalized place invariants in 79 ms returned sat
[2023-03-11 03:37:58] [INFO ] After 1314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:37:58] [INFO ] After 1669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 565 ms.
[2023-03-11 03:37:59] [INFO ] After 2583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 326 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 4 ms.
Computed a total of 2169 stabilizing places and 1979 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2169 transition count 1979
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 21 out of 2169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Graph (complete) has 2588 edges and 2169 vertex of which 987 are kept as prefixes of interest. Removing 1182 places using SCC suffix rule.10 ms
Discarding 1182 places :
Also discarding 1034 output transitions
Drop transitions removed 1034 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 756 transitions
Trivial Post-agglo rules discarded 756 transitions
Performed 756 trivial Post agglomeration. Transition count delta: 756
Iterating post reduction 0 with 819 rules applied. Total rules applied 820 place count 903 transition count 168
Reduce places removed 756 places and 0 transitions.
Iterating post reduction 1 with 756 rules applied. Total rules applied 1576 place count 147 transition count 168
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1618 place count 105 transition count 126
Iterating global reduction 2 with 42 rules applied. Total rules applied 1660 place count 105 transition count 126
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 1702 place count 105 transition count 84
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1702 place count 105 transition count 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 105 rules applied. Total rules applied 1807 place count 42 transition count 42
Applied a total of 1807 rules in 47 ms. Remains 42 /2169 variables (removed 2127) and now considering 42/1979 (removed 1937) transitions.
// Phase 1: matrix 42 rows 42 cols
[2023-03-11 03:37:59] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 03:37:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 03:37:59] [INFO ] Invariant cache hit.
[2023-03-11 03:37:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-11 03:37:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 03:37:59] [INFO ] Invariant cache hit.
[2023-03-11 03:37:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/2169 places, 42/1979 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 42/2169 places, 42/1979 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00 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 (GEQ s24 1) (GEQ s25 1) (GEQ s22 1) (GEQ s23 1) (GEQ s28 1) (GEQ s29 1) (GEQ s26 1) (GEQ s27 1) (GEQ s21 1) (GEQ s40 1) (GEQ s41 1) (GEQ s38 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 50 steps with 4 reset in 4 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00 finished in 395 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(G(p0)))'
Support contains 63 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 2064 transition count 1979
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 167 place count 2002 transition count 1917
Iterating global reduction 1 with 62 rules applied. Total rules applied 229 place count 2002 transition count 1917
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 291 place count 1940 transition count 1855
Iterating global reduction 1 with 62 rules applied. Total rules applied 353 place count 1940 transition count 1855
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 415 place count 1878 transition count 1793
Iterating global reduction 1 with 62 rules applied. Total rules applied 477 place count 1878 transition count 1793
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 539 place count 1816 transition count 1731
Iterating global reduction 1 with 62 rules applied. Total rules applied 601 place count 1816 transition count 1731
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 602 place count 1815 transition count 1731
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 664 place count 1753 transition count 1669
Iterating global reduction 2 with 62 rules applied. Total rules applied 726 place count 1753 transition count 1669
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 788 place count 1691 transition count 1607
Iterating global reduction 2 with 62 rules applied. Total rules applied 850 place count 1691 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 892 place count 1649 transition count 1565
Iterating global reduction 2 with 42 rules applied. Total rules applied 934 place count 1649 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 976 place count 1607 transition count 1523
Iterating global reduction 2 with 42 rules applied. Total rules applied 1018 place count 1607 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1060 place count 1565 transition count 1481
Iterating global reduction 2 with 42 rules applied. Total rules applied 1102 place count 1565 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1144 place count 1523 transition count 1439
Iterating global reduction 2 with 42 rules applied. Total rules applied 1186 place count 1523 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1228 place count 1481 transition count 1397
Iterating global reduction 2 with 42 rules applied. Total rules applied 1270 place count 1481 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1312 place count 1439 transition count 1355
Iterating global reduction 2 with 42 rules applied. Total rules applied 1354 place count 1439 transition count 1355
Applied a total of 1354 rules in 993 ms. Remains 1439 /2169 variables (removed 730) and now considering 1355/1979 (removed 624) transitions.
// Phase 1: matrix 1355 rows 1439 cols
[2023-03-11 03:38:00] [INFO ] Computed 148 place invariants in 9 ms
[2023-03-11 03:38:01] [INFO ] Implicit Places using invariants in 330 ms returned [189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 337 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1418/2169 places, 1355/1979 transitions.
Applied a total of 0 rules in 61 ms. Remains 1418 /1418 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1391 ms. Remains : 1418/2169 places, 1355/1979 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s128 1) (LT s126 1) (LT s132 1) (LT s130 1) (LT s136 1) (LT s134 1) (LT s140 1) (LT s138 1) (LT s144 1) (LT s142 1) (LT s146 1) (LT s85 1) (LT...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01 finished in 1576 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((G(F(!p0)) U (G(p2)||p1))))'
Support contains 168 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 2127 transition count 1979
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 104 place count 2065 transition count 1917
Iterating global reduction 1 with 62 rules applied. Total rules applied 166 place count 2065 transition count 1917
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 228 place count 2003 transition count 1855
Iterating global reduction 1 with 62 rules applied. Total rules applied 290 place count 2003 transition count 1855
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 352 place count 1941 transition count 1793
Iterating global reduction 1 with 62 rules applied. Total rules applied 414 place count 1941 transition count 1793
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 434 place count 1921 transition count 1773
Iterating global reduction 1 with 20 rules applied. Total rules applied 454 place count 1921 transition count 1773
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 455 place count 1920 transition count 1773
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 475 place count 1900 transition count 1753
Iterating global reduction 2 with 20 rules applied. Total rules applied 495 place count 1900 transition count 1753
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 515 place count 1880 transition count 1733
Iterating global reduction 2 with 20 rules applied. Total rules applied 535 place count 1880 transition count 1733
Applied a total of 535 rules in 747 ms. Remains 1880 /2169 variables (removed 289) and now considering 1733/1979 (removed 246) transitions.
// Phase 1: matrix 1733 rows 1880 cols
[2023-03-11 03:38:02] [INFO ] Computed 211 place invariants in 18 ms
[2023-03-11 03:38:02] [INFO ] Implicit Places using invariants in 442 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 449 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1859/2169 places, 1733/1979 transitions.
Applied a total of 0 rules in 91 ms. Remains 1859 /1859 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1288 ms. Remains : 1859/2169 places, 1733/1979 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, 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}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s1607 1) (GEQ s1625 1) (GEQ s1624 1) (GEQ s1627 1) (GEQ s1626 1) (GEQ s1617 1) (GEQ s1616 1) (GEQ s1619 1) (GEQ s1618 1) (GEQ s1621 1) (GEQ s1...], 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 266 reset in 488 ms.
Product exploration explored 100000 steps with 273 reset in 394 ms.
Computed a total of 1859 stabilizing places and 1733 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1859 transition count 1733
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 591 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 115 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 14 factoid took 588 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 1733 rows 1859 cols
[2023-03-11 03:38:05] [INFO ] Computed 190 place invariants in 25 ms
[2023-03-11 03:38:07] [INFO ] [Real]Absence check using 0 positive and 190 generalized place invariants in 154 ms returned sat
[2023-03-11 03:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:38:10] [INFO ] [Real]Absence check using state equation in 3366 ms returned sat
[2023-03-11 03:38:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:38:12] [INFO ] [Nat]Absence check using 0 positive and 190 generalized place invariants in 149 ms returned sat
[2023-03-11 03:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:38:16] [INFO ] [Nat]Absence check using state equation in 3553 ms returned sat
[2023-03-11 03:38:16] [INFO ] Computed and/alt/rep : 1710/1963/1710 causal constraints (skipped 2 transitions) in 111 ms.
[2023-03-11 03:38:22] [INFO ] Added : 307 causal constraints over 62 iterations in 6589 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 147 out of 1859 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1859/1859 places, 1733/1733 transitions.
Applied a total of 0 rules in 98 ms. Remains 1859 /1859 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
[2023-03-11 03:38:22] [INFO ] Invariant cache hit.
[2023-03-11 03:38:23] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-11 03:38:23] [INFO ] Invariant cache hit.
[2023-03-11 03:38:24] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
[2023-03-11 03:38:24] [INFO ] Invariant cache hit.
[2023-03-11 03:38:25] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2888 ms. Remains : 1859/1859 places, 1733/1733 transitions.
Computed a total of 1859 stabilizing places and 1733 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1859 transition count 1733
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 134 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-11 03:38:26] [INFO ] Invariant cache hit.
[2023-03-11 03:38:28] [INFO ] [Real]Absence check using 0 positive and 190 generalized place invariants in 135 ms returned sat
[2023-03-11 03:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:38:32] [INFO ] [Real]Absence check using state equation in 4226 ms returned sat
[2023-03-11 03:38:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:38:34] [INFO ] [Nat]Absence check using 0 positive and 190 generalized place invariants in 134 ms returned sat
[2023-03-11 03:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:38:39] [INFO ] [Nat]Absence check using state equation in 5024 ms returned sat
[2023-03-11 03:38:39] [INFO ] Computed and/alt/rep : 1710/1963/1710 causal constraints (skipped 2 transitions) in 71 ms.
[2023-03-11 03:38:46] [INFO ] Added : 254 causal constraints over 51 iterations in 6357 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 175 reset in 727 ms.
Product exploration explored 100000 steps with 173 reset in 762 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 147 out of 1859 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1859/1859 places, 1733/1733 transitions.
Graph (complete) has 2132 edges and 1859 vertex of which 1428 are kept as prefixes of interest. Removing 431 places using SCC suffix rule.11 ms
Discarding 431 places :
Also discarding 347 output transitions
Drop transitions removed 347 transitions
Performed 441 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 441 rules applied. Total rules applied 442 place count 1428 transition count 1386
Performed 546 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 546 Pre rules applied. Total rules applied 442 place count 1428 transition count 1470
Deduced a syphon composed of 987 places in 0 ms
Iterating global reduction 1 with 546 rules applied. Total rules applied 988 place count 1428 transition count 1470
Discarding 609 places :
Symmetric choice reduction at 1 with 609 rule applications. Total rules 1597 place count 819 transition count 861
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 609 rules applied. Total rules applied 2206 place count 819 transition count 861
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 399 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 2227 place count 819 transition count 861
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 2248 place count 798 transition count 840
Deduced a syphon composed of 378 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 2269 place count 798 transition count 840
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 399 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 2290 place count 798 transition count 924
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 2311 place count 777 transition count 882
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 2332 place count 777 transition count 882
Deduced a syphon composed of 378 places in 0 ms
Applied a total of 2332 rules in 608 ms. Remains 777 /1859 variables (removed 1082) and now considering 882/1733 (removed 851) transitions.
[2023-03-11 03:38:48] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 882 rows 777 cols
[2023-03-11 03:38:48] [INFO ] Computed 105 place invariants in 6 ms
[2023-03-11 03:38:49] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 777/1859 places, 882/1733 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1582 ms. Remains : 777/1859 places, 882/1733 transitions.
Support contains 147 out of 1859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1859/1859 places, 1733/1733 transitions.
Applied a total of 0 rules in 85 ms. Remains 1859 /1859 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
// Phase 1: matrix 1733 rows 1859 cols
[2023-03-11 03:38:49] [INFO ] Computed 190 place invariants in 9 ms
[2023-03-11 03:38:50] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-11 03:38:50] [INFO ] Invariant cache hit.
[2023-03-11 03:38:51] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
[2023-03-11 03:38:51] [INFO ] Invariant cache hit.
[2023-03-11 03:38:52] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2773 ms. Remains : 1859/1859 places, 1733/1733 transitions.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02 finished in 51214 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((G(p0)||X(X(X(F(p1)))))))'
Support contains 105 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 2064 transition count 1979
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 167 place count 2002 transition count 1917
Iterating global reduction 1 with 62 rules applied. Total rules applied 229 place count 2002 transition count 1917
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 291 place count 1940 transition count 1855
Iterating global reduction 1 with 62 rules applied. Total rules applied 353 place count 1940 transition count 1855
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 415 place count 1878 transition count 1793
Iterating global reduction 1 with 62 rules applied. Total rules applied 477 place count 1878 transition count 1793
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 539 place count 1816 transition count 1731
Iterating global reduction 1 with 62 rules applied. Total rules applied 601 place count 1816 transition count 1731
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 602 place count 1815 transition count 1731
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 622 place count 1795 transition count 1711
Iterating global reduction 2 with 20 rules applied. Total rules applied 642 place count 1795 transition count 1711
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 662 place count 1775 transition count 1691
Iterating global reduction 2 with 20 rules applied. Total rules applied 682 place count 1775 transition count 1691
Applied a total of 682 rules in 643 ms. Remains 1775 /2169 variables (removed 394) and now considering 1691/1979 (removed 288) transitions.
// Phase 1: matrix 1691 rows 1775 cols
[2023-03-11 03:38:53] [INFO ] Computed 148 place invariants in 13 ms
[2023-03-11 03:38:53] [INFO ] Implicit Places using invariants in 390 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 394 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1754/2169 places, 1691/1979 transitions.
Applied a total of 0 rules in 85 ms. Remains 1754 /1754 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1123 ms. Remains : 1754/2169 places, 1691/1979 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=1, aps=[p1:(OR (GEQ s762 1) (GEQ s760 1) (GEQ s758 1) (GEQ s778 1) (GEQ s811 1) (GEQ s776 1) (GEQ s813 1) (GEQ s815 1) (GEQ s774 1) (GEQ s772 1) (GEQ s817 1) (GEQ...], 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 905 reset in 456 ms.
Product exploration explored 100000 steps with 888 reset in 473 ms.
Computed a total of 1754 stabilizing places and 1691 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1754 transition count 1691
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 104 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 1691 rows 1754 cols
[2023-03-11 03:38:56] [INFO ] Computed 127 place invariants in 11 ms
[2023-03-11 03:38:57] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 60 ms returned sat
[2023-03-11 03:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:38:59] [INFO ] [Real]Absence check using state equation in 1863 ms returned sat
[2023-03-11 03:38:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:39:00] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 55 ms returned sat
[2023-03-11 03:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:01] [INFO ] [Nat]Absence check using state equation in 1722 ms returned sat
[2023-03-11 03:39:02] [INFO ] Computed and/alt/rep : 1668/1858/1668 causal constraints (skipped 2 transitions) in 174 ms.
[2023-03-11 03:39:05] [INFO ] Added : 168 causal constraints over 34 iterations in 3100 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 63 out of 1754 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1754/1754 places, 1691/1691 transitions.
Applied a total of 0 rules in 82 ms. Remains 1754 /1754 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
[2023-03-11 03:39:05] [INFO ] Invariant cache hit.
[2023-03-11 03:39:05] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-11 03:39:05] [INFO ] Invariant cache hit.
[2023-03-11 03:39:06] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
[2023-03-11 03:39:06] [INFO ] Invariant cache hit.
[2023-03-11 03:39:07] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2448 ms. Remains : 1754/1754 places, 1691/1691 transitions.
Computed a total of 1754 stabilizing places and 1691 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1754 transition count 1691
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), true, (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 121 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Knowledge obtained : [(NOT p1), true, (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 03:39:08] [INFO ] Invariant cache hit.
[2023-03-11 03:39:09] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 65 ms returned sat
[2023-03-11 03:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:11] [INFO ] [Real]Absence check using state equation in 1886 ms returned sat
[2023-03-11 03:39:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:39:12] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 62 ms returned sat
[2023-03-11 03:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:14] [INFO ] [Nat]Absence check using state equation in 1778 ms returned sat
[2023-03-11 03:39:14] [INFO ] Computed and/alt/rep : 1668/1858/1668 causal constraints (skipped 2 transitions) in 90 ms.
[2023-03-11 03:39:17] [INFO ] Added : 168 causal constraints over 34 iterations in 3004 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 901 reset in 470 ms.
Product exploration explored 100000 steps with 899 reset in 470 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 63 out of 1754 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1754/1754 places, 1691/1691 transitions.
Graph (complete) has 1964 edges and 1754 vertex of which 609 are kept as prefixes of interest. Removing 1145 places using SCC suffix rule.7 ms
Discarding 1145 places :
Also discarding 1040 output transitions
Drop transitions removed 1040 transitions
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 253 place count 609 transition count 651
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 210 Pre rules applied. Total rules applied 253 place count 609 transition count 693
Deduced a syphon composed of 462 places in 0 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 463 place count 609 transition count 693
Discarding 315 places :
Symmetric choice reduction at 1 with 315 rule applications. Total rules 778 place count 294 transition count 378
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 1 with 315 rules applied. Total rules applied 1093 place count 294 transition count 378
Deduced a syphon composed of 147 places in 0 ms
Applied a total of 1093 rules in 45 ms. Remains 294 /1754 variables (removed 1460) and now considering 378/1691 (removed 1313) transitions.
[2023-03-11 03:39:18] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 378 rows 294 cols
[2023-03-11 03:39:18] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-11 03:39:18] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/1754 places, 378/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 294/1754 places, 378/1691 transitions.
Support contains 63 out of 1754 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1754/1754 places, 1691/1691 transitions.
Applied a total of 0 rules in 80 ms. Remains 1754 /1754 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
// Phase 1: matrix 1691 rows 1754 cols
[2023-03-11 03:39:18] [INFO ] Computed 127 place invariants in 13 ms
[2023-03-11 03:39:19] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-11 03:39:19] [INFO ] Invariant cache hit.
[2023-03-11 03:39:20] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
[2023-03-11 03:39:20] [INFO ] Invariant cache hit.
[2023-03-11 03:39:21] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2424 ms. Remains : 1754/1754 places, 1691/1691 transitions.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03 finished in 28673 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' '!((!p0 U G(p1)))'
Support contains 43 out of 2169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Graph (complete) has 2588 edges and 2169 vertex of which 2165 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Drop transitions removed 1323 transitions
Trivial Post-agglo rules discarded 1323 transitions
Performed 1323 trivial Post agglomeration. Transition count delta: 1323
Iterating post reduction 0 with 1428 rules applied. Total rules applied 1429 place count 2039 transition count 630
Reduce places removed 1323 places and 0 transitions.
Iterating post reduction 1 with 1323 rules applied. Total rules applied 2752 place count 716 transition count 630
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 2752 place count 716 transition count 336
Deduced a syphon composed of 294 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 693 rules applied. Total rules applied 3445 place count 317 transition count 336
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 3445 place count 317 transition count 315
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 3487 place count 296 transition count 315
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 3550 place count 233 transition count 252
Iterating global reduction 2 with 63 rules applied. Total rules applied 3613 place count 233 transition count 252
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 2 with 84 rules applied. Total rules applied 3697 place count 233 transition count 168
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 3718 place count 212 transition count 168
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 3718 place count 212 transition count 126
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 105 rules applied. Total rules applied 3823 place count 149 transition count 126
Applied a total of 3823 rules in 55 ms. Remains 149 /2169 variables (removed 2020) and now considering 126/1979 (removed 1853) transitions.
// Phase 1: matrix 126 rows 149 cols
[2023-03-11 03:39:21] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-11 03:39:21] [INFO ] Implicit Places using invariants in 61 ms returned [107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 63 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/2169 places, 126/1979 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 128/2169 places, 126/1979 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s93 1) (GEQ s92 1) (GEQ s91 1) (GEQ s90 1) (GEQ s97 1) (GEQ s96 1) (GEQ s95 1) (GEQ s94 1) (GEQ s89 1) (GEQ s88 1) (GEQ s87 1) (GEQ s86 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06 finished in 247 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(F(!p0))))'
Support contains 63 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 2064 transition count 1979
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 167 place count 2002 transition count 1917
Iterating global reduction 1 with 62 rules applied. Total rules applied 229 place count 2002 transition count 1917
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 291 place count 1940 transition count 1855
Iterating global reduction 1 with 62 rules applied. Total rules applied 353 place count 1940 transition count 1855
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 415 place count 1878 transition count 1793
Iterating global reduction 1 with 62 rules applied. Total rules applied 477 place count 1878 transition count 1793
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 539 place count 1816 transition count 1731
Iterating global reduction 1 with 62 rules applied. Total rules applied 601 place count 1816 transition count 1731
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 602 place count 1815 transition count 1731
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 664 place count 1753 transition count 1669
Iterating global reduction 2 with 62 rules applied. Total rules applied 726 place count 1753 transition count 1669
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 788 place count 1691 transition count 1607
Iterating global reduction 2 with 62 rules applied. Total rules applied 850 place count 1691 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 892 place count 1649 transition count 1565
Iterating global reduction 2 with 42 rules applied. Total rules applied 934 place count 1649 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 976 place count 1607 transition count 1523
Iterating global reduction 2 with 42 rules applied. Total rules applied 1018 place count 1607 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1060 place count 1565 transition count 1481
Iterating global reduction 2 with 42 rules applied. Total rules applied 1102 place count 1565 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1144 place count 1523 transition count 1439
Iterating global reduction 2 with 42 rules applied. Total rules applied 1186 place count 1523 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1228 place count 1481 transition count 1397
Iterating global reduction 2 with 42 rules applied. Total rules applied 1270 place count 1481 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1312 place count 1439 transition count 1355
Iterating global reduction 2 with 42 rules applied. Total rules applied 1354 place count 1439 transition count 1355
Applied a total of 1354 rules in 1005 ms. Remains 1439 /2169 variables (removed 730) and now considering 1355/1979 (removed 624) transitions.
// Phase 1: matrix 1355 rows 1439 cols
[2023-03-11 03:39:22] [INFO ] Computed 148 place invariants in 11 ms
[2023-03-11 03:39:22] [INFO ] Implicit Places using invariants in 315 ms returned [189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 316 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1418/2169 places, 1355/1979 transitions.
Applied a total of 0 rules in 52 ms. Remains 1418 /1418 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1373 ms. Remains : 1418/2169 places, 1355/1979 transitions.
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s128 1) (LT s126 1) (LT s132 1) (LT s130 1) (LT s136 1) (LT s134 1) (LT s140 1) (LT s138 1) (LT s144 1) (LT s142 1) (LT s146 1) (LT s85 1) (LT...], 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 explored 100000 steps with 18321 reset in 652 ms.
Product exploration explored 100000 steps with 18314 reset in 696 ms.
Computed a total of 1418 stabilizing places and 1355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1418 transition count 1355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, p0, 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, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
// Phase 1: matrix 1355 rows 1418 cols
[2023-03-11 03:39:25] [INFO ] Computed 127 place invariants in 16 ms
[2023-03-11 03:39:26] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 49 ms returned sat
[2023-03-11 03:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:26] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2023-03-11 03:39:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:39:27] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 46 ms returned sat
[2023-03-11 03:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:28] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2023-03-11 03:39:28] [INFO ] Computed and/alt/rep : 1332/1522/1332 causal constraints (skipped 2 transitions) in 81 ms.
[2023-03-11 03:39:28] [INFO ] Added : 0 causal constraints over 0 iterations in 197 ms. Result :sat
Could not prove EG p0
Support contains 63 out of 1418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1418/1418 places, 1355/1355 transitions.
Applied a total of 0 rules in 51 ms. Remains 1418 /1418 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
[2023-03-11 03:39:28] [INFO ] Invariant cache hit.
[2023-03-11 03:39:28] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-11 03:39:28] [INFO ] Invariant cache hit.
[2023-03-11 03:39:29] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2023-03-11 03:39:29] [INFO ] Invariant cache hit.
[2023-03-11 03:39:30] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1786 ms. Remains : 1418/1418 places, 1355/1355 transitions.
Computed a total of 1418 stabilizing places and 1355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1418 transition count 1355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, p0, p0]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 127 ms :[p0, p0, p0]
[2023-03-11 03:39:31] [INFO ] Invariant cache hit.
[2023-03-11 03:39:31] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 47 ms returned sat
[2023-03-11 03:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:32] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2023-03-11 03:39:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:39:33] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 48 ms returned sat
[2023-03-11 03:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:34] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2023-03-11 03:39:34] [INFO ] Computed and/alt/rep : 1332/1522/1332 causal constraints (skipped 2 transitions) in 58 ms.
[2023-03-11 03:39:34] [INFO ] Added : 0 causal constraints over 0 iterations in 170 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 120 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 18263 reset in 668 ms.
Product exploration explored 100000 steps with 18243 reset in 676 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0]
Support contains 63 out of 1418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1418/1418 places, 1355/1355 transitions.
Graph (complete) has 1628 edges and 1418 vertex of which 105 are kept as prefixes of interest. Removing 1313 places using SCC suffix rule.1 ms
Discarding 1313 places :
Also discarding 1208 output transitions
Drop transitions removed 1208 transitions
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 1 place count 105 transition count 189
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 22 place count 105 transition count 189
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 22 rules in 6 ms. Remains 105 /1418 variables (removed 1313) and now considering 189/1355 (removed 1166) transitions.
[2023-03-11 03:39:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 189 rows 105 cols
[2023-03-11 03:39:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:39:36] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/1418 places, 189/1355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 105/1418 places, 189/1355 transitions.
Support contains 63 out of 1418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1418/1418 places, 1355/1355 transitions.
Applied a total of 0 rules in 54 ms. Remains 1418 /1418 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
// Phase 1: matrix 1355 rows 1418 cols
[2023-03-11 03:39:36] [INFO ] Computed 127 place invariants in 5 ms
[2023-03-11 03:39:36] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-11 03:39:36] [INFO ] Invariant cache hit.
[2023-03-11 03:39:37] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2023-03-11 03:39:37] [INFO ] Invariant cache hit.
[2023-03-11 03:39:38] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1924 ms. Remains : 1418/1418 places, 1355/1355 transitions.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07 finished in 16753 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(G(p1)))))'
Support contains 126 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 2064 transition count 1979
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 167 place count 2002 transition count 1917
Iterating global reduction 1 with 62 rules applied. Total rules applied 229 place count 2002 transition count 1917
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 291 place count 1940 transition count 1855
Iterating global reduction 1 with 62 rules applied. Total rules applied 353 place count 1940 transition count 1855
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 415 place count 1878 transition count 1793
Iterating global reduction 1 with 62 rules applied. Total rules applied 477 place count 1878 transition count 1793
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 539 place count 1816 transition count 1731
Iterating global reduction 1 with 62 rules applied. Total rules applied 601 place count 1816 transition count 1731
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 602 place count 1815 transition count 1731
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 622 place count 1795 transition count 1711
Iterating global reduction 2 with 20 rules applied. Total rules applied 642 place count 1795 transition count 1711
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 662 place count 1775 transition count 1691
Iterating global reduction 2 with 20 rules applied. Total rules applied 682 place count 1775 transition count 1691
Applied a total of 682 rules in 633 ms. Remains 1775 /2169 variables (removed 394) and now considering 1691/1979 (removed 288) transitions.
// Phase 1: matrix 1691 rows 1775 cols
[2023-03-11 03:39:38] [INFO ] Computed 148 place invariants in 11 ms
[2023-03-11 03:39:39] [INFO ] Implicit Places using invariants in 372 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 383 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1754/2169 places, 1691/1979 transitions.
Applied a total of 0 rules in 77 ms. Remains 1754 /1754 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1095 ms. Remains : 1754/2169 places, 1691/1979 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s671 1) (LT s610 1) (LT s667 1) (LT s669 1) (LT s663 1) (LT s665 1) (LT s659 1) (LT s661 1) (LT s624 1) (LT s626 1) (LT s620 1) (LT s622 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1429 ms.
Product exploration explored 100000 steps with 50000 reset in 1448 ms.
Computed a total of 1754 stabilizing places and 1691 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1754 transition count 1691
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08 finished in 4558 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(F(p0))))'
Support contains 21 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 2064 transition count 1979
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 167 place count 2002 transition count 1917
Iterating global reduction 1 with 62 rules applied. Total rules applied 229 place count 2002 transition count 1917
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 291 place count 1940 transition count 1855
Iterating global reduction 1 with 62 rules applied. Total rules applied 353 place count 1940 transition count 1855
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 415 place count 1878 transition count 1793
Iterating global reduction 1 with 62 rules applied. Total rules applied 477 place count 1878 transition count 1793
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 539 place count 1816 transition count 1731
Iterating global reduction 1 with 62 rules applied. Total rules applied 601 place count 1816 transition count 1731
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 602 place count 1815 transition count 1731
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 664 place count 1753 transition count 1669
Iterating global reduction 2 with 62 rules applied. Total rules applied 726 place count 1753 transition count 1669
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 788 place count 1691 transition count 1607
Iterating global reduction 2 with 62 rules applied. Total rules applied 850 place count 1691 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 892 place count 1649 transition count 1565
Iterating global reduction 2 with 42 rules applied. Total rules applied 934 place count 1649 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 976 place count 1607 transition count 1523
Iterating global reduction 2 with 42 rules applied. Total rules applied 1018 place count 1607 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1060 place count 1565 transition count 1481
Iterating global reduction 2 with 42 rules applied. Total rules applied 1102 place count 1565 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1144 place count 1523 transition count 1439
Iterating global reduction 2 with 42 rules applied. Total rules applied 1186 place count 1523 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1228 place count 1481 transition count 1397
Iterating global reduction 2 with 42 rules applied. Total rules applied 1270 place count 1481 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1312 place count 1439 transition count 1355
Iterating global reduction 2 with 42 rules applied. Total rules applied 1354 place count 1439 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1396 place count 1397 transition count 1313
Iterating global reduction 2 with 42 rules applied. Total rules applied 1438 place count 1397 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1501 place count 1376 transition count 1271
Applied a total of 1501 rules in 1137 ms. Remains 1376 /2169 variables (removed 793) and now considering 1271/1979 (removed 708) transitions.
// Phase 1: matrix 1271 rows 1376 cols
[2023-03-11 03:39:43] [INFO ] Computed 127 place invariants in 7 ms
[2023-03-11 03:39:44] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-11 03:39:44] [INFO ] Invariant cache hit.
[2023-03-11 03:39:45] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
[2023-03-11 03:39:45] [INFO ] Invariant cache hit.
[2023-03-11 03:39:45] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1376/2169 places, 1271/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3032 ms. Remains : 1376/2169 places, 1271/1979 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT s46 1) (LT s49 1) (LT s48 1) (LT s51 1) (LT s50 1) (LT s53 1) (LT s52 1) (LT s55 1) (LT...], 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 explored 100000 steps with 1285 reset in 306 ms.
Product exploration explored 100000 steps with 1293 reset in 299 ms.
Computed a total of 1376 stabilizing places and 1271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1376 transition count 1271
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09 finished in 4117 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(p0)||G(F(p1))))'
Support contains 126 out of 2169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Graph (complete) has 2588 edges and 2169 vertex of which 1260 are kept as prefixes of interest. Removing 909 places using SCC suffix rule.9 ms
Discarding 909 places :
Also discarding 782 output transitions
Drop transitions removed 782 transitions
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 819 transitions
Trivial Post-agglo rules discarded 819 transitions
Performed 819 trivial Post agglomeration. Transition count delta: 819
Iterating post reduction 0 with 882 rules applied. Total rules applied 883 place count 1197 transition count 378
Reduce places removed 819 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 882 rules applied. Total rules applied 1765 place count 378 transition count 315
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 1828 place count 315 transition count 315
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1828 place count 315 transition count 273
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1912 place count 273 transition count 273
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1954 place count 252 transition count 252
Applied a total of 1954 rules in 42 ms. Remains 252 /2169 variables (removed 1917) and now considering 252/1979 (removed 1727) transitions.
// Phase 1: matrix 252 rows 252 cols
[2023-03-11 03:39:47] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-11 03:39:47] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-11 03:39:47] [INFO ] Invariant cache hit.
[2023-03-11 03:39:47] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-11 03:39:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 03:39:47] [INFO ] Invariant cache hit.
[2023-03-11 03:39:47] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/2169 places, 252/1979 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 252/2169 places, 252/1979 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s221 1) (GEQ s242 1)) (AND (GEQ s226 1) (GEQ s247 1)) (AND (GEQ s229 1) (GEQ s250 1)) (AND (GEQ s213 1) (GEQ s234 1)) (AND (GEQ s218 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1035 reset in 390 ms.
Product exploration explored 100000 steps with 1043 reset in 408 ms.
Computed a total of 252 stabilizing places and 252 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 252
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 451 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-10 finished in 1828 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((G(p0) U G(!p1))))'
Support contains 42 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 2064 transition count 1979
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 167 place count 2002 transition count 1917
Iterating global reduction 1 with 62 rules applied. Total rules applied 229 place count 2002 transition count 1917
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 291 place count 1940 transition count 1855
Iterating global reduction 1 with 62 rules applied. Total rules applied 353 place count 1940 transition count 1855
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 415 place count 1878 transition count 1793
Iterating global reduction 1 with 62 rules applied. Total rules applied 477 place count 1878 transition count 1793
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 519 place count 1836 transition count 1751
Iterating global reduction 1 with 42 rules applied. Total rules applied 561 place count 1836 transition count 1751
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 603 place count 1794 transition count 1709
Iterating global reduction 1 with 42 rules applied. Total rules applied 645 place count 1794 transition count 1709
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 687 place count 1752 transition count 1667
Iterating global reduction 1 with 42 rules applied. Total rules applied 729 place count 1752 transition count 1667
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 771 place count 1710 transition count 1625
Iterating global reduction 1 with 42 rules applied. Total rules applied 813 place count 1710 transition count 1625
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 855 place count 1668 transition count 1583
Iterating global reduction 1 with 42 rules applied. Total rules applied 897 place count 1668 transition count 1583
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 939 place count 1626 transition count 1541
Iterating global reduction 1 with 42 rules applied. Total rules applied 981 place count 1626 transition count 1541
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1023 place count 1584 transition count 1499
Iterating global reduction 1 with 42 rules applied. Total rules applied 1065 place count 1584 transition count 1499
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1107 place count 1542 transition count 1457
Iterating global reduction 1 with 42 rules applied. Total rules applied 1149 place count 1542 transition count 1457
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1191 place count 1500 transition count 1415
Iterating global reduction 1 with 42 rules applied. Total rules applied 1233 place count 1500 transition count 1415
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1275 place count 1458 transition count 1373
Iterating global reduction 1 with 42 rules applied. Total rules applied 1317 place count 1458 transition count 1373
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 1380 place count 1437 transition count 1331
Applied a total of 1380 rules in 1112 ms. Remains 1437 /2169 variables (removed 732) and now considering 1331/1979 (removed 648) transitions.
// Phase 1: matrix 1331 rows 1437 cols
[2023-03-11 03:39:49] [INFO ] Computed 128 place invariants in 13 ms
[2023-03-11 03:39:50] [INFO ] Implicit Places using invariants in 282 ms returned [592]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 283 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1436/2169 places, 1331/1979 transitions.
Applied a total of 0 rules in 60 ms. Remains 1436 /1436 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1457 ms. Remains : 1436/2169 places, 1331/1979 transitions.
Stuttering acceptance computed with spot in 177 ms :[p1, p1, true, (AND (NOT p1) (NOT p0)), p1]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s1329 1) (GEQ s1330 1) (GEQ s1325 1) (GEQ s1326 1) (GEQ s1327 1) (GEQ s1328 1) (GEQ s1321 1) (GEQ s1322 1) (GEQ s1323 1) (GEQ s1324 1) (GEQ s1...], 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]]
Entered a terminal (fully accepting) state of product in 652 steps with 0 reset in 4 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11 finished in 1669 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((F(p0)&&F(G((!p1 U !p2)))))))'
Support contains 126 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 2064 transition count 1979
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 167 place count 2002 transition count 1917
Iterating global reduction 1 with 62 rules applied. Total rules applied 229 place count 2002 transition count 1917
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 291 place count 1940 transition count 1855
Iterating global reduction 1 with 62 rules applied. Total rules applied 353 place count 1940 transition count 1855
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 415 place count 1878 transition count 1793
Iterating global reduction 1 with 62 rules applied. Total rules applied 477 place count 1878 transition count 1793
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 539 place count 1816 transition count 1731
Iterating global reduction 1 with 62 rules applied. Total rules applied 601 place count 1816 transition count 1731
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 602 place count 1815 transition count 1731
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 664 place count 1753 transition count 1669
Iterating global reduction 2 with 62 rules applied. Total rules applied 726 place count 1753 transition count 1669
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 788 place count 1691 transition count 1607
Iterating global reduction 2 with 62 rules applied. Total rules applied 850 place count 1691 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 892 place count 1649 transition count 1565
Iterating global reduction 2 with 42 rules applied. Total rules applied 934 place count 1649 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 976 place count 1607 transition count 1523
Iterating global reduction 2 with 42 rules applied. Total rules applied 1018 place count 1607 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1060 place count 1565 transition count 1481
Iterating global reduction 2 with 42 rules applied. Total rules applied 1102 place count 1565 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1144 place count 1523 transition count 1439
Iterating global reduction 2 with 42 rules applied. Total rules applied 1186 place count 1523 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1228 place count 1481 transition count 1397
Iterating global reduction 2 with 42 rules applied. Total rules applied 1270 place count 1481 transition count 1397
Applied a total of 1270 rules in 881 ms. Remains 1481 /2169 variables (removed 688) and now considering 1397/1979 (removed 582) transitions.
// Phase 1: matrix 1397 rows 1481 cols
[2023-03-11 03:39:51] [INFO ] Computed 148 place invariants in 5 ms
[2023-03-11 03:39:51] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-11 03:39:51] [INFO ] Invariant cache hit.
[2023-03-11 03:39:52] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2023-03-11 03:39:52] [INFO ] Invariant cache hit.
[2023-03-11 03:39:53] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1481/2169 places, 1397/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2703 ms. Remains : 1481/2169 places, 1397/1979 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), p2, p2]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s925 1) (GEQ s924 1) (GEQ s923 1) (GEQ s922 1) (GEQ s929 1) (GEQ s928 1) (GEQ s927 1) (GEQ s926 1) (GEQ s933 1) (GEQ s932 1) (GEQ s931 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1592 steps with 1 reset in 14 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-12 finished in 3079 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))'
Support contains 42 out of 2169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Graph (complete) has 2588 edges and 2169 vertex of which 1680 are kept as prefixes of interest. Removing 489 places using SCC suffix rule.3 ms
Discarding 489 places :
Also discarding 383 output transitions
Drop transitions removed 383 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 84 places :
Implicit places reduction removed 84 places
Drop transitions removed 1134 transitions
Trivial Post-agglo rules discarded 1134 transitions
Performed 1134 trivial Post agglomeration. Transition count delta: 1134
Iterating post reduction 0 with 1218 rules applied. Total rules applied 1219 place count 1575 transition count 441
Reduce places removed 1134 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 1155 rules applied. Total rules applied 2374 place count 441 transition count 420
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 2395 place count 420 transition count 420
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 2395 place count 420 transition count 273
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 2731 place count 231 transition count 273
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 2794 place count 168 transition count 210
Iterating global reduction 3 with 63 rules applied. Total rules applied 2857 place count 168 transition count 210
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 3 with 84 rules applied. Total rules applied 2941 place count 168 transition count 126
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 2962 place count 147 transition count 126
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 42 Pre rules applied. Total rules applied 2962 place count 147 transition count 84
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 105 rules applied. Total rules applied 3067 place count 84 transition count 84
Applied a total of 3067 rules in 27 ms. Remains 84 /2169 variables (removed 2085) and now considering 84/1979 (removed 1895) transitions.
// Phase 1: matrix 84 rows 84 cols
[2023-03-11 03:39:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:39:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 03:39:53] [INFO ] Invariant cache hit.
[2023-03-11 03:39:53] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-11 03:39:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:39:53] [INFO ] Invariant cache hit.
[2023-03-11 03:39:53] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/2169 places, 84/1979 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 84/2169 places, 84/1979 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s82 1) (GEQ s83 1) (GEQ s78 1) (GEQ s79 1) (GEQ s80 1) (GEQ s81 1) (GEQ s74 1) (GEQ s75 1) (GEQ s76 1) (GEQ s77 1) (GEQ s70 1) (GEQ s71 1) (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1776 steps with 191 reset in 13 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14 finished in 243 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(G((F(p1)&&p0)))))'
Support contains 126 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Discarding 105 places :
Implicit places reduction removed 105 places
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 2064 transition count 1979
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 125 place count 2044 transition count 1959
Iterating global reduction 1 with 20 rules applied. Total rules applied 145 place count 2044 transition count 1959
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 165 place count 2024 transition count 1939
Iterating global reduction 1 with 20 rules applied. Total rules applied 185 place count 2024 transition count 1939
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 205 place count 2004 transition count 1919
Iterating global reduction 1 with 20 rules applied. Total rules applied 225 place count 2004 transition count 1919
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 245 place count 1984 transition count 1899
Iterating global reduction 1 with 20 rules applied. Total rules applied 265 place count 1984 transition count 1899
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 266 place count 1983 transition count 1899
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 286 place count 1963 transition count 1879
Iterating global reduction 2 with 20 rules applied. Total rules applied 306 place count 1963 transition count 1879
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 326 place count 1943 transition count 1859
Iterating global reduction 2 with 20 rules applied. Total rules applied 346 place count 1943 transition count 1859
Applied a total of 346 rules in 677 ms. Remains 1943 /2169 variables (removed 226) and now considering 1859/1979 (removed 120) transitions.
// Phase 1: matrix 1859 rows 1943 cols
[2023-03-11 03:39:54] [INFO ] Computed 148 place invariants in 14 ms
[2023-03-11 03:39:54] [INFO ] Implicit Places using invariants in 381 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 383 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1922/2169 places, 1859/1979 transitions.
Applied a total of 0 rules in 90 ms. Remains 1922 /1922 variables (removed 0) and now considering 1859/1859 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1151 ms. Remains : 1922/2169 places, 1859/1979 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (GEQ s411 1) (GEQ s412 1) (GEQ s413 1) (GEQ s414 1) (GEQ s415 1) (GEQ s416 1) (GEQ s404 1) (GEQ s417 1) (GEQ s403 1) (GEQ s418 1) (GEQ s405 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15 finished in 1345 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((G(F(!p0)) U (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' '!(X((G(p0)||X(X(X(F(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' '!(X(X(F(!p0))))'
Found a Shortening insensitive property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07
Stuttering acceptance computed with spot in 113 ms :[p0, p0, p0]
Support contains 63 out of 2169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2169/2169 places, 1979/1979 transitions.
Graph (complete) has 2588 edges and 2169 vertex of which 105 are kept as prefixes of interest. Removing 2064 places using SCC suffix rule.3 ms
Discarding 2064 places :
Also discarding 1832 output transitions
Drop transitions removed 1832 transitions
Reduce places removed 21 places and 21 transitions.
Applied a total of 1 rules in 8 ms. Remains 84 /2169 variables (removed 2085) and now considering 126/1979 (removed 1853) transitions.
// Phase 1: matrix 126 rows 84 cols
[2023-03-11 03:39:55] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 03:39:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 03:39:55] [INFO ] Invariant cache hit.
[2023-03-11 03:39:55] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-11 03:39:55] [INFO ] Invariant cache hit.
[2023-03-11 03:39:55] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 84/2169 places, 126/1979 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 142 ms. Remains : 84/2169 places, 126/1979 transitions.
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s65 1) (LT s63 1) (LT s69 1) (LT s67 1) (LT s73 1) (LT s71 1) (LT s77 1) (LT s75 1) (LT s81 1) (LT s79 1) (LT s83 1) (LT s22 1) (LT s24 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33140 reset in 310 ms.
Product exploration explored 100000 steps with 33148 reset in 290 ms.
Computed a total of 84 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 126
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, p0, 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, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0]
[2023-03-11 03:39:56] [INFO ] Invariant cache hit.
[2023-03-11 03:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-11 03:39:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:57] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-11 03:39:57] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 03:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG p0
Support contains 63 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 84 /84 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-11 03:39:57] [INFO ] Invariant cache hit.
[2023-03-11 03:39:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 03:39:57] [INFO ] Invariant cache hit.
[2023-03-11 03:39:57] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-11 03:39:57] [INFO ] Invariant cache hit.
[2023-03-11 03:39:57] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 84/84 places, 126/126 transitions.
Computed a total of 84 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 126
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0, 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, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0]
[2023-03-11 03:39:58] [INFO ] Invariant cache hit.
[2023-03-11 03:39:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:58] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-11 03:39:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:58] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-11 03:39:58] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 03:39:58] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 153 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 33155 reset in 272 ms.
Product exploration explored 100000 steps with 33163 reset in 286 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, p0]
Support contains 63 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-11 03:39:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 03:39:59] [INFO ] Invariant cache hit.
[2023-03-11 03:39:59] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 84/84 places, 126/126 transitions.
Support contains 63 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 84 /84 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-11 03:39:59] [INFO ] Invariant cache hit.
[2023-03-11 03:39:59] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 03:39:59] [INFO ] Invariant cache hit.
[2023-03-11 03:39:59] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-11 03:39:59] [INFO ] Invariant cache hit.
[2023-03-11 03:39:59] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 84/84 places, 126/126 transitions.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07 finished in 4373 ms.
[2023-03-11 03:39:59] [INFO ] Flatten gal took : 83 ms
[2023-03-11 03:39:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-11 03:39:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2169 places, 1979 transitions and 4587 arcs took 22 ms.
Total runtime 131483 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1834/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1834/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1834/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02
Could not compute solution for formula : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03
Could not compute solution for formula : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07

BK_STOP 1678506884511

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02
ltl formula formula --ltl=/tmp/1834/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 2169 places, 1979 transitions and 4587 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 0.290 real 0.080 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1834/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1834/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1834/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1834/ltl_0_
ltl formula name FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03
ltl formula formula --ltl=/tmp/1834/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: =============================================================================
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 2169 places, 1979 transitions and 4587 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 0.200 real 0.040 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1834/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1834/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1834/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1834/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
*** 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:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07
ltl formula formula --ltl=/tmp/1834/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: =============================================================================
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 2169 places, 1979 transitions and 4587 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 0.200 real 0.070 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1834/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1834/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1834/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1834/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
*** 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:
*** 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:

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="FamilyReunion-COL-L00020M0002C001P001G001"
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 FamilyReunion-COL-L00020M0002C001P001G001, 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 r169-tall-167838855700308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00020M0002C001P001G001.tgz
mv FamilyReunion-COL-L00020M0002C001P001G001 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 ;