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.r165-tall-167838850400395.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 itstools
Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850400395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 23K Feb 26 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 162K 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 9.1K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 26 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 316K Feb 26 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 26 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 180K Feb 26 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 552K 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-PT-L00010M0001C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679483690585

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 11:14:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 11:14:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:14:56] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-22 11:14:56] [INFO ] Transformed 1475 places.
[2023-03-22 11:14:56] [INFO ] Transformed 1234 transitions.
[2023-03-22 11:14:56] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 293 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 28 places and 0 transitions.
Discarding 110 places :
Implicit places reduction removed 110 places
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1327 transition count 1234
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 215 place count 1250 transition count 1157
Iterating global reduction 1 with 77 rules applied. Total rules applied 292 place count 1250 transition count 1157
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 303 place count 1239 transition count 1157
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 324 place count 1218 transition count 1136
Iterating global reduction 2 with 21 rules applied. Total rules applied 345 place count 1218 transition count 1136
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 367 place count 1207 transition count 1125
Applied a total of 367 rules in 266 ms. Remains 1207 /1465 variables (removed 258) and now considering 1125/1234 (removed 109) transitions.
// Phase 1: matrix 1125 rows 1207 cols
[2023-03-22 11:14:56] [INFO ] Computed 174 place invariants in 59 ms
[2023-03-22 11:14:57] [INFO ] Implicit Places using invariants in 614 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 665 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1152/1465 places, 1125/1234 transitions.
Applied a total of 0 rules in 23 ms. Remains 1152 /1152 variables (removed 0) and now considering 1125/1125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 955 ms. Remains : 1152/1465 places, 1125/1234 transitions.
Support contains 293 out of 1152 places after structural reductions.
[2023-03-22 11:14:57] [INFO ] Flatten gal took : 97 ms
[2023-03-22 11:14:57] [INFO ] Flatten gal took : 56 ms
[2023-03-22 11:14:57] [INFO ] Input system was already deterministic with 1125 transitions.
Support contains 292 out of 1152 places (down from 293) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 21) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1125 rows 1152 cols
[2023-03-22 11:14:58] [INFO ] Computed 119 place invariants in 16 ms
[2023-03-22 11:14:58] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2023-03-22 11:14:58] [INFO ] [Real]Absence check using 3 positive and 116 generalized place invariants in 27 ms returned sat
[2023-03-22 11:14:59] [INFO ] After 740ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1152 stabilizing places and 1125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1152 transition count 1125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 112 out of 1152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Graph (complete) has 1578 edges and 1152 vertex of which 1148 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 450 rules applied. Total rules applied 451 place count 1115 transition count 686
Reduce places removed 428 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 450 rules applied. Total rules applied 901 place count 687 transition count 664
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 923 place count 665 transition count 664
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 923 place count 665 transition count 510
Deduced a syphon composed of 154 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 3 with 341 rules applied. Total rules applied 1264 place count 478 transition count 510
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 3 with 22 rules applied. Total rules applied 1286 place count 456 transition count 510
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1286 place count 456 transition count 499
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1308 place count 445 transition count 499
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1333 place count 420 transition count 443
Iterating global reduction 4 with 25 rules applied. Total rules applied 1358 place count 420 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1358 place count 420 transition count 442
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1360 place count 419 transition count 442
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1373 place count 406 transition count 409
Iterating global reduction 4 with 13 rules applied. Total rules applied 1386 place count 406 transition count 409
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 33 rules applied. Total rules applied 1419 place count 395 transition count 387
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1430 place count 384 transition count 387
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1430 place count 384 transition count 376
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1452 place count 373 transition count 376
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1453 place count 372 transition count 365
Iterating global reduction 6 with 1 rules applied. Total rules applied 1454 place count 372 transition count 365
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 1542 place count 328 transition count 321
Applied a total of 1542 rules in 143 ms. Remains 328 /1152 variables (removed 824) and now considering 321/1125 (removed 804) transitions.
// Phase 1: matrix 321 rows 328 cols
[2023-03-22 11:14:59] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-22 11:14:59] [INFO ] Implicit Places using invariants in 121 ms returned [11, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 101, 146, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 316]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 123 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/1152 places, 321/1125 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 302 transition count 310
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 291 transition count 310
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 22 place count 291 transition count 288
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 66 place count 269 transition count 288
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 258 transition count 277
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 110 place count 247 transition count 277
Applied a total of 110 rules in 24 ms. Remains 247 /302 variables (removed 55) and now considering 277/321 (removed 44) transitions.
// Phase 1: matrix 277 rows 247 cols
[2023-03-22 11:14:59] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 11:14:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-22 11:14:59] [INFO ] Invariant cache hit.
[2023-03-22 11:14:59] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/1152 places, 277/1125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 247/1152 places, 277/1125 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 1 (ADD s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99)) (LEQ (ADD s234 s235) (ADD s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 861 reset in 363 ms.
Product exploration explored 100000 steps with 862 reset in 302 ms.
Computed a total of 247 stabilizing places and 277 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 277
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 finished in 1649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p0)))&&(p1||G(p2)))))'
Support contains 57 out of 1152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Reduce places removed 17 places and 0 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 1113 transition count 1125
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 86 place count 1066 transition count 1057
Iterating global reduction 1 with 47 rules applied. Total rules applied 133 place count 1066 transition count 1057
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 144 place count 1055 transition count 1057
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 178 place count 1021 transition count 1003
Iterating global reduction 2 with 34 rules applied. Total rules applied 212 place count 1021 transition count 1003
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 255 place count 978 transition count 960
Iterating global reduction 2 with 43 rules applied. Total rules applied 298 place count 978 transition count 960
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 309 place count 978 transition count 949
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 319 place count 968 transition count 929
Iterating global reduction 3 with 10 rules applied. Total rules applied 329 place count 968 transition count 929
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 339 place count 958 transition count 919
Iterating global reduction 3 with 10 rules applied. Total rules applied 349 place count 958 transition count 919
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 359 place count 948 transition count 909
Iterating global reduction 3 with 10 rules applied. Total rules applied 369 place count 948 transition count 909
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 379 place count 938 transition count 899
Iterating global reduction 3 with 10 rules applied. Total rules applied 389 place count 938 transition count 899
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 399 place count 928 transition count 889
Iterating global reduction 3 with 10 rules applied. Total rules applied 409 place count 928 transition count 889
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 410 place count 927 transition count 889
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 420 place count 917 transition count 869
Iterating global reduction 4 with 10 rules applied. Total rules applied 430 place count 917 transition count 869
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 440 place count 907 transition count 859
Iterating global reduction 4 with 10 rules applied. Total rules applied 450 place count 907 transition count 859
Applied a total of 450 rules in 660 ms. Remains 907 /1152 variables (removed 245) and now considering 859/1125 (removed 266) transitions.
// Phase 1: matrix 859 rows 907 cols
[2023-03-22 11:15:01] [INFO ] Computed 81 place invariants in 6 ms
[2023-03-22 11:15:01] [INFO ] Implicit Places using invariants in 268 ms returned [176, 807]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 276 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 905/1152 places, 859/1125 transitions.
Applied a total of 0 rules in 24 ms. Remains 905 /905 variables (removed 0) and now considering 859/859 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 960 ms. Remains : 905/1152 places, 859/1125 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 4}]], initial=0, aps=[p1:(GT 2 (ADD s564 s565 s566 s567 s568 s569 s570 s571 s572 s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585)), p2:(LEQ (ADD s411 s412) (AD...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 691 ms.
Product exploration explored 100000 steps with 33333 reset in 529 ms.
Computed a total of 905 stabilizing places and 859 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 905 transition count 859
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (OR p1 p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (OR p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 17 factoid took 370 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 finished in 3063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 44 out of 1152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Reduce places removed 17 places and 0 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 1113 transition count 1125
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 97 place count 1055 transition count 1046
Iterating global reduction 1 with 58 rules applied. Total rules applied 155 place count 1055 transition count 1046
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 200 place count 1010 transition count 981
Iterating global reduction 1 with 45 rules applied. Total rules applied 245 place count 1010 transition count 981
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 278 place count 977 transition count 938
Iterating global reduction 1 with 33 rules applied. Total rules applied 311 place count 977 transition count 938
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 322 place count 966 transition count 938
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 344 place count 944 transition count 896
Iterating global reduction 2 with 22 rules applied. Total rules applied 366 place count 944 transition count 896
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 387 place count 923 transition count 875
Iterating global reduction 2 with 21 rules applied. Total rules applied 408 place count 923 transition count 875
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 429 place count 902 transition count 854
Iterating global reduction 2 with 21 rules applied. Total rules applied 450 place count 902 transition count 854
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 471 place count 881 transition count 833
Iterating global reduction 2 with 21 rules applied. Total rules applied 492 place count 881 transition count 833
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 513 place count 860 transition count 812
Iterating global reduction 2 with 21 rules applied. Total rules applied 534 place count 860 transition count 812
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 535 place count 859 transition count 812
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 556 place count 838 transition count 791
Iterating global reduction 3 with 21 rules applied. Total rules applied 577 place count 838 transition count 791
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 598 place count 817 transition count 770
Iterating global reduction 3 with 21 rules applied. Total rules applied 619 place count 817 transition count 770
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 630 place count 806 transition count 759
Iterating global reduction 3 with 11 rules applied. Total rules applied 641 place count 806 transition count 759
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 652 place count 795 transition count 748
Iterating global reduction 3 with 11 rules applied. Total rules applied 663 place count 795 transition count 748
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 674 place count 784 transition count 737
Iterating global reduction 3 with 11 rules applied. Total rules applied 685 place count 784 transition count 737
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 696 place count 773 transition count 726
Iterating global reduction 3 with 11 rules applied. Total rules applied 707 place count 773 transition count 726
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 718 place count 762 transition count 715
Iterating global reduction 3 with 11 rules applied. Total rules applied 729 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 740 place count 751 transition count 704
Iterating global reduction 3 with 11 rules applied. Total rules applied 751 place count 751 transition count 704
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 762 place count 751 transition count 693
Applied a total of 762 rules in 334 ms. Remains 751 /1152 variables (removed 401) and now considering 693/1125 (removed 432) transitions.
// Phase 1: matrix 693 rows 751 cols
[2023-03-22 11:15:04] [INFO ] Computed 81 place invariants in 10 ms
[2023-03-22 11:15:04] [INFO ] Implicit Places using invariants in 168 ms returned [154, 338, 640]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 171 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 748/1152 places, 693/1125 transitions.
Applied a total of 0 rules in 12 ms. Remains 748 /748 variables (removed 0) and now considering 693/693 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 517 ms. Remains : 748/1152 places, 693/1125 transitions.
Stuttering acceptance computed with spot in 663 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT (ADD s373 s374 s375 s376 s377 s378 s379 s380 s381 s382 s383) (ADD s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 finished in 1204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U p2)))'
Support contains 92 out of 1152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Graph (complete) has 1578 edges and 1152 vertex of which 1148 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 430 place count 1137 transition count 685
Reduce places removed 429 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 472 rules applied. Total rules applied 902 place count 708 transition count 642
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 945 place count 665 transition count 642
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 188 Pre rules applied. Total rules applied 945 place count 665 transition count 454
Deduced a syphon composed of 188 places in 0 ms
Ensure Unique test removed 77 places
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 3 with 453 rules applied. Total rules applied 1398 place count 400 transition count 454
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1398 place count 400 transition count 443
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1420 place count 389 transition count 443
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1423 place count 386 transition count 420
Iterating global reduction 3 with 3 rules applied. Total rules applied 1426 place count 386 transition count 420
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 1437 place count 375 transition count 420
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1437 place count 375 transition count 409
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1459 place count 364 transition count 409
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1460 place count 363 transition count 398
Iterating global reduction 4 with 1 rules applied. Total rules applied 1461 place count 363 transition count 398
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 33 rules applied. Total rules applied 1494 place count 352 transition count 376
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1505 place count 341 transition count 376
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1505 place count 341 transition count 365
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 1527 place count 330 transition count 365
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 6 with 44 rules applied. Total rules applied 1571 place count 308 transition count 343
Applied a total of 1571 rules in 67 ms. Remains 308 /1152 variables (removed 844) and now considering 343/1125 (removed 782) transitions.
// Phase 1: matrix 343 rows 308 cols
[2023-03-22 11:15:05] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-22 11:15:05] [INFO ] Implicit Places using invariants in 320 ms returned [11, 137, 274]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 322 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/1152 places, 343/1125 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 305 transition count 321
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 283 transition count 321
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 55 place count 272 transition count 321
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 55 place count 272 transition count 310
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 77 place count 261 transition count 310
Applied a total of 77 rules in 24 ms. Remains 261 /305 variables (removed 44) and now considering 310/343 (removed 33) transitions.
// Phase 1: matrix 310 rows 261 cols
[2023-03-22 11:15:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 11:15:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-22 11:15:05] [INFO ] Invariant cache hit.
[2023-03-22 11:15:05] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 261/1152 places, 310/1125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 632 ms. Remains : 261/1152 places, 310/1125 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p2), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(LEQ (ADD s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249) (ADD s33 s34 s35 s36 s37 s38 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2702 steps with 23 reset in 10 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 1152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Reduce places removed 15 places and 0 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 1115 transition count 1125
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 84 place count 1068 transition count 1068
Iterating global reduction 1 with 47 rules applied. Total rules applied 131 place count 1068 transition count 1068
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 142 place count 1057 transition count 1068
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 186 place count 1013 transition count 1014
Iterating global reduction 2 with 44 rules applied. Total rules applied 230 place count 1013 transition count 1014
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 263 place count 980 transition count 971
Iterating global reduction 2 with 33 rules applied. Total rules applied 296 place count 980 transition count 971
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 318 place count 969 transition count 960
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 349 place count 938 transition count 909
Iterating global reduction 3 with 31 rules applied. Total rules applied 380 place count 938 transition count 909
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 401 place count 917 transition count 878
Iterating global reduction 3 with 21 rules applied. Total rules applied 422 place count 917 transition count 878
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 443 place count 896 transition count 857
Iterating global reduction 3 with 21 rules applied. Total rules applied 464 place count 896 transition count 857
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 485 place count 875 transition count 836
Iterating global reduction 3 with 21 rules applied. Total rules applied 506 place count 875 transition count 836
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 537 place count 844 transition count 805
Iterating global reduction 3 with 31 rules applied. Total rules applied 568 place count 844 transition count 805
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 589 place count 823 transition count 774
Iterating global reduction 3 with 21 rules applied. Total rules applied 610 place count 823 transition count 774
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 631 place count 802 transition count 753
Iterating global reduction 3 with 21 rules applied. Total rules applied 652 place count 802 transition count 753
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 663 place count 791 transition count 742
Iterating global reduction 3 with 11 rules applied. Total rules applied 674 place count 791 transition count 742
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 685 place count 780 transition count 731
Iterating global reduction 3 with 11 rules applied. Total rules applied 696 place count 780 transition count 731
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 707 place count 769 transition count 720
Iterating global reduction 3 with 11 rules applied. Total rules applied 718 place count 769 transition count 720
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 729 place count 758 transition count 709
Iterating global reduction 3 with 11 rules applied. Total rules applied 740 place count 758 transition count 709
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 751 place count 747 transition count 698
Iterating global reduction 3 with 11 rules applied. Total rules applied 762 place count 747 transition count 698
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 773 place count 736 transition count 687
Iterating global reduction 3 with 11 rules applied. Total rules applied 784 place count 736 transition count 687
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 795 place count 736 transition count 676
Applied a total of 795 rules in 390 ms. Remains 736 /1152 variables (removed 416) and now considering 676/1125 (removed 449) transitions.
// Phase 1: matrix 676 rows 736 cols
[2023-03-22 11:15:06] [INFO ] Computed 73 place invariants in 3 ms
[2023-03-22 11:15:06] [INFO ] Implicit Places using invariants in 169 ms returned [143, 331, 636]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 170 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 733/1152 places, 676/1125 transitions.
Applied a total of 0 rules in 16 ms. Remains 733 /733 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 579 ms. Remains : 733/1152 places, 676/1125 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 1 (ADD s343 s344))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 377 ms.
Product exploration explored 100000 steps with 25000 reset in 362 ms.
Computed a total of 733 stabilizing places and 676 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 733 transition count 676
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 590 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=98 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 733 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 733/733 places, 676/676 transitions.
Applied a total of 0 rules in 20 ms. Remains 733 /733 variables (removed 0) and now considering 676/676 (removed 0) transitions.
// Phase 1: matrix 676 rows 733 cols
[2023-03-22 11:15:08] [INFO ] Computed 70 place invariants in 6 ms
[2023-03-22 11:15:08] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-22 11:15:08] [INFO ] Invariant cache hit.
[2023-03-22 11:15:09] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2023-03-22 11:15:09] [INFO ] Invariant cache hit.
[2023-03-22 11:15:09] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 891 ms. Remains : 733/733 places, 676/676 transitions.
Computed a total of 733 stabilizing places and 676 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 733 transition count 676
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 939 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 617 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=44 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 326 ms.
Product exploration explored 100000 steps with 25000 reset in 335 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 733 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 733/733 places, 676/676 transitions.
Graph (complete) has 826 edges and 733 vertex of which 730 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 258 rules applied. Total rules applied 259 place count 730 transition count 671
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 287 Pre rules applied. Total rules applied 259 place count 730 transition count 716
Deduced a syphon composed of 543 places in 0 ms
Iterating global reduction 1 with 287 rules applied. Total rules applied 546 place count 730 transition count 716
Discarding 385 places :
Symmetric choice reduction at 1 with 385 rule applications. Total rules 931 place count 345 transition count 331
Deduced a syphon composed of 158 places in 0 ms
Iterating global reduction 1 with 385 rules applied. Total rules applied 1316 place count 345 transition count 331
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 203 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 1361 place count 345 transition count 331
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 1395 place count 311 transition count 297
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 1429 place count 311 transition count 297
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 180 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1440 place count 311 transition count 319
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1451 place count 300 transition count 297
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1462 place count 300 transition count 297
Deduced a syphon composed of 169 places in 0 ms
Applied a total of 1462 rules in 105 ms. Remains 300 /733 variables (removed 433) and now considering 297/676 (removed 379) transitions.
[2023-03-22 11:15:12] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 297 rows 300 cols
[2023-03-22 11:15:12] [INFO ] Computed 70 place invariants in 5 ms
[2023-03-22 11:15:12] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/733 places, 297/676 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 300/733 places, 297/676 transitions.
Built C files in :
/tmp/ltsmin2921492853836752705
[2023-03-22 11:15:12] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2921492853836752705
Running compilation step : cd /tmp/ltsmin2921492853836752705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1003 ms.
Running link step : cd /tmp/ltsmin2921492853836752705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2921492853836752705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1713851217486160721.hoa' '--buchi-type=spotba'
LTSmin run took 366 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07 finished in 8125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)))))'
Support contains 5 out of 1152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Reduce places removed 16 places and 0 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 1114 transition count 1125
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 94 place count 1058 transition count 1048
Iterating global reduction 1 with 56 rules applied. Total rules applied 150 place count 1058 transition count 1048
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 161 place count 1047 transition count 1048
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 204 place count 1004 transition count 995
Iterating global reduction 2 with 43 rules applied. Total rules applied 247 place count 1004 transition count 995
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 280 place count 971 transition count 952
Iterating global reduction 2 with 33 rules applied. Total rules applied 313 place count 971 transition count 952
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 324 place count 960 transition count 952
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 344 place count 940 transition count 923
Iterating global reduction 3 with 20 rules applied. Total rules applied 364 place count 940 transition count 923
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 383 place count 921 transition count 904
Iterating global reduction 3 with 19 rules applied. Total rules applied 402 place count 921 transition count 904
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 421 place count 902 transition count 885
Iterating global reduction 3 with 19 rules applied. Total rules applied 440 place count 902 transition count 885
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 459 place count 883 transition count 866
Iterating global reduction 3 with 19 rules applied. Total rules applied 478 place count 883 transition count 866
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 497 place count 864 transition count 847
Iterating global reduction 3 with 19 rules applied. Total rules applied 516 place count 864 transition count 847
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 535 place count 845 transition count 820
Iterating global reduction 3 with 19 rules applied. Total rules applied 554 place count 845 transition count 820
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 573 place count 826 transition count 801
Iterating global reduction 3 with 19 rules applied. Total rules applied 592 place count 826 transition count 801
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 603 place count 815 transition count 790
Iterating global reduction 3 with 11 rules applied. Total rules applied 614 place count 815 transition count 790
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 625 place count 804 transition count 779
Iterating global reduction 3 with 11 rules applied. Total rules applied 636 place count 804 transition count 779
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 646 place count 794 transition count 769
Iterating global reduction 3 with 10 rules applied. Total rules applied 656 place count 794 transition count 769
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 666 place count 784 transition count 759
Iterating global reduction 3 with 10 rules applied. Total rules applied 676 place count 784 transition count 759
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 686 place count 774 transition count 749
Iterating global reduction 3 with 10 rules applied. Total rules applied 696 place count 774 transition count 749
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 706 place count 764 transition count 739
Iterating global reduction 3 with 10 rules applied. Total rules applied 716 place count 764 transition count 739
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 726 place count 764 transition count 729
Applied a total of 726 rules in 346 ms. Remains 764 /1152 variables (removed 388) and now considering 729/1125 (removed 396) transitions.
// Phase 1: matrix 729 rows 764 cols
[2023-03-22 11:15:14] [INFO ] Computed 71 place invariants in 11 ms
[2023-03-22 11:15:14] [INFO ] Implicit Places using invariants in 187 ms returned [321, 358, 664]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 189 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 761/1152 places, 729/1125 transitions.
Applied a total of 0 rules in 15 ms. Remains 761 /761 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 551 ms. Remains : 761/1152 places, 729/1125 transitions.
Stuttering acceptance computed with spot in 523 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GT 1 s226), p0:(GT s174 s334), p1:(LEQ s317 s430)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 finished in 1097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Graph (complete) has 1578 edges and 1152 vertex of which 1061 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.1 ms
Discarding 91 places :
Also discarding 94 output transitions
Drop transitions removed 94 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 601 transitions
Trivial Post-agglo rules discarded 601 transitions
Performed 601 trivial Post agglomeration. Transition count delta: 601
Iterating post reduction 0 with 623 rules applied. Total rules applied 624 place count 1028 transition count 419
Reduce places removed 601 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 602 rules applied. Total rules applied 1226 place count 427 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1227 place count 426 transition count 418
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 1227 place count 426 transition count 263
Deduced a syphon composed of 155 places in 6 ms
Ensure Unique test removed 55 places
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 3 with 365 rules applied. Total rules applied 1592 place count 216 transition count 263
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 1614 place count 216 transition count 241
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1636 place count 194 transition count 241
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1636 place count 194 transition count 230
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1658 place count 183 transition count 230
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1682 place count 159 transition count 176
Iterating global reduction 5 with 24 rules applied. Total rules applied 1706 place count 159 transition count 176
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 43 rules applied. Total rules applied 1749 place count 148 transition count 144
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 11 rules applied. Total rules applied 1760 place count 138 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1761 place count 137 transition count 143
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 1761 place count 137 transition count 131
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1785 place count 125 transition count 131
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1787 place count 123 transition count 118
Iterating global reduction 8 with 2 rules applied. Total rules applied 1789 place count 123 transition count 118
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 8 with 33 rules applied. Total rules applied 1822 place count 112 transition count 96
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1833 place count 101 transition count 96
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 11 Pre rules applied. Total rules applied 1833 place count 101 transition count 85
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1855 place count 90 transition count 85
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1856 place count 89 transition count 74
Iterating global reduction 10 with 1 rules applied. Total rules applied 1857 place count 89 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1881 place count 77 transition count 62
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 10 with 11 rules applied. Total rules applied 1892 place count 66 transition count 51
Applied a total of 1892 rules in 45 ms. Remains 66 /1152 variables (removed 1086) and now considering 51/1125 (removed 1074) transitions.
// Phase 1: matrix 51 rows 66 cols
[2023-03-22 11:15:15] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-22 11:15:15] [INFO ] Implicit Places using invariants in 54 ms returned [0, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 37, 49, 54]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 54 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/1152 places, 51/1125 transitions.
Graph (complete) has 50 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 39 transition count 28
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 28 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 27 transition count 27
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 25 place count 27 transition count 17
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 45 place count 17 transition count 17
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 53 place count 9 transition count 9
Iterating global reduction 3 with 8 rules applied. Total rules applied 61 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 8 transition count 8
Applied a total of 63 rules in 2 ms. Remains 8 /51 variables (removed 43) and now considering 8/51 (removed 43) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-22 11:15:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 11:15:15] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 11:15:15] [INFO ] Invariant cache hit.
[2023-03-22 11:15:15] [INFO ] Implicit Places using invariants and state equation in 20 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/1152 places, 8/1125 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 143 ms. Remains : 7/1152 places, 8/1125 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 s3) (LEQ 1 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 31695 reset in 49 ms.
Product exploration explored 100000 steps with 31815 reset in 60 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 8 rows 7 cols
[2023-03-22 11:15:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 11:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:15:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 11:15:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:15:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 11:15:16] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 11:15:16] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 11:15:16] [INFO ] Invariant cache hit.
[2023-03-22 11:15:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 11:15:16] [INFO ] Invariant cache hit.
[2023-03-22 11:15:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 11:15:16] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-22 11:15:16] [INFO ] Invariant cache hit.
[2023-03-22 11:15:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 7/7 places, 8/8 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-22 11:15:16] [INFO ] Invariant cache hit.
[2023-03-22 11:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:15:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 11:15:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:15:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 11:15:16] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 11:15:16] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 141 ms :[(NOT p0)]
Product exploration explored 100000 steps with 31842 reset in 70 ms.
Product exploration explored 100000 steps with 31777 reset in 56 ms.
Built C files in :
/tmp/ltsmin14266135505385253879
[2023-03-22 11:15:16] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2023-03-22 11:15:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 11:15:16] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2023-03-22 11:15:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 11:15:16] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2023-03-22 11:15:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 11:15:16] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14266135505385253879
Running compilation step : cd /tmp/ltsmin14266135505385253879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin14266135505385253879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14266135505385253879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12302472704257848954.hoa' '--buchi-type=spotba'
LTSmin run took 245 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 finished in 2117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Graph (complete) has 1578 edges and 1152 vertex of which 399 are kept as prefixes of interest. Removing 753 places using SCC suffix rule.2 ms
Discarding 753 places :
Also discarding 729 output transitions
Drop transitions removed 729 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 341 rules applied. Total rules applied 342 place count 366 transition count 66
Reduce places removed 319 places and 0 transitions.
Iterating post reduction 1 with 319 rules applied. Total rules applied 661 place count 47 transition count 66
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 661 place count 47 transition count 55
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 683 place count 36 transition count 55
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 693 place count 26 transition count 45
Iterating global reduction 2 with 10 rules applied. Total rules applied 703 place count 26 transition count 45
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 713 place count 16 transition count 25
Iterating global reduction 2 with 10 rules applied. Total rules applied 723 place count 16 transition count 25
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 733 place count 6 transition count 5
Iterating global reduction 2 with 10 rules applied. Total rules applied 743 place count 6 transition count 5
Applied a total of 743 rules in 8 ms. Remains 6 /1152 variables (removed 1146) and now considering 5/1125 (removed 1120) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-22 11:15:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 11:15:17] [INFO ] Implicit Places using invariants in 17 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/1152 places, 5/1125 transitions.
Graph (complete) has 4 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 3
Applied a total of 3 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-22 11:15:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 11:15:17] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-22 11:15:17] [INFO ] Invariant cache hit.
[2023-03-22 11:15:17] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/1152 places, 3/1125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56 ms. Remains : 3/1152 places, 3/1125 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 finished in 147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1152/1152 places, 1125/1125 transitions.
Graph (complete) has 1578 edges and 1152 vertex of which 385 are kept as prefixes of interest. Removing 767 places using SCC suffix rule.2 ms
Discarding 767 places :
Also discarding 743 output transitions
Drop transitions removed 743 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 335 rules applied. Total rules applied 336 place count 352 transition count 58
Reduce places removed 313 places and 0 transitions.
Iterating post reduction 1 with 313 rules applied. Total rules applied 649 place count 39 transition count 58
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 649 place count 39 transition count 47
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 671 place count 28 transition count 47
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 681 place count 18 transition count 27
Iterating global reduction 2 with 10 rules applied. Total rules applied 691 place count 18 transition count 27
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 703 place count 17 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 703 place count 17 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 705 place count 16 transition count 15
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 714 place count 7 transition count 6
Iterating global reduction 3 with 9 rules applied. Total rules applied 723 place count 7 transition count 6
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 725 place count 5 transition count 4
Applied a total of 725 rules in 13 ms. Remains 5 /1152 variables (removed 1147) and now considering 4/1125 (removed 1121) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-22 11:15:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 11:15:17] [INFO ] Implicit Places using invariants in 21 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1152 places, 4/1125 transitions.
Graph (complete) has 2 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-22 11:15:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 11:15:17] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-22 11:15:17] [INFO ] Invariant cache hit.
[2023-03-22 11:15:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/1152 places, 2/1125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 2/1152 places, 2/1125 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33333 reset in 39 ms.
Product exploration explored 100000 steps with 33333 reset in 45 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 finished in 353 ms.
All properties solved by simple procedures.
Total runtime 21820 ms.

BK_STOP 1679483724157

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-PT-L00010M0001C001P001G001"
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-5348"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850400395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00010M0001C001P001G001.tgz
mv FamilyReunion-PT-L00010M0001C001P001G001 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;