Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855700297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855700297
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678503765518

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 03:02:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:02:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:02:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 03:02:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 03:02:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2023-03-11 03:02:47] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2023-03-11 03:02:47] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2023-03-11 03:02:47] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-11 03:02:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
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).
AF dead knowledge conclusive for 3 formulas.
Remains 16 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 10007 steps, including 14 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 77) seen :28
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 03:02:48] [INFO ] Computed 33 place invariants in 14 ms
[2023-03-11 03:02:48] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 03:02:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 03:02:48] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:44
[2023-03-11 03:02:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 03:02:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 03:02:49] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :48 sat :1
[2023-03-11 03:02:49] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :48 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:02:49] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :48 sat :1
Fused 49 Parikh solutions to 1 different solutions.
Finished Parikh walk after 290 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=145 )
Parikh walk visited 1 properties in 3 ms.
Successfully simplified 48 atomic propositions for a total of 16 simplifications.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 03:02:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-11 03:02:49] [INFO ] Flatten gal took : 31 ms
[2023-03-11 03:02:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 03:02:49] [INFO ] Flatten gal took : 8 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-11 03:02:49] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 23 ms.
[2023-03-11 03:02:49] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 11 places in 11 ms
Reduce places removed 19 places and 0 transitions.
Support contains 776 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 27 places and 0 transitions.
Discarding 110 places :
Implicit places reduction removed 110 places
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1223 transition count 1069
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 160 place count 1200 transition count 1046
Iterating global reduction 1 with 23 rules applied. Total rules applied 183 place count 1200 transition count 1046
Applied a total of 183 rules in 98 ms. Remains 1200 /1360 variables (removed 160) and now considering 1046/1069 (removed 23) transitions.
// Phase 1: matrix 1046 rows 1200 cols
[2023-03-11 03:02:49] [INFO ] Computed 206 place invariants in 43 ms
[2023-03-11 03:02:49] [INFO ] Implicit Places using invariants in 368 ms returned [598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 371 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1178/1360 places, 1046/1069 transitions.
Applied a total of 0 rules in 27 ms. Remains 1178 /1178 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 497 ms. Remains : 1178/1360 places, 1046/1069 transitions.
Support contains 776 out of 1178 places after structural reductions.
[2023-03-11 03:02:49] [INFO ] Flatten gal took : 69 ms
[2023-03-11 03:02:50] [INFO ] Flatten gal took : 58 ms
[2023-03-11 03:02:50] [INFO ] Input system was already deterministic with 1046 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 41) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 1046 rows 1178 cols
[2023-03-11 03:02:50] [INFO ] Computed 184 place invariants in 19 ms
[2023-03-11 03:02:51] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2023-03-11 03:02:51] [INFO ] [Real]Absence check using 31 positive and 153 generalized place invariants in 43 ms returned sat
[2023-03-11 03:02:52] [INFO ] After 1131ms SMT Verify possible using all constraints in real domain returned unsat :13 sat :0 real:10
[2023-03-11 03:02:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 51 ms returned sat
[2023-03-11 03:02:52] [INFO ] [Nat]Absence check using 31 positive and 153 generalized place invariants in 42 ms returned sat
[2023-03-11 03:02:52] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :22 sat :1
[2023-03-11 03:02:52] [INFO ] After 521ms SMT Verify possible using trap constraints in natural domain returned unsat :22 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 03:02:53] [INFO ] After 1001ms SMT Verify possible using all constraints in natural domain returned unsat :22 sat :1
Fused 23 Parikh solutions to 1 different solutions.
Finished Parikh walk after 262 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=131 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 22 atomic propositions for a total of 8 simplifications.
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 42 ms
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 45 ms
[2023-03-11 03:02:53] [INFO ] Input system was already deterministic with 1046 transitions.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1178 stabilizing places and 1046 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1178 transition count 1046
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 1046/1046 transitions.
Reduce places removed 4 places and 0 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 1108 transition count 1046
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 103 place count 1075 transition count 1013
Iterating global reduction 1 with 33 rules applied. Total rules applied 136 place count 1075 transition count 1013
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 148 place count 1063 transition count 991
Iterating global reduction 1 with 12 rules applied. Total rules applied 160 place count 1063 transition count 991
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 171 place count 1052 transition count 991
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 193 place count 1030 transition count 969
Iterating global reduction 2 with 22 rules applied. Total rules applied 215 place count 1030 transition count 969
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 227 place count 1018 transition count 947
Iterating global reduction 2 with 12 rules applied. Total rules applied 239 place count 1018 transition count 947
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 250 place count 1007 transition count 947
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 261 place count 996 transition count 936
Iterating global reduction 3 with 11 rules applied. Total rules applied 272 place count 996 transition count 936
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 283 place count 985 transition count 925
Iterating global reduction 3 with 11 rules applied. Total rules applied 294 place count 985 transition count 925
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 305 place count 974 transition count 914
Iterating global reduction 3 with 11 rules applied. Total rules applied 316 place count 974 transition count 914
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 327 place count 963 transition count 903
Iterating global reduction 3 with 11 rules applied. Total rules applied 338 place count 963 transition count 903
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 349 place count 952 transition count 892
Iterating global reduction 3 with 11 rules applied. Total rules applied 360 place count 952 transition count 892
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 371 place count 941 transition count 881
Iterating global reduction 3 with 11 rules applied. Total rules applied 382 place count 941 transition count 881
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 393 place count 930 transition count 870
Iterating global reduction 3 with 11 rules applied. Total rules applied 404 place count 930 transition count 870
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 415 place count 919 transition count 859
Iterating global reduction 3 with 11 rules applied. Total rules applied 426 place count 919 transition count 859
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 437 place count 908 transition count 848
Iterating global reduction 3 with 11 rules applied. Total rules applied 448 place count 908 transition count 848
Applied a total of 448 rules in 430 ms. Remains 908 /1178 variables (removed 270) and now considering 848/1046 (removed 198) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 908/1178 places, 848/1046 transitions.
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 28 ms
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 27 ms
[2023-03-11 03:02:53] [INFO ] Input system was already deterministic with 848 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1178/1178 places, 1046/1046 transitions.
Graph (complete) has 1608 edges and 1178 vertex of which 864 are kept as prefixes of interest. Removing 314 places using SCC suffix rule.6 ms
Discarding 314 places :
Also discarding 265 output transitions
Drop transitions removed 265 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 418 rules applied. Total rules applied 419 place count 809 transition count 396
Reduce places removed 374 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 1 with 407 rules applied. Total rules applied 826 place count 435 transition count 363
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 859 place count 402 transition count 363
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 859 place count 402 transition count 308
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 991 place count 325 transition count 308
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 22 rules applied. Total rules applied 1013 place count 325 transition count 286
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1035 place count 303 transition count 286
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1046 place count 292 transition count 275
Iterating global reduction 5 with 11 rules applied. Total rules applied 1057 place count 292 transition count 275
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
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 1101 place count 270 transition count 253
Applied a total of 1101 rules in 68 ms. Remains 270 /1178 variables (removed 908) and now considering 253/1046 (removed 793) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 270/1178 places, 253/1046 transitions.
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 10 ms
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 9 ms
[2023-03-11 03:02:53] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1178/1178 places, 1046/1046 transitions.
Graph (complete) has 1608 edges and 1178 vertex of which 1162 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Discarding 16 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 66 places :
Implicit places reduction removed 66 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 572 rules applied. Total rules applied 573 place count 1085 transition count 528
Reduce places removed 506 places and 0 transitions.
Iterating post reduction 1 with 506 rules applied. Total rules applied 1079 place count 579 transition count 528
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 143 Pre rules applied. Total rules applied 1079 place count 579 transition count 385
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 2 with 341 rules applied. Total rules applied 1420 place count 381 transition count 385
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 1453 place count 381 transition count 352
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 1486 place count 348 transition count 352
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1519 place count 315 transition count 319
Iterating global reduction 4 with 33 rules applied. Total rules applied 1552 place count 315 transition count 319
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 11 rules applied. Total rules applied 1563 place count 315 transition count 308
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1574 place count 304 transition count 308
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1574 place count 304 transition count 297
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1596 place count 293 transition count 297
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1598 place count 291 transition count 275
Iterating global reduction 6 with 2 rules applied. Total rules applied 1600 place count 291 transition count 275
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 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 1655 place count 269 transition count 242
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1677 place count 247 transition count 242
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 1677 place count 247 transition count 220
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1721 place count 225 transition count 220
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 1743 place count 214 transition count 209
Applied a total of 1743 rules in 73 ms. Remains 214 /1178 variables (removed 964) and now considering 209/1046 (removed 837) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 214/1178 places, 209/1046 transitions.
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 6 ms
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 7 ms
[2023-03-11 03:02:53] [INFO ] Input system was already deterministic with 209 transitions.
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1178/1178 places, 1046/1046 transitions.
Graph (complete) has 1608 edges and 1178 vertex of which 143 are kept as prefixes of interest. Removing 1035 places using SCC suffix rule.3 ms
Discarding 1035 places :
Also discarding 925 output transitions
Drop transitions removed 925 transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 143 transition count 99
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 121 transition count 99
Applied a total of 45 rules in 10 ms. Remains 121 /1178 variables (removed 1057) and now considering 99/1046 (removed 947) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 121/1178 places, 99/1046 transitions.
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 3 ms
[2023-03-11 03:02:53] [INFO ] Flatten gal took : 3 ms
[2023-03-11 03:02:53] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 1046/1046 transitions.
Reduce places removed 15 places and 0 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 1097 transition count 1046
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 124 place count 1054 transition count 1003
Iterating global reduction 1 with 43 rules applied. Total rules applied 167 place count 1054 transition count 1003
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 189 place count 1032 transition count 971
Iterating global reduction 1 with 22 rules applied. Total rules applied 211 place count 1032 transition count 971
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 222 place count 1021 transition count 971
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 243 place count 1000 transition count 940
Iterating global reduction 2 with 21 rules applied. Total rules applied 264 place count 1000 transition count 940
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 285 place count 979 transition count 919
Iterating global reduction 2 with 21 rules applied. Total rules applied 306 place count 979 transition count 919
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 316 place count 969 transition count 909
Iterating global reduction 2 with 10 rules applied. Total rules applied 326 place count 969 transition count 909
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 336 place count 959 transition count 899
Iterating global reduction 2 with 10 rules applied. Total rules applied 346 place count 959 transition count 899
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 356 place count 949 transition count 889
Iterating global reduction 2 with 10 rules applied. Total rules applied 366 place count 949 transition count 889
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 367 place count 948 transition count 889
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 377 place count 938 transition count 879
Iterating global reduction 3 with 10 rules applied. Total rules applied 387 place count 938 transition count 879
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 397 place count 928 transition count 869
Iterating global reduction 3 with 10 rules applied. Total rules applied 407 place count 928 transition count 869
Applied a total of 407 rules in 261 ms. Remains 928 /1178 variables (removed 250) and now considering 869/1046 (removed 177) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 928/1178 places, 869/1046 transitions.
[2023-03-11 03:02:54] [INFO ] Flatten gal took : 23 ms
[2023-03-11 03:02:54] [INFO ] Flatten gal took : 23 ms
[2023-03-11 03:02:54] [INFO ] Input system was already deterministic with 869 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 1046/1046 transitions.
Reduce places removed 15 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 1119 transition count 1046
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 102 place count 1076 transition count 1003
Iterating global reduction 1 with 43 rules applied. Total rules applied 145 place count 1076 transition count 1003
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 156 place count 1065 transition count 992
Iterating global reduction 1 with 11 rules applied. Total rules applied 167 place count 1065 transition count 992
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 178 place count 1054 transition count 981
Iterating global reduction 1 with 11 rules applied. Total rules applied 189 place count 1054 transition count 981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 190 place count 1053 transition count 970
Iterating global reduction 1 with 1 rules applied. Total rules applied 191 place count 1053 transition count 970
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 202 place count 1042 transition count 970
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 213 place count 1031 transition count 959
Iterating global reduction 2 with 11 rules applied. Total rules applied 224 place count 1031 transition count 959
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 235 place count 1020 transition count 948
Iterating global reduction 2 with 11 rules applied. Total rules applied 246 place count 1020 transition count 948
Applied a total of 246 rules in 161 ms. Remains 1020 /1178 variables (removed 158) and now considering 948/1046 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 1020/1178 places, 948/1046 transitions.
[2023-03-11 03:02:54] [INFO ] Flatten gal took : 24 ms
[2023-03-11 03:02:54] [INFO ] Flatten gal took : 34 ms
[2023-03-11 03:02:54] [INFO ] Input system was already deterministic with 948 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 1046/1046 transitions.
Reduce places removed 15 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 1119 transition count 1046
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 102 place count 1076 transition count 1003
Iterating global reduction 1 with 43 rules applied. Total rules applied 145 place count 1076 transition count 1003
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 167 place count 1054 transition count 971
Iterating global reduction 1 with 22 rules applied. Total rules applied 189 place count 1054 transition count 971
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 200 place count 1043 transition count 971
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 221 place count 1022 transition count 940
Iterating global reduction 2 with 21 rules applied. Total rules applied 242 place count 1022 transition count 940
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 252 place count 1012 transition count 930
Iterating global reduction 2 with 10 rules applied. Total rules applied 262 place count 1012 transition count 930
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 272 place count 1002 transition count 920
Iterating global reduction 2 with 10 rules applied. Total rules applied 282 place count 1002 transition count 920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 292 place count 992 transition count 910
Iterating global reduction 2 with 10 rules applied. Total rules applied 302 place count 992 transition count 910
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 312 place count 982 transition count 900
Iterating global reduction 2 with 10 rules applied. Total rules applied 322 place count 982 transition count 900
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 323 place count 981 transition count 900
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 333 place count 971 transition count 890
Iterating global reduction 3 with 10 rules applied. Total rules applied 343 place count 971 transition count 890
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 353 place count 961 transition count 880
Iterating global reduction 3 with 10 rules applied. Total rules applied 363 place count 961 transition count 880
Applied a total of 363 rules in 243 ms. Remains 961 /1178 variables (removed 217) and now considering 880/1046 (removed 166) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 961/1178 places, 880/1046 transitions.
[2023-03-11 03:02:54] [INFO ] Flatten gal took : 22 ms
[2023-03-11 03:02:54] [INFO ] Flatten gal took : 22 ms
[2023-03-11 03:02:54] [INFO ] Input system was already deterministic with 880 transitions.
[2023-03-11 03:02:54] [INFO ] Flatten gal took : 26 ms
[2023-03-11 03:02:55] [INFO ] Flatten gal took : 26 ms
[2023-03-11 03:02:55] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-11 03:02:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1178 places, 1046 transitions and 2674 arcs took 7 ms.
Total runtime 7824 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/468/ctl_0_ --ctl=/tmp/468/ctl_1_ --ctl=/tmp/468/ctl_2_ --ctl=/tmp/468/ctl_3_ --ctl=/tmp/468/ctl_4_ --ctl=/tmp/468/ctl_5_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 10822072 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094760 kB
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-00
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-04
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-10
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-13
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-14
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-15

BK_STOP 1678507347314

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-00
ctl formula formula --ctl=/tmp/468/ctl_0_
ctl formula name FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-04
ctl formula formula --ctl=/tmp/468/ctl_1_
ctl formula name FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-10
ctl formula formula --ctl=/tmp/468/ctl_2_
ctl formula name FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-13
ctl formula formula --ctl=/tmp/468/ctl_3_
ctl formula name FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-14
ctl formula formula --ctl=/tmp/468/ctl_4_
ctl formula name FamilyReunion-COL-L00010M0001C001P001G001-CTLCardinality-15
ctl formula formula --ctl=/tmp/468/ctl_5_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 1178 places, 1046 transitions and 2674 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1046->1045 groups
pnml2lts-sym: Regrouping took 0.460 real 0.460 user 0.010 sys
pnml2lts-sym: state vector length is 1178; there are 1045 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 474
Killing (9) : 474

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="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855700297"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;