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.r167-tall-167838852900299.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 lolaxred
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852900299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:59 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.7K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 12:04 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 134K 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-L00010M0001C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678447915010

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 11:31:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 11:31:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 11:31:56] [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-10 11:31:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 11:31:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 694 ms
[2023-03-10 11:31:57] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2023-03-10 11:31:57] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 11:31:57] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-10 11:31:57] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11 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 13 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 10004 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-10 11:31:57] [INFO ] Computed 33 place invariants in 15 ms
[2023-03-10 11:31:57] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 11:31:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 11:31:57] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-10 11:31:57] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-03-10 11:31:57] [INFO ] Flatten gal took : 39 ms
[2023-03-10 11:31:57] [INFO ] Flatten gal took : 11 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
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
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
[2023-03-10 11:31:57] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 24 ms.
[2023-03-10 11:31:57] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 11 places in 11 ms
Reduce places removed 19 places and 0 transitions.
Support contains 482 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 1225 transition count 1069
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 157 place count 1203 transition count 1047
Iterating global reduction 1 with 22 rules applied. Total rules applied 179 place count 1203 transition count 1047
Applied a total of 179 rules in 147 ms. Remains 1203 /1360 variables (removed 157) and now considering 1047/1069 (removed 22) transitions.
// Phase 1: matrix 1047 rows 1203 cols
[2023-03-10 11:31:58] [INFO ] Computed 197 place invariants in 41 ms
[2023-03-10 11:31:58] [INFO ] Implicit Places using invariants in 460 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 198, 552, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 463 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1179/1360 places, 1047/1069 transitions.
Applied a total of 0 rules in 32 ms. Remains 1179 /1179 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 642 ms. Remains : 1179/1360 places, 1047/1069 transitions.
Support contains 482 out of 1179 places after structural reductions.
[2023-03-10 11:31:58] [INFO ] Flatten gal took : 59 ms
[2023-03-10 11:31:58] [INFO ] Flatten gal took : 55 ms
[2023-03-10 11:31:58] [INFO ] Input system was already deterministic with 1047 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1047 rows 1179 cols
[2023-03-10 11:31:59] [INFO ] Computed 173 place invariants in 15 ms
[2023-03-10 11:31:59] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 11:31:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-10 11:31:59] [INFO ] [Nat]Absence check using 31 positive and 142 generalized place invariants in 40 ms returned sat
[2023-03-10 11:31:59] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 1179 stabilizing places and 1047 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1179 transition count 1047
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' '!((F(G(p0))||G(p1)))'
Support contains 112 out of 1179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Graph (complete) has 1533 edges and 1179 vertex of which 1164 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.7 ms
Discarding 15 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 11 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Drop transitions removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 517 rules applied. Total rules applied 518 place count 1098 transition count 574
Reduce places removed 462 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 484 rules applied. Total rules applied 1002 place count 636 transition count 552
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1024 place count 614 transition count 552
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 1024 place count 614 transition count 453
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 44 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1266 place count 471 transition count 453
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 33 rules applied. Total rules applied 1299 place count 449 transition count 442
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1310 place count 438 transition count 442
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1310 place count 438 transition count 431
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1332 place count 427 transition count 431
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1355 place count 404 transition count 398
Iterating global reduction 5 with 23 rules applied. Total rules applied 1378 place count 404 transition count 398
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 5 with 33 rules applied. Total rules applied 1411 place count 393 transition count 376
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1433 place count 371 transition count 376
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 1433 place count 371 transition count 354
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1477 place count 349 transition count 354
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1478 place count 348 transition count 343
Iterating global reduction 7 with 1 rules applied. Total rules applied 1479 place count 348 transition count 343
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1490 place count 337 transition count 332
Iterating global reduction 7 with 11 rules applied. Total rules applied 1501 place count 337 transition count 332
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 1567 place count 304 transition count 299
Applied a total of 1567 rules in 109 ms. Remains 304 /1179 variables (removed 875) and now considering 299/1047 (removed 748) transitions.
// Phase 1: matrix 299 rows 304 cols
[2023-03-10 11:31:59] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-10 11:32:00] [INFO ] Implicit Places using invariants in 103 ms returned [133, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 270, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 105 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/1179 places, 299/1047 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 280 transition count 288
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 269 transition count 288
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 269 transition count 277
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 258 transition count 277
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 66 place count 247 transition count 277
Applied a total of 66 rules in 15 ms. Remains 247 /280 variables (removed 33) and now considering 277/299 (removed 22) transitions.
// Phase 1: matrix 277 rows 247 cols
[2023-03-10 11:32:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 11:32:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-10 11:32:00] [INFO ] Invariant cache hit.
[2023-03-10 11:32:00] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/1179 places, 277/1047 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 374 ms. Remains : 247/1179 places, 277/1047 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 1 (ADD s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99)) (LEQ (ADD s234 s235) (ADD s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 861 reset in 395 ms.
Product exploration explored 100000 steps with 862 reset in 316 ms.
Computed a total of 247 stabilizing places and 277 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 277
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) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 finished in 1555 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((X(X(F(p0)))&&(p1||G(p2)))))'
Support contains 56 out of 1179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Reduce places removed 28 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1096 transition count 1047
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 128 place count 1051 transition count 1002
Iterating global reduction 1 with 45 rules applied. Total rules applied 173 place count 1051 transition count 1002
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 195 place count 1029 transition count 970
Iterating global reduction 1 with 22 rules applied. Total rules applied 217 place count 1029 transition count 970
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 228 place count 1018 transition count 970
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 249 place count 997 transition count 949
Iterating global reduction 2 with 21 rules applied. Total rules applied 270 place count 997 transition count 949
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 291 place count 976 transition count 918
Iterating global reduction 2 with 21 rules applied. Total rules applied 312 place count 976 transition count 918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 322 place count 966 transition count 908
Iterating global reduction 2 with 10 rules applied. Total rules applied 332 place count 966 transition count 908
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 342 place count 956 transition count 898
Iterating global reduction 2 with 10 rules applied. Total rules applied 352 place count 956 transition count 898
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 362 place count 946 transition count 888
Iterating global reduction 2 with 10 rules applied. Total rules applied 372 place count 946 transition count 888
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 382 place count 936 transition count 878
Iterating global reduction 2 with 10 rules applied. Total rules applied 392 place count 936 transition count 878
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 402 place count 926 transition count 868
Iterating global reduction 2 with 10 rules applied. Total rules applied 412 place count 926 transition count 868
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 422 place count 916 transition count 858
Iterating global reduction 2 with 10 rules applied. Total rules applied 432 place count 916 transition count 858
Applied a total of 432 rules in 620 ms. Remains 916 /1179 variables (removed 263) and now considering 858/1047 (removed 189) transitions.
// Phase 1: matrix 858 rows 916 cols
[2023-03-10 11:32:02] [INFO ] Computed 91 place invariants in 16 ms
[2023-03-10 11:32:02] [INFO ] Implicit Places using invariants in 183 ms returned [618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 783]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 188 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 904/1179 places, 858/1047 transitions.
Applied a total of 0 rules in 54 ms. Remains 904 /904 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 862 ms. Remains : 904/1179 places, 858/1047 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 4}]], initial=0, aps=[p1:(GT 2 (ADD s497 s498 s499 s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518)), p2:(LEQ s332 (ADD s209 s210...], 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]]
Product exploration explored 100000 steps with 33333 reset in 652 ms.
Product exploration explored 100000 steps with 33333 reset in 526 ms.
Computed a total of 904 stabilizing places and 858 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 904 transition count 858
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), true, (X (X (NOT p2))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 17 factoid took 404 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 finished in 2985 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 33 out of 1179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Reduce places removed 28 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1096 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 139 place count 1040 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 195 place count 1040 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 228 place count 1007 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 261 place count 1007 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 283 place count 985 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 305 place count 985 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 316 place count 974 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 348 place count 942 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 380 place count 942 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 401 place count 921 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 422 place count 921 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 443 place count 900 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 464 place count 900 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 485 place count 879 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 506 place count 879 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 527 place count 858 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 548 place count 858 transition count 790
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 569 place count 837 transition count 769
Iterating global reduction 2 with 21 rules applied. Total rules applied 590 place count 837 transition count 769
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 611 place count 816 transition count 748
Iterating global reduction 2 with 21 rules applied. Total rules applied 632 place count 816 transition count 748
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 643 place count 805 transition count 737
Iterating global reduction 2 with 11 rules applied. Total rules applied 654 place count 805 transition count 737
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 665 place count 794 transition count 726
Iterating global reduction 2 with 11 rules applied. Total rules applied 676 place count 794 transition count 726
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 687 place count 783 transition count 715
Iterating global reduction 2 with 11 rules applied. Total rules applied 698 place count 783 transition count 715
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 709 place count 772 transition count 704
Iterating global reduction 2 with 11 rules applied. Total rules applied 720 place count 772 transition count 704
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 731 place count 761 transition count 693
Iterating global reduction 2 with 11 rules applied. Total rules applied 742 place count 761 transition count 693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 753 place count 750 transition count 682
Iterating global reduction 2 with 11 rules applied. Total rules applied 764 place count 750 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 775 place count 750 transition count 671
Applied a total of 775 rules in 563 ms. Remains 750 /1179 variables (removed 429) and now considering 671/1047 (removed 376) transitions.
// Phase 1: matrix 671 rows 750 cols
[2023-03-10 11:32:04] [INFO ] Computed 91 place invariants in 9 ms
[2023-03-10 11:32:05] [INFO ] Implicit Places using invariants in 167 ms returned [330, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 606]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 169 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 737/1179 places, 671/1047 transitions.
Applied a total of 0 rules in 12 ms. Remains 737 /737 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 744 ms. Remains : 737/1179 places, 671/1047 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 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:(OR (GT (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87)) (GT (ADD s616 s617 s618 s619 s620 s621 s62...], 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 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 finished in 841 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)&&(p1 U p2)))'
Support contains 91 out of 1179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Graph (complete) has 1533 edges and 1179 vertex of which 1163 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Discarding 16 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 11 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 473 rules applied. Total rules applied 474 place count 1119 transition count 596
Reduce places removed 440 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 1 with 484 rules applied. Total rules applied 958 place count 679 transition count 552
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 1002 place count 635 transition count 552
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 176 Pre rules applied. Total rules applied 1002 place count 635 transition count 376
Deduced a syphon composed of 176 places in 0 ms
Ensure Unique test removed 77 places
Reduce places removed 253 places and 0 transitions.
Iterating global reduction 3 with 429 rules applied. Total rules applied 1431 place count 382 transition count 376
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 22 rules applied. Total rules applied 1453 place count 371 transition count 365
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1464 place count 360 transition count 365
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1464 place count 360 transition count 354
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1486 place count 349 transition count 354
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1498 place count 337 transition count 332
Iterating global reduction 5 with 12 rules applied. Total rules applied 1510 place count 337 transition count 332
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 5 with 11 rules applied. Total rules applied 1521 place count 326 transition count 332
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1521 place count 326 transition count 310
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1565 place count 304 transition count 310
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1566 place count 303 transition count 299
Iterating global reduction 6 with 1 rules applied. Total rules applied 1567 place count 303 transition count 299
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 6 with 11 rules applied. Total rules applied 1578 place count 292 transition count 299
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1578 place count 292 transition count 288
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1600 place count 281 transition count 288
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1622 place count 270 transition count 277
Applied a total of 1622 rules in 72 ms. Remains 270 /1179 variables (removed 909) and now considering 277/1047 (removed 770) transitions.
// Phase 1: matrix 277 rows 270 cols
[2023-03-10 11:32:05] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-10 11:32:05] [INFO ] Implicit Places using invariants in 76 ms returned [134, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 247]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 78 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1179 places, 277/1047 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 257 transition count 255
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 235 transition count 255
Applied a total of 44 rules in 9 ms. Remains 235 /257 variables (removed 22) and now considering 255/277 (removed 22) transitions.
// Phase 1: matrix 255 rows 235 cols
[2023-03-10 11:32:05] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 11:32:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-10 11:32:05] [INFO ] Invariant cache hit.
[2023-03-10 11:32:05] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 235/1179 places, 255/1047 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 294 ms. Remains : 235/1179 places, 255/1047 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p2), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(LEQ (ADD s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223) (ADD s55 s56 s57 s58 s59 s60 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 877 steps with 7 reset in 5 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 finished in 434 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(X(F(p0)))))'
Support contains 1 out of 1179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Reduce places removed 27 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1097 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 138 place count 1041 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 194 place count 1041 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 227 place count 1008 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 260 place count 1008 transition count 948
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 271 place count 997 transition count 948
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 293 place count 975 transition count 916
Iterating global reduction 2 with 22 rules applied. Total rules applied 315 place count 975 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 326 place count 964 transition count 916
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 358 place count 932 transition count 874
Iterating global reduction 3 with 32 rules applied. Total rules applied 390 place count 932 transition count 874
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 411 place count 911 transition count 853
Iterating global reduction 3 with 21 rules applied. Total rules applied 432 place count 911 transition count 853
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 453 place count 890 transition count 832
Iterating global reduction 3 with 21 rules applied. Total rules applied 474 place count 890 transition count 832
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 495 place count 869 transition count 811
Iterating global reduction 3 with 21 rules applied. Total rules applied 516 place count 869 transition count 811
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 537 place count 848 transition count 790
Iterating global reduction 3 with 21 rules applied. Total rules applied 558 place count 848 transition count 790
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 579 place count 827 transition count 769
Iterating global reduction 3 with 21 rules applied. Total rules applied 600 place count 827 transition count 769
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 621 place count 806 transition count 748
Iterating global reduction 3 with 21 rules applied. Total rules applied 642 place count 806 transition count 748
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 653 place count 795 transition count 737
Iterating global reduction 3 with 11 rules applied. Total rules applied 664 place count 795 transition count 737
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 675 place count 784 transition count 726
Iterating global reduction 3 with 11 rules applied. Total rules applied 686 place count 784 transition count 726
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 697 place count 773 transition count 715
Iterating global reduction 3 with 11 rules applied. Total rules applied 708 place count 773 transition count 715
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 719 place count 762 transition count 704
Iterating global reduction 3 with 11 rules applied. Total rules applied 730 place count 762 transition count 704
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 741 place count 751 transition count 693
Iterating global reduction 3 with 11 rules applied. Total rules applied 752 place count 751 transition count 693
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 763 place count 740 transition count 682
Iterating global reduction 3 with 11 rules applied. Total rules applied 774 place count 740 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 785 place count 740 transition count 671
Applied a total of 785 rules in 304 ms. Remains 740 /1179 variables (removed 439) and now considering 671/1047 (removed 376) transitions.
// Phase 1: matrix 671 rows 740 cols
[2023-03-10 11:32:05] [INFO ] Computed 81 place invariants in 11 ms
[2023-03-10 11:32:06] [INFO ] Implicit Places using invariants in 194 ms returned [331, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 607]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 195 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 727/1179 places, 671/1047 transitions.
Applied a total of 0 rules in 14 ms. Remains 727 /727 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 514 ms. Remains : 727/1179 places, 671/1047 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 1 s305)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 324 ms.
Product exploration explored 100000 steps with 25000 reset in 329 ms.
Computed a total of 727 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 727 transition count 671
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, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 544 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=181 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 727 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 727/727 places, 671/671 transitions.
Applied a total of 0 rules in 18 ms. Remains 727 /727 variables (removed 0) and now considering 671/671 (removed 0) transitions.
// Phase 1: matrix 671 rows 727 cols
[2023-03-10 11:32:07] [INFO ] Computed 68 place invariants in 9 ms
[2023-03-10 11:32:07] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-10 11:32:07] [INFO ] Invariant cache hit.
[2023-03-10 11:32:08] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-10 11:32:08] [INFO ] Invariant cache hit.
[2023-03-10 11:32:08] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 727/727 places, 671/671 transitions.
Computed a total of 727 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 727 transition count 671
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, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 543 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=181 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 354 ms.
Product exploration explored 100000 steps with 25000 reset in 360 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 727 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 727/727 places, 671/671 transitions.
Graph (complete) has 815 edges and 727 vertex of which 724 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 256 rules applied. Total rules applied 257 place count 724 transition count 667
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 300 Pre rules applied. Total rules applied 257 place count 724 transition count 711
Deduced a syphon composed of 555 places in 0 ms
Iterating global reduction 1 with 300 rules applied. Total rules applied 557 place count 724 transition count 711
Discarding 409 places :
Symmetric choice reduction at 1 with 409 rule applications. Total rules 966 place count 315 transition count 302
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 1 with 409 rules applied. Total rules applied 1375 place count 315 transition count 302
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 1408 place count 315 transition count 302
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1419 place count 304 transition count 291
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1430 place count 304 transition count 291
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1441 place count 304 transition count 313
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1452 place count 293 transition count 291
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1463 place count 293 transition count 291
Deduced a syphon composed of 168 places in 0 ms
Applied a total of 1463 rules in 83 ms. Remains 293 /727 variables (removed 434) and now considering 291/671 (removed 380) transitions.
[2023-03-10 11:32:10] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 291 rows 293 cols
[2023-03-10 11:32:10] [INFO ] Computed 68 place invariants in 1 ms
[2023-03-10 11:32:11] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 293/727 places, 291/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 293/727 places, 291/671 transitions.
Support contains 1 out of 727 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 727/727 places, 671/671 transitions.
Applied a total of 0 rules in 35 ms. Remains 727 /727 variables (removed 0) and now considering 671/671 (removed 0) transitions.
// Phase 1: matrix 671 rows 727 cols
[2023-03-10 11:32:11] [INFO ] Computed 68 place invariants in 4 ms
[2023-03-10 11:32:11] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-10 11:32:11] [INFO ] Invariant cache hit.
[2023-03-10 11:32:11] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-10 11:32:11] [INFO ] Invariant cache hit.
[2023-03-10 11:32:11] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 727/727 places, 671/671 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07 finished in 6358 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))'
Support contains 11 out of 1179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Graph (complete) has 1533 edges and 1179 vertex of which 829 are kept as prefixes of interest. Removing 350 places using SCC suffix rule.2 ms
Discarding 350 places :
Also discarding 277 output transitions
Drop transitions removed 277 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 550 rules applied. Total rules applied 551 place count 774 transition count 253
Reduce places removed 506 places and 0 transitions.
Iterating post reduction 1 with 506 rules applied. Total rules applied 1057 place count 268 transition count 253
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 1057 place count 268 transition count 209
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 1167 place count 202 transition count 209
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 2 with 22 rules applied. Total rules applied 1189 place count 202 transition count 187
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1211 place count 180 transition count 187
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1234 place count 157 transition count 154
Iterating global reduction 4 with 23 rules applied. Total rules applied 1257 place count 157 transition count 154
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 44 rules applied. Total rules applied 1301 place count 146 transition count 121
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1323 place count 124 transition count 121
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1323 place count 124 transition count 99
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1367 place count 102 transition count 99
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1368 place count 101 transition count 88
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 101 transition count 88
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 44 rules applied. Total rules applied 1413 place count 79 transition count 66
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1424 place count 68 transition count 66
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1424 place count 68 transition count 55
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1446 place count 57 transition count 55
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 1457 place count 46 transition count 44
Applied a total of 1457 rules in 29 ms. Remains 46 /1179 variables (removed 1133) and now considering 44/1047 (removed 1003) transitions.
// Phase 1: matrix 44 rows 46 cols
[2023-03-10 11:32:12] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 11:32:12] [INFO ] Implicit Places using invariants in 40 ms returned [11, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/1179 places, 44/1047 transitions.
Reduce places removed 11 places and 11 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 33 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 22 transition count 22
Applied a total of 22 rules in 1 ms. Remains 22 /44 variables (removed 22) and now considering 22/44 (removed 22) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 11:32:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:32:12] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 11:32:12] [INFO ] Invariant cache hit.
[2023-03-10 11:32:12] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/1179 places, 22/1047 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 22/1179 places, 22/1047 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2910 steps with 617 reset in 9 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 finished in 163 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&&(p1||F(p2)||G(p3)))))'
Support contains 101 out of 1179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Reduce places removed 26 places and 0 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 1120 transition count 1047
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 93 place count 1086 transition count 1013
Iterating global reduction 1 with 34 rules applied. Total rules applied 127 place count 1086 transition count 1013
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 138 place count 1075 transition count 1002
Iterating global reduction 1 with 11 rules applied. Total rules applied 149 place count 1075 transition count 1002
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 150 place count 1074 transition count 991
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 1074 transition count 991
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 162 place count 1063 transition count 991
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 173 place count 1052 transition count 980
Iterating global reduction 2 with 11 rules applied. Total rules applied 184 place count 1052 transition count 980
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 195 place count 1041 transition count 969
Iterating global reduction 2 with 11 rules applied. Total rules applied 206 place count 1041 transition count 969
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 217 place count 1030 transition count 958
Iterating global reduction 2 with 11 rules applied. Total rules applied 228 place count 1030 transition count 958
Applied a total of 228 rules in 175 ms. Remains 1030 /1179 variables (removed 149) and now considering 958/1047 (removed 89) transitions.
// Phase 1: matrix 958 rows 1030 cols
[2023-03-10 11:32:12] [INFO ] Computed 114 place invariants in 13 ms
[2023-03-10 11:32:12] [INFO ] Implicit Places using invariants in 232 ms returned [573, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 235 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1007/1179 places, 958/1047 transitions.
Applied a total of 0 rules in 19 ms. Remains 1007 /1007 variables (removed 0) and now considering 958/958 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 429 ms. Remains : 1007/1179 places, 958/1047 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 3}]], initial=2, aps=[p2:(LEQ (ADD s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462) (ADD s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 ...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 869 ms.
Product exploration explored 100000 steps with 50000 reset in 877 ms.
Computed a total of 1007 stabilizing places and 958 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1007 transition count 958
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 p2 (NOT p3) p0 p1), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (G p2)), (F (OR (G p3) (G (NOT p3)))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1) (NOT p2) p3)))
Knowledge based reduction with 12 factoid took 178 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 finished in 2740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||F(p0)))))))'
Support contains 1 out of 1179 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Graph (complete) has 1533 edges and 1179 vertex of which 1028 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.3 ms
Discarding 151 places :
Also discarding 123 output transitions
Drop transitions removed 123 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 605 rules applied. Total rules applied 606 place count 973 transition count 352
Reduce places removed 561 places and 0 transitions.
Iterating post reduction 1 with 561 rules applied. Total rules applied 1167 place count 412 transition count 352
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 1167 place count 412 transition count 231
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 1464 place count 236 transition count 231
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 2 with 22 rules applied. Total rules applied 1486 place count 236 transition count 209
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1508 place count 214 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1508 place count 214 transition count 198
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1530 place count 203 transition count 198
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1553 place count 180 transition count 165
Iterating global reduction 4 with 23 rules applied. Total rules applied 1576 place count 180 transition count 165
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 44 rules applied. Total rules applied 1620 place count 169 transition count 132
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1642 place count 147 transition count 132
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1642 place count 147 transition count 110
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1686 place count 125 transition count 110
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1687 place count 124 transition count 99
Iterating global reduction 6 with 1 rules applied. Total rules applied 1688 place count 124 transition count 99
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 44 rules applied. Total rules applied 1732 place count 102 transition count 77
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1743 place count 91 transition count 77
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1743 place count 91 transition count 66
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1765 place count 80 transition count 66
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 1776 place count 69 transition count 55
Applied a total of 1776 rules in 31 ms. Remains 69 /1179 variables (removed 1110) and now considering 55/1047 (removed 992) transitions.
// Phase 1: matrix 55 rows 69 cols
[2023-03-10 11:32:14] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 11:32:15] [INFO ] Implicit Places using invariants in 59 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 45, 57]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 61 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/1179 places, 55/1047 transitions.
Reduce places removed 11 places and 11 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 45 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 34 transition count 33
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 24 transition count 23
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 24 transition count 23
Applied a total of 42 rules in 2 ms. Remains 24 /56 variables (removed 32) and now considering 23/55 (removed 32) transitions.
// Phase 1: matrix 23 rows 24 cols
[2023-03-10 11:32:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 11:32:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:32:15] [INFO ] Invariant cache hit.
[2023-03-10 11:32:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/1179 places, 23/1047 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 24/1179 places, 23/1047 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10 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:(LEQ 2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10 finished in 226 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 46 out of 1179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Reduce places removed 17 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 1118 transition count 1047
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 94 place count 1085 transition count 1014
Iterating global reduction 1 with 33 rules applied. Total rules applied 127 place count 1085 transition count 1014
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 139 place count 1073 transition count 992
Iterating global reduction 1 with 12 rules applied. Total rules applied 151 place count 1073 transition count 992
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 162 place count 1062 transition count 992
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 174 place count 1050 transition count 970
Iterating global reduction 2 with 12 rules applied. Total rules applied 186 place count 1050 transition count 970
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 197 place count 1039 transition count 970
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 208 place count 1028 transition count 959
Iterating global reduction 3 with 11 rules applied. Total rules applied 219 place count 1028 transition count 959
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 230 place count 1017 transition count 948
Iterating global reduction 3 with 11 rules applied. Total rules applied 241 place count 1017 transition count 948
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 252 place count 1006 transition count 937
Iterating global reduction 3 with 11 rules applied. Total rules applied 263 place count 1006 transition count 937
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 274 place count 995 transition count 926
Iterating global reduction 3 with 11 rules applied. Total rules applied 285 place count 995 transition count 926
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 296 place count 984 transition count 915
Iterating global reduction 3 with 11 rules applied. Total rules applied 307 place count 984 transition count 915
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 318 place count 973 transition count 904
Iterating global reduction 3 with 11 rules applied. Total rules applied 329 place count 973 transition count 904
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 340 place count 962 transition count 893
Iterating global reduction 3 with 11 rules applied. Total rules applied 351 place count 962 transition count 893
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 362 place count 951 transition count 882
Iterating global reduction 3 with 11 rules applied. Total rules applied 373 place count 951 transition count 882
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 384 place count 940 transition count 871
Iterating global reduction 3 with 11 rules applied. Total rules applied 395 place count 940 transition count 871
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 406 place count 929 transition count 860
Iterating global reduction 3 with 11 rules applied. Total rules applied 417 place count 929 transition count 860
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 428 place count 918 transition count 849
Iterating global reduction 3 with 11 rules applied. Total rules applied 439 place count 918 transition count 849
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 450 place count 907 transition count 838
Iterating global reduction 3 with 11 rules applied. Total rules applied 461 place count 907 transition count 838
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 472 place count 896 transition count 827
Iterating global reduction 3 with 11 rules applied. Total rules applied 483 place count 896 transition count 827
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 494 place count 896 transition count 816
Applied a total of 494 rules in 383 ms. Remains 896 /1179 variables (removed 283) and now considering 816/1047 (removed 231) transitions.
// Phase 1: matrix 816 rows 896 cols
[2023-03-10 11:32:15] [INFO ] Computed 91 place invariants in 8 ms
[2023-03-10 11:32:15] [INFO ] Implicit Places using invariants in 210 ms returned [452, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 763]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 211 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 883/1179 places, 816/1047 transitions.
Applied a total of 0 rules in 17 ms. Remains 883 /883 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 883/1179 places, 816/1047 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87) (ADD s738 s739)), p0:(LEQ (ADD s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s...], 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 24974 reset in 524 ms.
Product exploration explored 100000 steps with 25051 reset in 532 ms.
Computed a total of 883 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 883 transition count 816
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) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 521 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 816 rows 883 cols
[2023-03-10 11:32:17] [INFO ] Computed 78 place invariants in 10 ms
[2023-03-10 11:32:18] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 11:32:18] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 18 ms returned sat
[2023-03-10 11:32:18] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 11:32:18] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-10 11:32:18] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 485 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=121 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 690 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
[2023-03-10 11:32:19] [INFO ] Invariant cache hit.
[2023-03-10 11:32:20] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 22 ms returned sat
[2023-03-10 11:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:32:20] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-10 11:32:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:32:20] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 25 ms returned sat
[2023-03-10 11:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:32:21] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2023-03-10 11:32:21] [INFO ] Computed and/alt/rep : 803/891/803 causal constraints (skipped 2 transitions) in 43 ms.
[2023-03-10 11:32:28] [INFO ] Added : 621 causal constraints over 125 iterations in 6598 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 46 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 816/816 transitions.
Applied a total of 0 rules in 20 ms. Remains 883 /883 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2023-03-10 11:32:28] [INFO ] Invariant cache hit.
[2023-03-10 11:32:28] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-10 11:32:28] [INFO ] Invariant cache hit.
[2023-03-10 11:32:28] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2023-03-10 11:32:28] [INFO ] Invariant cache hit.
[2023-03-10 11:32:29] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 883/883 places, 816/816 transitions.
Computed a total of 883 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 883 transition count 816
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) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 476 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 11:32:30] [INFO ] Invariant cache hit.
[2023-03-10 11:32:30] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 11:32:30] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 17 ms returned sat
[2023-03-10 11:32:30] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 11:32:30] [INFO ] After 500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-10 11:32:30] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 367 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=183 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 620 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
[2023-03-10 11:32:31] [INFO ] Invariant cache hit.
[2023-03-10 11:32:32] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 21 ms returned sat
[2023-03-10 11:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:32:32] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-10 11:32:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:32:32] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 28 ms returned sat
[2023-03-10 11:32:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:32:33] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2023-03-10 11:32:33] [INFO ] Computed and/alt/rep : 803/891/803 causal constraints (skipped 2 transitions) in 44 ms.
[2023-03-10 11:32:39] [INFO ] Added : 621 causal constraints over 125 iterations in 6469 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 33291 reset in 574 ms.
Product exploration explored 100000 steps with 33538 reset in 594 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Support contains 46 out of 883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 883/883 places, 816/816 transitions.
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 297 rules applied. Total rules applied 297 place count 883 transition count 816
Performed 275 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 275 Pre rules applied. Total rules applied 297 place count 883 transition count 860
Deduced a syphon composed of 572 places in 0 ms
Iterating global reduction 1 with 275 rules applied. Total rules applied 572 place count 883 transition count 860
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 583 place count 872 transition count 860
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 583 place count 872 transition count 860
Deduced a syphon composed of 583 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 594 place count 872 transition count 860
Discarding 363 places :
Symmetric choice reduction at 2 with 363 rule applications. Total rules 957 place count 509 transition count 497
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 2 with 363 rules applied. Total rules applied 1320 place count 509 transition count 497
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 1353 place count 509 transition count 497
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1364 place count 498 transition count 486
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1375 place count 498 transition count 486
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 264 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 1397 place count 498 transition count 530
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1430 place count 465 transition count 464
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 1463 place count 465 transition count 464
Deduced a syphon composed of 231 places in 0 ms
Applied a total of 1463 rules in 76 ms. Remains 465 /883 variables (removed 418) and now considering 464/816 (removed 352) transitions.
[2023-03-10 11:32:41] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 464 rows 465 cols
[2023-03-10 11:32:41] [INFO ] Computed 67 place invariants in 2 ms
[2023-03-10 11:32:41] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 465/883 places, 464/816 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 465/883 places, 464/816 transitions.
Support contains 46 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 816/816 transitions.
Applied a total of 0 rules in 16 ms. Remains 883 /883 variables (removed 0) and now considering 816/816 (removed 0) transitions.
// Phase 1: matrix 816 rows 883 cols
[2023-03-10 11:32:41] [INFO ] Computed 78 place invariants in 4 ms
[2023-03-10 11:32:41] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-10 11:32:41] [INFO ] Invariant cache hit.
[2023-03-10 11:32:42] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2023-03-10 11:32:42] [INFO ] Invariant cache hit.
[2023-03-10 11:32:42] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1021 ms. Remains : 883/883 places, 816/816 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 finished in 27705 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 22 out of 1179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Reduce places removed 28 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1096 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 139 place count 1040 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 195 place count 1040 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 228 place count 1007 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 261 place count 1007 transition count 948
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 272 place count 996 transition count 948
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 294 place count 974 transition count 916
Iterating global reduction 2 with 22 rules applied. Total rules applied 316 place count 974 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 327 place count 963 transition count 916
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 359 place count 931 transition count 874
Iterating global reduction 3 with 32 rules applied. Total rules applied 391 place count 931 transition count 874
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 412 place count 910 transition count 853
Iterating global reduction 3 with 21 rules applied. Total rules applied 433 place count 910 transition count 853
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 454 place count 889 transition count 832
Iterating global reduction 3 with 21 rules applied. Total rules applied 475 place count 889 transition count 832
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 496 place count 868 transition count 811
Iterating global reduction 3 with 21 rules applied. Total rules applied 517 place count 868 transition count 811
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 538 place count 847 transition count 790
Iterating global reduction 3 with 21 rules applied. Total rules applied 559 place count 847 transition count 790
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 580 place count 826 transition count 769
Iterating global reduction 3 with 21 rules applied. Total rules applied 601 place count 826 transition count 769
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 622 place count 805 transition count 748
Iterating global reduction 3 with 21 rules applied. Total rules applied 643 place count 805 transition count 748
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 654 place count 794 transition count 737
Iterating global reduction 3 with 11 rules applied. Total rules applied 665 place count 794 transition count 737
Applied a total of 665 rules in 229 ms. Remains 794 /1179 variables (removed 385) and now considering 737/1047 (removed 310) transitions.
// Phase 1: matrix 737 rows 794 cols
[2023-03-10 11:32:43] [INFO ] Computed 80 place invariants in 9 ms
[2023-03-10 11:32:43] [INFO ] Implicit Places using invariants in 161 ms returned [385, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 661]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 162 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 781/1179 places, 737/1047 transitions.
Applied a total of 0 rules in 13 ms. Remains 781 /781 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 405 ms. Remains : 781/1179 places, 737/1047 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13 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:(LEQ 3 (ADD s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208))], 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 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13 finished in 530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 33 out of 1179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Graph (complete) has 1533 edges and 1179 vertex of which 1149 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Drop transitions removed 616 transitions
Trivial Post-agglo rules discarded 616 transitions
Performed 616 trivial Post agglomeration. Transition count delta: 616
Iterating post reduction 0 with 671 rules applied. Total rules applied 672 place count 1083 transition count 407
Reduce places removed 616 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 627 rules applied. Total rules applied 1299 place count 467 transition count 396
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1310 place count 456 transition count 396
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 1310 place count 456 transition count 286
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 275 rules applied. Total rules applied 1585 place count 291 transition count 286
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 33 rules applied. Total rules applied 1618 place count 280 transition count 264
Reduce places removed 22 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 4 with 33 rules applied. Total rules applied 1651 place count 258 transition count 253
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1662 place count 247 transition count 253
Discarding 34 places :
Symmetric choice reduction at 6 with 34 rule applications. Total rules 1696 place count 213 transition count 209
Iterating global reduction 6 with 34 rules applied. Total rules applied 1730 place count 213 transition count 209
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 6 with 55 rules applied. Total rules applied 1785 place count 202 transition count 165
Reduce places removed 22 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 7 with 33 rules applied. Total rules applied 1818 place count 180 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1829 place count 169 transition count 154
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 22 Pre rules applied. Total rules applied 1829 place count 169 transition count 132
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 1873 place count 147 transition count 132
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1874 place count 146 transition count 121
Iterating global reduction 9 with 1 rules applied. Total rules applied 1875 place count 146 transition count 121
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 9 with 44 rules applied. Total rules applied 1919 place count 124 transition count 99
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1930 place count 113 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 11 Pre rules applied. Total rules applied 1930 place count 113 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1952 place count 102 transition count 88
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 11 with 11 rules applied. Total rules applied 1963 place count 91 transition count 77
Applied a total of 1963 rules in 29 ms. Remains 91 /1179 variables (removed 1088) and now considering 77/1047 (removed 970) transitions.
// Phase 1: matrix 77 rows 91 cols
[2023-03-10 11:32:43] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 11:32:43] [INFO ] Implicit Places using invariants in 43 ms returned [45, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/1179 places, 77/1047 transitions.
Reduce places removed 11 places and 11 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 78 transition count 55
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 67 transition count 55
Applied a total of 22 rules in 2 ms. Remains 67 /89 variables (removed 22) and now considering 55/77 (removed 22) transitions.
// Phase 1: matrix 55 rows 67 cols
[2023-03-10 11:32:43] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-10 11:32:43] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 11:32:43] [INFO ] Invariant cache hit.
[2023-03-10 11:32:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/1179 places, 55/1047 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 67/1179 places, 55/1047 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p0:(GT 3 (ADD s56 s57 s58 s59 s60 s61 s62 s63...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5435 reset in 244 ms.
Product exploration explored 100000 steps with 5542 reset in 214 ms.
Computed a total of 67 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 55
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) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14 finished in 982 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&&F(p1))))'
Support contains 23 out of 1179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Graph (complete) has 1533 edges and 1179 vertex of which 1084 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.3 ms
Discarding 95 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 616 rules applied. Total rules applied 617 place count 1018 transition count 396
Reduce places removed 561 places and 0 transitions.
Iterating post reduction 1 with 561 rules applied. Total rules applied 1178 place count 457 transition count 396
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 143 Pre rules applied. Total rules applied 1178 place count 457 transition count 253
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 1530 place count 248 transition count 253
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 2 with 33 rules applied. Total rules applied 1563 place count 248 transition count 220
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 1596 place count 215 transition count 220
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1596 place count 215 transition count 209
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1618 place count 204 transition count 209
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1641 place count 181 transition count 176
Iterating global reduction 4 with 23 rules applied. Total rules applied 1664 place count 181 transition count 176
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 4 with 33 rules applied. Total rules applied 1697 place count 170 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1708 place count 159 transition count 154
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1708 place count 159 transition count 132
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1752 place count 137 transition count 132
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1753 place count 136 transition count 121
Iterating global reduction 6 with 1 rules applied. Total rules applied 1754 place count 136 transition count 121
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1765 place count 136 transition count 110
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 33 rules applied. Total rules applied 1798 place count 114 transition count 99
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 1809 place count 103 transition count 88
Applied a total of 1809 rules in 29 ms. Remains 103 /1179 variables (removed 1076) and now considering 88/1047 (removed 959) transitions.
// Phase 1: matrix 88 rows 103 cols
[2023-03-10 11:32:44] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 11:32:44] [INFO ] Implicit Places using invariants in 54 ms returned [34, 69, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 55 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/1179 places, 88/1047 transitions.
Reduce places removed 11 places and 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 79 transition count 66
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 68 transition count 66
Applied a total of 22 rules in 1 ms. Remains 68 /90 variables (removed 22) and now considering 66/88 (removed 22) transitions.
// Phase 1: matrix 66 rows 68 cols
[2023-03-10 11:32:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 11:32:44] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 11:32:44] [INFO ] Invariant cache hit.
[2023-03-10 11:32:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/1179 places, 66/1047 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 68/1179 places, 66/1047 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s34 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22)), p1:(LEQ 2 (ADD s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 finished in 261 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(X(F(p0)))))'
Found a Shortening insensitive property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1179 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Graph (complete) has 1533 edges and 1179 vertex of which 1095 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.3 ms
Discarding 84 places :
Also discarding 57 output transitions
Drop transitions removed 57 transitions
Reduce places removed 11 places and 11 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Drop transitions removed 616 transitions
Trivial Post-agglo rules discarded 616 transitions
Performed 616 trivial Post agglomeration. Transition count delta: 616
Iterating post reduction 0 with 682 rules applied. Total rules applied 683 place count 1029 transition count 352
Reduce places removed 616 places and 0 transitions.
Iterating post reduction 1 with 616 rules applied. Total rules applied 1299 place count 413 transition count 352
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 1299 place count 413 transition count 231
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 1607 place count 226 transition count 231
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 2 with 33 rules applied. Total rules applied 1640 place count 226 transition count 198
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 1673 place count 193 transition count 198
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1673 place count 193 transition count 187
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1695 place count 182 transition count 187
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1728 place count 149 transition count 144
Iterating global reduction 4 with 33 rules applied. Total rules applied 1761 place count 149 transition count 144
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 44 rules applied. Total rules applied 1805 place count 138 transition count 111
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1827 place count 116 transition count 111
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1827 place count 116 transition count 89
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1871 place count 94 transition count 89
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1872 place count 93 transition count 78
Iterating global reduction 6 with 1 rules applied. Total rules applied 1873 place count 93 transition count 78
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 33 rules applied. Total rules applied 1906 place count 82 transition count 56
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1917 place count 71 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1939 place count 60 transition count 45
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 1950 place count 49 transition count 34
Applied a total of 1950 rules in 28 ms. Remains 49 /1179 variables (removed 1130) and now considering 34/1047 (removed 1013) transitions.
// Phase 1: matrix 34 rows 49 cols
[2023-03-10 11:32:44] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 11:32:44] [INFO ] Implicit Places using invariants in 45 ms returned [14, 15, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 46 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 36/1179 places, 34/1047 transitions.
Reduce places removed 11 places and 11 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 25 transition count 12
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 14 transition count 12
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 4 transition count 2
Ensure Unique test removed 1 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 43 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 43 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 45 place count 2 transition count 1
Applied a total of 45 rules in 1 ms. Remains 2 /36 variables (removed 34) and now considering 1/34 (removed 33) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-10 11:32:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 11:32:44] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-10 11:32:44] [INFO ] Invariant cache hit.
[2023-03-10 11:32:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2/1179 places, 1/1047 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 108 ms. Remains : 2/1179 places, 1/1047 transitions.
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 1 s1)], 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07 finished in 327 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + 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' '!(X((G(p0) U G(p1))))'
Found a Lengthening insensitive property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Support contains 46 out of 1179 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1179/1179 places, 1047/1047 transitions.
Graph (complete) has 1533 edges and 1179 vertex of which 1162 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 583 rules applied. Total rules applied 584 place count 1107 transition count 497
Reduce places removed 539 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 561 rules applied. Total rules applied 1145 place count 568 transition count 475
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1167 place count 546 transition count 475
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 1167 place count 546 transition count 332
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 341 rules applied. Total rules applied 1508 place count 348 transition count 332
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1508 place count 348 transition count 321
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1530 place count 337 transition count 321
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1553 place count 314 transition count 288
Iterating global reduction 3 with 23 rules applied. Total rules applied 1576 place count 314 transition count 288
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 44 rules applied. Total rules applied 1620 place count 303 transition count 255
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1642 place count 281 transition count 255
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 22 Pre rules applied. Total rules applied 1642 place count 281 transition count 233
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 1686 place count 259 transition count 233
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1687 place count 258 transition count 222
Iterating global reduction 5 with 1 rules applied. Total rules applied 1688 place count 258 transition count 222
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 5 with 11 rules applied. Total rules applied 1699 place count 247 transition count 222
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1699 place count 247 transition count 211
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1721 place count 236 transition count 211
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1732 place count 225 transition count 200
Iterating global reduction 6 with 11 rules applied. Total rules applied 1743 place count 225 transition count 200
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 1809 place count 192 transition count 167
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 1820 place count 181 transition count 156
Applied a total of 1820 rules in 32 ms. Remains 181 /1179 variables (removed 998) and now considering 156/1047 (removed 891) transitions.
// Phase 1: matrix 156 rows 181 cols
[2023-03-10 11:32:45] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-10 11:32:45] [INFO ] Implicit Places using invariants in 72 ms returned [11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 100, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 169]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 73 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 157/1179 places, 156/1047 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 157 transition count 145
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 146 transition count 145
Applied a total of 22 rules in 2 ms. Remains 146 /157 variables (removed 11) and now considering 145/156 (removed 11) transitions.
// Phase 1: matrix 145 rows 146 cols
[2023-03-10 11:32:45] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 11:32:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-10 11:32:45] [INFO ] Invariant cache hit.
[2023-03-10 11:32:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 146/1179 places, 145/1047 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 214 ms. Remains : 146/1179 places, 145/1047 transitions.
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s133 s134)), p0:(LEQ (ADD s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25044 reset in 288 ms.
Product exploration explored 100000 steps with 24890 reset in 296 ms.
Computed a total of 146 stabilizing places and 145 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 146 transition count 145
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) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 473 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Finished random walk after 822 steps, including 10 resets, run visited all 5 properties in 15 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 558 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
[2023-03-10 11:32:47] [INFO ] Invariant cache hit.
[2023-03-10 11:32:47] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-10 11:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:32:47] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 11:32:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:32:47] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-10 11:32:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:32:47] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-10 11:32:47] [INFO ] Computed and/alt/rep : 121/154/121 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 11:32:47] [INFO ] Added : 51 causal constraints over 11 iterations in 110 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 46 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 145/145 transitions.
Applied a total of 0 rules in 0 ms. Remains 146 /146 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-10 11:32:47] [INFO ] Invariant cache hit.
[2023-03-10 11:32:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-10 11:32:47] [INFO ] Invariant cache hit.
[2023-03-10 11:32:48] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-10 11:32:48] [INFO ] Invariant cache hit.
[2023-03-10 11:32:48] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 146/146 places, 145/145 transitions.
Computed a total of 146 stabilizing places and 145 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 146 transition count 145
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) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 532 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Finished random walk after 344 steps, including 4 resets, run visited all 5 properties in 4 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 670 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
[2023-03-10 11:32:49] [INFO ] Invariant cache hit.
[2023-03-10 11:32:49] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-10 11:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:32:49] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-10 11:32:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:32:50] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-10 11:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:32:50] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-10 11:32:50] [INFO ] Computed and/alt/rep : 121/154/121 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 11:32:50] [INFO ] Added : 51 causal constraints over 11 iterations in 109 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 33266 reset in 264 ms.
Product exploration explored 100000 steps with 33262 reset in 268 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Support contains 46 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 145/145 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-10 11:32:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 11:32:51] [INFO ] Invariant cache hit.
[2023-03-10 11:32:51] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 146/146 places, 145/145 transitions.
Support contains 46 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 145/145 transitions.
Applied a total of 0 rules in 0 ms. Remains 146 /146 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-10 11:32:51] [INFO ] Invariant cache hit.
[2023-03-10 11:32:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-10 11:32:51] [INFO ] Invariant cache hit.
[2023-03-10 11:32:51] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-10 11:32:51] [INFO ] Invariant cache hit.
[2023-03-10 11:32:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 146/146 places, 145/145 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 finished in 6455 ms.
[2023-03-10 11:32:51] [INFO ] Flatten gal took : 44 ms
[2023-03-10 11:32:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 11:32:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1179 places, 1047 transitions and 2611 arcs took 7 ms.
Total runtime 55039 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FamilyReunion-COL-L00010M0001C001P001G001
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678447972936

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07
lola: result : true
lola: markings : 496
lola: fired transitions : 1100
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12
lola: result : false
lola: markings : 644
lola: fired transitions : 644
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07: LTL true LTL model checker
FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-L00010M0001C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838852900299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00010M0001C001P001G001.tgz
mv FamilyReunion-COL-L00010M0001C001P001G001 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;