Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 6.7K Apr 30 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 10:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 10:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 146K May 10 09:33 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-L00200M0020C010P010G005-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652706466322

Running Version 202205111006
[2022-05-16 13:07:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 13:07:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 13:07: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.
[2022-05-16 13:07:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 13:07:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 670 ms
[2022-05-16 13:07:48] [INFO ] Detected 5 constant HL places corresponding to 56 PT places.
[2022-05-16 13:07:48] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 144109 PT places and 134480.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 13:07:48] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 11 ms.
[2022-05-16 13:07:48] [INFO ] Skeletonized 15 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-12 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 10107 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=163 ) properties (out of 28) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) 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 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 13:07:48] [INFO ] Computed 33 place invariants in 17 ms
[2022-05-16 13:07:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:07:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 13:07:49] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2022-05-16 13:07:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:07:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 13:07:49] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2022-05-16 13:07:49] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-16 13:07:49] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 17 different solutions.
Finished Parikh walk after 123 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=123 )
Parikh walk visited 18 properties in 202 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2022-05-16 13:07:49] [INFO ] Flatten gal took : 26 ms
[2022-05-16 13:07:49] [INFO ] Flatten gal took : 8 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :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 11
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
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 6
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
[2022-05-16 13:07:50] [INFO ] Unfolded HLPN to a Petri net with 128969 places and 110159 transitions 316597 arcs in 526 ms.
[2022-05-16 13:07:50] [INFO ] Unfolded 13 HLPN properties in 6 ms.
Deduced a syphon composed of 201 places in 338 ms
Reduce places removed 237 places and 0 transitions.
Support contains 55490 out of 128732 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128732/128732 places, 110159/110159 transitions.
Reduce places removed 234 places and 0 transitions.
Discarding 21708 places :
Implicit places reduction removed 21708 places
Iterating post reduction 0 with 21942 rules applied. Total rules applied 21942 place count 106790 transition count 110159
Applied a total of 21942 rules in 12272 ms. Remains 106790 /128732 variables (removed 21942) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 106790 cols
[2022-05-16 13:08:40] [INFO ] Computed 8651 place invariants in 35574 ms
[2022-05-16 13:08:48] [INFO ] Implicit Places using invariants in 43987 ms returned []
Implicit Place search using SMT only with invariants took 43989 ms to find 0 implicit places.
// Phase 1: matrix 110159 rows 106790 cols
[2022-05-16 13:09:21] [INFO ] Computed 8651 place invariants in 32750 ms
[2022-05-16 13:09:28] [INFO ] Dead Transitions using invariants and state equation in 40453 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106790/128732 places, 110159/110159 transitions.
Finished structural reductions, in 1 iterations. Remains : 106790/128732 places, 110159/110159 transitions.
Support contains 55490 out of 106790 places after structural reductions.
[2022-05-16 13:09:33] [INFO ] Flatten gal took : 3384 ms
[2022-05-16 13:09:36] [INFO ] Flatten gal took : 3069 ms
[2022-05-16 13:09:44] [INFO ] Input system was already deterministic with 110159 transitions.
Support contains 55479 out of 106790 places (down from 55490) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3521 ms. (steps per millisecond=2 ) properties (out of 27) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 730 ms. (steps per millisecond=13 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=13 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1309 ms. (steps per millisecond=7 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 748 ms. (steps per millisecond=13 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 740 ms. (steps per millisecond=13 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 110159 rows 106790 cols
[2022-05-16 13:10:30] [INFO ] Computed 8651 place invariants in 35587 ms
[2022-05-16 13:10:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 13:10:55] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25932 out of 106790 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106790/106790 places, 110159/110159 transitions.
Graph (complete) has 150158 edges and 106790 vertex of which 106768 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.148 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 33969 transitions
Trivial Post-agglo rules discarded 33969 transitions
Performed 33969 trivial Post agglomeration. Transition count delta: 33969
Iterating post reduction 0 with 33969 rules applied. Total rules applied 33970 place count 106768 transition count 76179
Reduce places removed 33969 places and 0 transitions.
Performed 603 Post agglomeration using F-continuation condition.Transition count delta: 603
Iterating post reduction 1 with 34572 rules applied. Total rules applied 68542 place count 72799 transition count 75576
Reduce places removed 603 places and 0 transitions.
Iterating post reduction 2 with 603 rules applied. Total rules applied 69145 place count 72196 transition count 75576
Performed 7035 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7035 Pre rules applied. Total rules applied 69145 place count 72196 transition count 68541
Deduced a syphon composed of 7035 places in 69 ms
Ensure Unique test removed 2211 places
Reduce places removed 9246 places and 0 transitions.
Iterating global reduction 3 with 16281 rules applied. Total rules applied 85426 place count 62950 transition count 68541
Performed 5025 Post agglomeration using F-continuation condition.Transition count delta: 5025
Deduced a syphon composed of 5025 places in 47 ms
Ensure Unique test removed 4221 places
Reduce places removed 9246 places and 0 transitions.
Iterating global reduction 3 with 14271 rules applied. Total rules applied 99697 place count 53704 transition count 63516
Free-agglomeration rule applied 2211 times.
Iterating global reduction 3 with 2211 rules applied. Total rules applied 101908 place count 53704 transition count 61305
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 3 with 2211 rules applied. Total rules applied 104119 place count 51493 transition count 61305
Free-agglomeration rule (complex) applied 11055 times.
Iterating global reduction 4 with 11055 rules applied. Total rules applied 115174 place count 51493 transition count 50250
Ensure Unique test removed 201 places
Reduce places removed 11256 places and 0 transitions.
Iterating post reduction 4 with 11256 rules applied. Total rules applied 126430 place count 40237 transition count 50250
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 126440 place count 40227 transition count 48240
Iterating global reduction 5 with 10 rules applied. Total rules applied 126450 place count 40227 transition count 48240
Applied a total of 126450 rules in 61766 ms. Remains 40227 /106790 variables (removed 66563) and now considering 48240/110159 (removed 61919) transitions.
Finished structural reductions, in 1 iterations. Remains : 40227/106790 places, 48240/110159 transitions.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 106790 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106790 transition count 110159
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X((F(p0)&&G((p0 U p1))&&p0)) U p2))'
Support contains 4423 out of 106790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106790/106790 places, 110159/110159 transitions.
Reduce places removed 414 places and 0 transitions.
Discarding 4422 places :
Implicit places reduction removed 4422 places
Iterating post reduction 0 with 4836 rules applied. Total rules applied 4836 place count 101954 transition count 110159
Applied a total of 4836 rules in 1091 ms. Remains 101954 /106790 variables (removed 4836) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:12:19] [INFO ] Computed 4026 place invariants in 19735 ms
[2022-05-16 13:12:26] [INFO ] Implicit Places using invariants in 27341 ms returned []
Implicit Place search using SMT only with invariants took 27344 ms to find 0 implicit places.
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:12:46] [INFO ] Computed 4026 place invariants in 19968 ms
[2022-05-16 13:12:54] [INFO ] Dead Transitions using invariants and state equation in 27446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101954/106790 places, 110159/110159 transitions.
Finished structural reductions, in 1 iterations. Remains : 101954/106790 places, 110159/110159 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), p1]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 s45227), p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 55360 steps with 89 reset in 10001 ms.
Product exploration timeout after 57530 steps with 79 reset in 10001 ms.
Computed a total of 101954 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 101954 transition count 110159
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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 531 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:14:08] [INFO ] Computed 4026 place invariants in 19219 ms
[2022-05-16 13:14:33] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 101954 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101954/101954 places, 110159/110159 transitions.
Graph (complete) has 138288 edges and 101954 vertex of which 99529 are kept as prefixes of interest. Removing 2425 places using SCC suffix rule.53 ms
Discarding 2425 places :
Also discarding 2423 output transitions
Drop transitions removed 2423 transitions
Drop transitions removed 68139 transitions
Trivial Post-agglo rules discarded 68139 transitions
Performed 68139 trivial Post agglomeration. Transition count delta: 68139
Iterating post reduction 0 with 68139 rules applied. Total rules applied 68140 place count 99529 transition count 39597
Reduce places removed 68139 places and 0 transitions.
Iterating post reduction 1 with 68139 rules applied. Total rules applied 136279 place count 31390 transition count 39597
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5829 Pre rules applied. Total rules applied 136279 place count 31390 transition count 33768
Deduced a syphon composed of 5829 places in 15 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 2 with 14472 rules applied. Total rules applied 150751 place count 22747 transition count 33768
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 2 with 2613 rules applied. Total rules applied 153364 place count 22546 transition count 31356
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 3 with 2412 rules applied. Total rules applied 155776 place count 20134 transition count 31356
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 155776 place count 20134 transition count 31155
Deduced a syphon composed of 201 places in 14 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 156178 place count 19933 transition count 31155
Performed 5025 Post agglomeration using F-continuation condition.Transition count delta: 5025
Deduced a syphon composed of 5025 places in 16 ms
Reduce places removed 5025 places and 0 transitions.
Iterating global reduction 4 with 10050 rules applied. Total rules applied 166228 place count 14908 transition count 26130
Free-agglomeration rule (complex) applied 6633 times.
Iterating global reduction 4 with 6633 rules applied. Total rules applied 172861 place count 14908 transition count 19497
Ensure Unique test removed 402 places
Reduce places removed 7035 places and 0 transitions.
Iterating post reduction 4 with 7035 rules applied. Total rules applied 179896 place count 7873 transition count 19497
Discarding 2240 places :
Symmetric choice reduction at 5 with 2240 rule applications. Total rules 182136 place count 5633 transition count 11257
Ensure Unique test removed 1 places
Iterating global reduction 5 with 2241 rules applied. Total rules applied 184377 place count 5632 transition count 11257
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 5 with 2412 rules applied. Total rules applied 186789 place count 5431 transition count 9046
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 6 with 201 rules applied. Total rules applied 186990 place count 5230 transition count 9046
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 201 Pre rules applied. Total rules applied 186990 place count 5230 transition count 8845
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 7 with 402 rules applied. Total rules applied 187392 place count 5029 transition count 8845
Discarding 4220 places :
Symmetric choice reduction at 7 with 4220 rule applications. Total rules 191612 place count 809 transition count 4625
Ensure Unique test removed 202 places
Iterating global reduction 7 with 4422 rules applied. Total rules applied 196034 place count 607 transition count 4625
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 7 with 4221 rules applied. Total rules applied 200255 place count 607 transition count 404
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 8 with 201 rules applied. Total rules applied 200456 place count 406 transition count 404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 200456 place count 406 transition count 403
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 200458 place count 405 transition count 403
Discarding 200 places :
Symmetric choice reduction at 9 with 200 rule applications. Total rules 200658 place count 205 transition count 203
Ensure Unique test removed 1 places
Iterating global reduction 9 with 201 rules applied. Total rules applied 200859 place count 204 transition count 203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 200859 place count 204 transition count 201
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 200863 place count 202 transition count 201
Discarding 200 places :
Symmetric choice reduction at 9 with 200 rule applications. Total rules 201063 place count 2 transition count 1
Iterating global reduction 9 with 200 rules applied. Total rules applied 201263 place count 2 transition count 1
Applied a total of 201263 rules in 17697 ms. Remains 2 /101954 variables (removed 101952) and now considering 1/110159 (removed 110158) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/101954 places, 1/110159 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 8 factoid took 492 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1]
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:15:15] [INFO ] Computed 4026 place invariants in 23392 ms
Could not prove EG (NOT p2)
Support contains 4423 out of 101954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101954/101954 places, 110159/110159 transitions.
Applied a total of 0 rules in 933 ms. Remains 101954 /101954 variables (removed 0) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:15:50] [INFO ] Computed 4026 place invariants in 18995 ms
[2022-05-16 13:15:58] [INFO ] Implicit Places using invariants in 26823 ms returned []
Implicit Place search using SMT only with invariants took 26837 ms to find 0 implicit places.
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:16:18] [INFO ] Computed 4026 place invariants in 19996 ms
[2022-05-16 13:16:26] [INFO ] Dead Transitions using invariants and state equation in 27499 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101954/101954 places, 110159/110159 transitions.
Computed a total of 101954 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 101954 transition count 110159
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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 457 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:17:18] [INFO ] Computed 4026 place invariants in 18223 ms
[2022-05-16 13:17:43] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 101954 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101954/101954 places, 110159/110159 transitions.
Graph (complete) has 138288 edges and 101954 vertex of which 99529 are kept as prefixes of interest. Removing 2425 places using SCC suffix rule.53 ms
Discarding 2425 places :
Also discarding 2423 output transitions
Drop transitions removed 2423 transitions
Drop transitions removed 68139 transitions
Trivial Post-agglo rules discarded 68139 transitions
Performed 68139 trivial Post agglomeration. Transition count delta: 68139
Iterating post reduction 0 with 68139 rules applied. Total rules applied 68140 place count 99529 transition count 39597
Reduce places removed 68139 places and 0 transitions.
Iterating post reduction 1 with 68139 rules applied. Total rules applied 136279 place count 31390 transition count 39597
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5829 Pre rules applied. Total rules applied 136279 place count 31390 transition count 33768
Deduced a syphon composed of 5829 places in 15 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 2 with 14472 rules applied. Total rules applied 150751 place count 22747 transition count 33768
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 2 with 2613 rules applied. Total rules applied 153364 place count 22546 transition count 31356
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 3 with 2412 rules applied. Total rules applied 155776 place count 20134 transition count 31356
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 155776 place count 20134 transition count 31155
Deduced a syphon composed of 201 places in 11 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 156178 place count 19933 transition count 31155
Performed 5025 Post agglomeration using F-continuation condition.Transition count delta: 5025
Deduced a syphon composed of 5025 places in 9 ms
Reduce places removed 5025 places and 0 transitions.
Iterating global reduction 4 with 10050 rules applied. Total rules applied 166228 place count 14908 transition count 26130
Free-agglomeration rule (complex) applied 6633 times.
Iterating global reduction 4 with 6633 rules applied. Total rules applied 172861 place count 14908 transition count 19497
Ensure Unique test removed 402 places
Reduce places removed 7035 places and 0 transitions.
Iterating post reduction 4 with 7035 rules applied. Total rules applied 179896 place count 7873 transition count 19497
Discarding 2240 places :
Symmetric choice reduction at 5 with 2240 rule applications. Total rules 182136 place count 5633 transition count 11257
Ensure Unique test removed 1 places
Iterating global reduction 5 with 2241 rules applied. Total rules applied 184377 place count 5632 transition count 11257
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 5 with 2412 rules applied. Total rules applied 186789 place count 5431 transition count 9046
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 6 with 201 rules applied. Total rules applied 186990 place count 5230 transition count 9046
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 201 Pre rules applied. Total rules applied 186990 place count 5230 transition count 8845
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 7 with 402 rules applied. Total rules applied 187392 place count 5029 transition count 8845
Discarding 4220 places :
Symmetric choice reduction at 7 with 4220 rule applications. Total rules 191612 place count 809 transition count 4625
Ensure Unique test removed 202 places
Iterating global reduction 7 with 4422 rules applied. Total rules applied 196034 place count 607 transition count 4625
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 7 with 4221 rules applied. Total rules applied 200255 place count 607 transition count 404
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 8 with 201 rules applied. Total rules applied 200456 place count 406 transition count 404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 200456 place count 406 transition count 403
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 200458 place count 405 transition count 403
Discarding 200 places :
Symmetric choice reduction at 9 with 200 rule applications. Total rules 200658 place count 205 transition count 203
Ensure Unique test removed 1 places
Iterating global reduction 9 with 201 rules applied. Total rules applied 200859 place count 204 transition count 203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 200859 place count 204 transition count 201
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 200863 place count 202 transition count 201
Discarding 200 places :
Symmetric choice reduction at 9 with 200 rule applications. Total rules 201063 place count 2 transition count 1
Iterating global reduction 9 with 200 rules applied. Total rules applied 201263 place count 2 transition count 1
Applied a total of 201263 rules in 17529 ms. Remains 2 /101954 variables (removed 101952) and now considering 1/110159 (removed 110158) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/101954 places, 1/110159 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 8 factoid took 507 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1]
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:18:22] [INFO ] Computed 4026 place invariants in 20190 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1]
Product exploration timeout after 50130 steps with 57 reset in 10002 ms.
Product exploration timeout after 48750 steps with 95 reset in 10001 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1]
Support contains 4423 out of 101954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101954/101954 places, 110159/110159 transitions.
Graph (complete) has 138288 edges and 101954 vertex of which 99529 are kept as prefixes of interest. Removing 2425 places using SCC suffix rule.161 ms
Discarding 2425 places :
Also discarding 2423 output transitions
Drop transitions removed 2423 transitions
Performed 16566 Post agglomeration using F-continuation condition.
Performed 34868 Post agglomeration using F-continuation condition.
Performed 35577 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35577 rules applied. Total rules applied 35578 place count 99529 transition count 107736
Performed 22914 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22914 Pre rules applied. Total rules applied 35578 place count 99529 transition count 110148
Deduced a syphon composed of 58491 places in 95 ms
Iterating global reduction 1 with 22914 rules applied. Total rules applied 58492 place count 99529 transition count 110148
Performed 11357 Post agglomeration using F-continuation condition.
Performed 11859 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 70350 places in 122 ms
Iterating global reduction 1 with 11859 rules applied. Total rules applied 70351 place count 99529 transition count 110148
Deduced a syphon composed of 70350 places in 57 ms
Applied a total of 70351 rules in 148265 ms. Remains 99529 /101954 variables (removed 2425) and now considering 110148/110159 (removed 11) transitions.
// Phase 1: matrix 110148 rows 99529 cols
[2022-05-16 13:22:05] [INFO ] Computed 3823 place invariants in 39603 ms
[2022-05-16 13:22:14] [INFO ] Dead Transitions using invariants and state equation in 48193 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99529/101954 places, 110148/110159 transitions.
Finished structural reductions, in 1 iterations. Remains : 99529/101954 places, 110148/110159 transitions.
Product exploration timeout after 53470 steps with 28 reset in 10001 ms.
Product exploration timeout after 53830 steps with 25 reset in 10001 ms.
Built C files in :
/tmp/ltsmin7626967403737990407
[2022-05-16 13:22:35] [INFO ] Built C files in 1027ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7626967403737990407
Running compilation step : cd /tmp/ltsmin7626967403737990407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7626967403737990407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7626967403737990407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4423 out of 101954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101954/101954 places, 110159/110159 transitions.
Applied a total of 0 rules in 845 ms. Remains 101954 /101954 variables (removed 0) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:22:57] [INFO ] Computed 4026 place invariants in 18467 ms
[2022-05-16 13:23:05] [INFO ] Implicit Places using invariants in 25979 ms returned []
Implicit Place search using SMT only with invariants took 26001 ms to find 0 implicit places.
// Phase 1: matrix 110159 rows 101954 cols
[2022-05-16 13:23:25] [INFO ] Computed 4026 place invariants in 19621 ms
[2022-05-16 13:23:32] [INFO ] Dead Transitions using invariants and state equation in 27546 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101954/101954 places, 110159/110159 transitions.
Built C files in :
/tmp/ltsmin9471456508890773821
[2022-05-16 13:23:34] [INFO ] Built C files in 626ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9471456508890773821
Running compilation step : cd /tmp/ltsmin9471456508890773821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9471456508890773821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9471456508890773821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 13:23:44] [INFO ] Flatten gal took : 3671 ms
[2022-05-16 13:23:47] [INFO ] Flatten gal took : 3037 ms
[2022-05-16 13:23:48] [INFO ] Time to serialize gal into /tmp/LTL678458169634261944.gal : 1322 ms
[2022-05-16 13:23:48] [INFO ] Time to serialize properties into /tmp/LTL1088140076417252703.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL678458169634261944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1088140076417252703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6784581...265
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-16 13:24:06] [INFO ] Flatten gal took : 2975 ms
[2022-05-16 13:24:06] [INFO ] Applying decomposition
[2022-05-16 13:24:09] [INFO ] Flatten gal took : 2843 ms
[2022-05-16 13:25:13] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1829670774480934075.txt' '-o' '/tmp/graph1829670774480934075.bin' '-w' '/tmp/graph1829670774480934075.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:654)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:25:20] [INFO ] Flatten gal took : 4993 ms
[2022-05-16 13:25:20] [INFO ] Time to serialize gal into /tmp/LTL8227942542108096707.gal : 532 ms
[2022-05-16 13:25:20] [INFO ] Time to serialize properties into /tmp/LTL13102335689475632769.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8227942542108096707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13102335689475632769.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8227942...267
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1983912644373828308
[2022-05-16 13:25:43] [INFO ] Built C files in 1510ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1983912644373828308
Running compilation step : cd /tmp/ltsmin1983912644373828308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1983912644373828308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1983912644373828308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-00 finished in 827838 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 4422 out of 106790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106790/106790 places, 110159/110159 transitions.
Graph (complete) has 150158 edges and 106790 vertex of which 100130 are kept as prefixes of interest. Removing 6660 places using SCC suffix rule.175 ms
Discarding 6660 places :
Also discarding 5237 output transitions
Drop transitions removed 5237 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 54672 transitions
Trivial Post-agglo rules discarded 54672 transitions
Performed 54672 trivial Post agglomeration. Transition count delta: 54672
Iterating post reduction 0 with 58893 rules applied. Total rules applied 58894 place count 95708 transition count 50049
Reduce places removed 54672 places and 0 transitions.
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Iterating post reduction 1 with 58893 rules applied. Total rules applied 117787 place count 41036 transition count 45828
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 2 with 4221 rules applied. Total rules applied 122008 place count 36815 transition count 45828

BK_STOP 1652707628958

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00200M0020C010P010G005, 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 r078-tall-165260110600651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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