Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280400308.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280400308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 33K Apr 11 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 11 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 11 20:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 11 20:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 22K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 436K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 149K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 568K Apr 11 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 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-L00020M0002C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716652317593

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:52:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:52:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:52:01] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2024-05-25 15:52:01] [INFO ] Transformed 3271 places.
[2024-05-25 15:52:01] [INFO ] Transformed 2753 transitions.
[2024-05-25 15:52:01] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 645 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 601 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 76 places and 0 transitions.
Discarding 315 places :
Implicit places reduction removed 315 places
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 2869 transition count 2753
Discarding 252 places :
Symmetric choice reduction at 1 with 252 rule applications. Total rules 643 place count 2617 transition count 2480
Iterating global reduction 1 with 252 rules applied. Total rules applied 895 place count 2617 transition count 2480
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 938 place count 2574 transition count 2397
Iterating global reduction 1 with 43 rules applied. Total rules applied 981 place count 2574 transition count 2397
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 1002 place count 2553 transition count 2397
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1044 place count 2511 transition count 2335
Iterating global reduction 2 with 42 rules applied. Total rules applied 1086 place count 2511 transition count 2335
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1108 place count 2489 transition count 2293
Iterating global reduction 2 with 22 rules applied. Total rules applied 1130 place count 2489 transition count 2293
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1193 place count 2447 transition count 2272
Applied a total of 1193 rules in 1685 ms. Remains 2447 /3260 variables (removed 813) and now considering 2272/2753 (removed 481) transitions.
// Phase 1: matrix 2272 rows 2447 cols
[2024-05-25 15:52:03] [INFO ] Computed 320 invariants in 118 ms
[2024-05-25 15:52:04] [INFO ] Implicit Places using invariants in 1376 ms returned [1524, 1532, 1945]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1432 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2444/3260 places, 2272/2753 transitions.
Applied a total of 0 rules in 130 ms. Remains 2444 /2444 variables (removed 0) and now considering 2272/2272 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3250 ms. Remains : 2444/3260 places, 2272/2753 transitions.
Support contains 601 out of 2444 places after structural reductions.
[2024-05-25 15:52:05] [INFO ] Flatten gal took : 262 ms
[2024-05-25 15:52:05] [INFO ] Flatten gal took : 182 ms
[2024-05-25 15:52:05] [INFO ] Input system was already deterministic with 2272 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2272 rows 2444 cols
[2024-05-25 15:52:06] [INFO ] Computed 317 invariants in 84 ms
[2024-05-25 15:52:07] [INFO ] [Real]Absence check using 0 positive and 317 generalized place invariants in 154 ms returned sat
[2024-05-25 15:52:10] [INFO ] After 2489ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-25 15:52:10] [INFO ] After 2914ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:52:10] [INFO ] After 3845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:52:11] [INFO ] [Nat]Absence check using 0 positive and 317 generalized place invariants in 138 ms returned sat
[2024-05-25 15:52:14] [INFO ] After 2658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:52:15] [INFO ] After 3543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 629 ms.
[2024-05-25 15:52:15] [INFO ] After 5116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 448 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=56 )
Parikh walk visited 3 properties in 53 ms.
Computed a total of 2444 stabilizing places and 2272 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2444 transition count 2272
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(!p0))) U G(!p1)))'
Support contains 63 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Graph (complete) has 3274 edges and 2444 vertex of which 2061 are kept as prefixes of interest. Removing 383 places using SCC suffix rule.25 ms
Discarding 383 places :
Also discarding 359 output transitions
Drop transitions removed 359 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 1135 transitions
Trivial Post-agglo rules discarded 1135 transitions
Performed 1135 trivial Post agglomeration. Transition count delta: 1135
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1199 place count 1977 transition count 757
Reduce places removed 1135 places and 0 transitions.
Iterating post reduction 1 with 1135 rules applied. Total rules applied 2334 place count 842 transition count 757
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 170 Pre rules applied. Total rules applied 2334 place count 842 transition count 587
Deduced a syphon composed of 170 places in 0 ms
Ensure Unique test removed 63 places
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 403 rules applied. Total rules applied 2737 place count 609 transition count 587
Discarding 42 places :
Implicit places reduction removed 42 places
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 84 rules applied. Total rules applied 2821 place count 567 transition count 545
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 2863 place count 525 transition count 545
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2887 place count 501 transition count 481
Iterating global reduction 4 with 24 rules applied. Total rules applied 2911 place count 501 transition count 481
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 60 places :
Implicit places reduction removed 60 places
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 4 with 184 rules applied. Total rules applied 3095 place count 441 transition count 357
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 5 with 103 rules applied. Total rules applied 3198 place count 338 transition count 357
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 3198 place count 338 transition count 336
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 43 rules applied. Total rules applied 3241 place count 316 transition count 336
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 3283 place count 274 transition count 294
Iterating global reduction 6 with 42 rules applied. Total rules applied 3325 place count 274 transition count 294
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 3367 place count 274 transition count 252
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3367 place count 274 transition count 231
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 63 rules applied. Total rules applied 3430 place count 232 transition count 231
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3472 place count 211 transition count 210
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 3493 place count 190 transition count 189
Applied a total of 3493 rules in 310 ms. Remains 190 /2444 variables (removed 2254) and now considering 189/2272 (removed 2083) transitions.
// Phase 1: matrix 189 rows 190 cols
[2024-05-25 15:52:16] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 15:52:16] [INFO ] Implicit Places using invariants in 196 ms returned [42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 147]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 198 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/2444 places, 189/2272 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 168 transition count 168
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 147 transition count 168
Applied a total of 42 rules in 12 ms. Remains 147 /168 variables (removed 21) and now considering 168/189 (removed 21) transitions.
// Phase 1: matrix 168 rows 147 cols
[2024-05-25 15:52:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 15:52:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 15:52:16] [INFO ] Invariant cache hit.
[2024-05-25 15:52:16] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 147/2444 places, 168/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 709 ms. Remains : 147/2444 places, 168/2272 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 327 ms :[true, p1, (OR p0 p1), p1]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(OR (GEQ s92 1) (GEQ s91 1) (GEQ s94 1) (GEQ s93 1) (GEQ s96 1) (GEQ s95 1) (GEQ s98 1) (GEQ s97 1) (GEQ s84 1) (GEQ s86 1) (GEQ s85 1) (GEQ s88 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 6 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 finished in 1137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 105 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Graph (complete) has 3274 edges and 2444 vertex of which 1723 are kept as prefixes of interest. Removing 721 places using SCC suffix rule.11 ms
Discarding 721 places :
Also discarding 613 output transitions
Drop transitions removed 613 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 945 transitions
Trivial Post-agglo rules discarded 945 transitions
Performed 945 trivial Post agglomeration. Transition count delta: 945
Iterating post reduction 0 with 1008 rules applied. Total rules applied 1009 place count 1639 transition count 693
Reduce places removed 945 places and 0 transitions.
Iterating post reduction 1 with 945 rules applied. Total rules applied 1954 place count 694 transition count 693
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 1954 place count 694 transition count 586
Deduced a syphon composed of 107 places in 2 ms
Ensure Unique test removed 42 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 2210 place count 545 transition count 586
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2233 place count 522 transition count 523
Iterating global reduction 2 with 23 rules applied. Total rules applied 2256 place count 522 transition count 523
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Implicit places reduction removed 40 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 2 with 124 rules applied. Total rules applied 2380 place count 482 transition count 439
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 2443 place count 419 transition count 439
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 2443 place count 419 transition count 399
Deduced a syphon composed of 40 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 101 rules applied. Total rules applied 2544 place count 358 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 2586 place count 337 transition count 378
Applied a total of 2586 rules in 100 ms. Remains 337 /2444 variables (removed 2107) and now considering 378/2272 (removed 1894) transitions.
// Phase 1: matrix 378 rows 337 cols
[2024-05-25 15:52:17] [INFO ] Computed 22 invariants in 4 ms
[2024-05-25 15:52:17] [INFO ] Implicit Places using invariants in 227 ms returned [21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 252]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 230 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/2444 places, 378/2272 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 315 transition count 315
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 252 transition count 315
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 168 place count 231 transition count 336
Applied a total of 168 rules in 27 ms. Remains 231 /315 variables (removed 84) and now considering 336/378 (removed 42) transitions.
// Phase 1: matrix 336 rows 231 cols
[2024-05-25 15:52:17] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 15:52:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-25 15:52:17] [INFO ] Invariant cache hit.
[2024-05-25 15:52:17] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/2444 places, 336/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 650 ms. Remains : 231/2444 places, 336/2272 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s189 1) (GEQ s201 1) (GEQ s200 1) (GEQ s199 1) (GEQ s198 1) (GEQ s205 1) (GEQ s204 1) (GEQ s203 1) (GEQ s202 1) (GEQ s193 1) (GEQ s192 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3138 reset in 947 ms.
Product exploration explored 100000 steps with 3138 reset in 548 ms.
Computed a total of 231 stabilizing places and 336 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 336
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p1)))
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 finished in 2587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 129 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Graph (complete) has 3274 edges and 2444 vertex of which 1513 are kept as prefixes of interest. Removing 931 places using SCC suffix rule.5 ms
Discarding 931 places :
Also discarding 781 output transitions
Drop transitions removed 781 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 840 transitions
Trivial Post-agglo rules discarded 840 transitions
Performed 840 trivial Post agglomeration. Transition count delta: 840
Iterating post reduction 0 with 903 rules applied. Total rules applied 904 place count 1429 transition count 630
Reduce places removed 840 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 903 rules applied. Total rules applied 1807 place count 589 transition count 567
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 1870 place count 526 transition count 567
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1870 place count 526 transition count 525
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1954 place count 484 transition count 525
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 2000 place count 461 transition count 502
Applied a total of 2000 rules in 63 ms. Remains 461 /2444 variables (removed 1983) and now considering 502/2272 (removed 1770) transitions.
// Phase 1: matrix 502 rows 461 cols
[2024-05-25 15:52:20] [INFO ] Computed 83 invariants in 3 ms
[2024-05-25 15:52:20] [INFO ] Implicit Places using invariants in 307 ms returned [21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 311 ms to find 61 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/2444 places, 502/2272 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 400 transition count 439
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 337 transition count 439
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 126 place count 337 transition count 420
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 164 place count 318 transition count 420
Applied a total of 164 rules in 29 ms. Remains 318 /400 variables (removed 82) and now considering 420/502 (removed 82) transitions.
// Phase 1: matrix 420 rows 318 cols
[2024-05-25 15:52:20] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 15:52:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-25 15:52:20] [INFO ] Invariant cache hit.
[2024-05-25 15:52:20] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 318/2444 places, 420/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 760 ms. Remains : 318/2444 places, 420/2272 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (OR (LT s150 1) (LT s234 1)) (OR (LT s155 1) (LT s239 1)) (OR (LT s153 1) (LT s216 1)) (OR (LT s159 1) (LT s222 1)) (OR (LT s164 1) (LT s227 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1200 reset in 601 ms.
Product exploration explored 100000 steps with 1217 reset in 590 ms.
Computed a total of 318 stabilizing places and 420 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 318 transition count 420
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 p0)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 121 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 62 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-25 15:52:22] [INFO ] Invariant cache hit.
[2024-05-25 15:52:22] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 27 ms returned sat
[2024-05-25 15:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:52:23] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-05-25 15:52:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:52:23] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 14 ms returned sat
[2024-05-25 15:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:52:23] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-05-25 15:52:23] [INFO ] Computed and/alt/rep : 294/546/294 causal constraints (skipped 63 transitions) in 50 ms.
[2024-05-25 15:52:25] [INFO ] Added : 130 causal constraints over 26 iterations in 1254 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 42 out of 318 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 420/420 transitions.
Applied a total of 0 rules in 15 ms. Remains 318 /318 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-25 15:52:25] [INFO ] Invariant cache hit.
[2024-05-25 15:52:25] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-25 15:52:25] [INFO ] Invariant cache hit.
[2024-05-25 15:52:25] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-05-25 15:52:25] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-25 15:52:25] [INFO ] Invariant cache hit.
[2024-05-25 15:52:26] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1044 ms. Remains : 318/318 places, 420/420 transitions.
Computed a total of 318 stabilizing places and 420 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 318 transition count 420
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 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 90 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 110 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-25 15:52:26] [INFO ] Invariant cache hit.
[2024-05-25 15:52:26] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 9 ms returned sat
[2024-05-25 15:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:52:27] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2024-05-25 15:52:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:52:27] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 14 ms returned sat
[2024-05-25 15:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:52:27] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-05-25 15:52:27] [INFO ] Computed and/alt/rep : 294/546/294 causal constraints (skipped 63 transitions) in 39 ms.
[2024-05-25 15:52:29] [INFO ] Added : 130 causal constraints over 26 iterations in 1103 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1291 reset in 532 ms.
Product exploration explored 100000 steps with 1278 reset in 622 ms.
Built C files in :
/tmp/ltsmin10860318159026937704
[2024-05-25 15:52:30] [INFO ] Computing symmetric may disable matrix : 420 transitions.
[2024-05-25 15:52:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:52:30] [INFO ] Computing symmetric may enable matrix : 420 transitions.
[2024-05-25 15:52:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:52:30] [INFO ] Computing Do-Not-Accords matrix : 420 transitions.
[2024-05-25 15:52:30] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:52:30] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10860318159026937704
Running compilation step : cd /tmp/ltsmin10860318159026937704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1915 ms.
Running link step : cd /tmp/ltsmin10860318159026937704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10860318159026937704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6201053056841860845.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 42 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 420/420 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 318 transition count 357
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 255 transition count 357
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 126 place count 255 transition count 294
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 252 place count 192 transition count 294
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 275 place count 169 transition count 231
Ensure Unique test removed 21 places
Iterating global reduction 2 with 44 rules applied. Total rules applied 319 place count 148 transition count 231
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 2 with 105 rules applied. Total rules applied 424 place count 148 transition count 126
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 466 place count 106 transition count 126
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 487 place count 85 transition count 105
Applied a total of 487 rules in 15 ms. Remains 85 /318 variables (removed 233) and now considering 105/420 (removed 315) transitions.
// Phase 1: matrix 105 rows 85 cols
[2024-05-25 15:52:45] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 15:52:45] [INFO ] Implicit Places using invariants in 66 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/318 places, 105/420 transitions.
Reduce places removed 21 places and 21 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /84 variables (removed 21) and now considering 84/105 (removed 21) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 63/318 places, 84/420 transitions.
Built C files in :
/tmp/ltsmin11561374147633778931
[2024-05-25 15:52:45] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-25 15:52:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:52:45] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-25 15:52:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:52:45] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-25 15:52:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:52:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11561374147633778931
Running compilation step : cd /tmp/ltsmin11561374147633778931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 263 ms.
Running link step : cd /tmp/ltsmin11561374147633778931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11561374147633778931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1220374040486681063.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02 finished in 26046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(G(p0)) U p1))))'
Support contains 168 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 2360 transition count 2188
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 2360 transition count 2188
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 189 place count 2339 transition count 2188
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 253 place count 2275 transition count 2124
Iterating global reduction 1 with 64 rules applied. Total rules applied 317 place count 2275 transition count 2124
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 42 rules applied. Total rules applied 359 place count 2254 transition count 2103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 362 place count 2251 transition count 2060
Iterating global reduction 2 with 3 rules applied. Total rules applied 365 place count 2251 transition count 2060
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 2 with 19 rules applied. Total rules applied 384 place count 2232 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 426 place count 2190 transition count 2018
Iterating global reduction 3 with 42 rules applied. Total rules applied 468 place count 2190 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 510 place count 2148 transition count 1976
Iterating global reduction 3 with 42 rules applied. Total rules applied 552 place count 2148 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 594 place count 2106 transition count 1934
Iterating global reduction 3 with 42 rules applied. Total rules applied 636 place count 2106 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 678 place count 2064 transition count 1892
Iterating global reduction 3 with 42 rules applied. Total rules applied 720 place count 2064 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 762 place count 2022 transition count 1850
Iterating global reduction 3 with 42 rules applied. Total rules applied 804 place count 2022 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 846 place count 1980 transition count 1808
Iterating global reduction 3 with 42 rules applied. Total rules applied 888 place count 1980 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 930 place count 1938 transition count 1766
Iterating global reduction 3 with 42 rules applied. Total rules applied 972 place count 1938 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1014 place count 1896 transition count 1724
Iterating global reduction 3 with 42 rules applied. Total rules applied 1056 place count 1896 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1098 place count 1854 transition count 1682
Iterating global reduction 3 with 42 rules applied. Total rules applied 1140 place count 1854 transition count 1682
Applied a total of 1140 rules in 2119 ms. Remains 1854 /2444 variables (removed 590) and now considering 1682/2272 (removed 590) transitions.
// Phase 1: matrix 1682 rows 1854 cols
[2024-05-25 15:52:48] [INFO ] Computed 256 invariants in 21 ms
[2024-05-25 15:52:49] [INFO ] Implicit Places using invariants in 1270 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 483, 905, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 1011, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1664]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 1273 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1788/2444 places, 1682/2272 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1747 transition count 1641
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1747 transition count 1641
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1727 transition count 1601
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1727 transition count 1601
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1707 transition count 1581
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1707 transition count 1581
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1687 transition count 1561
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1687 transition count 1561
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1667 transition count 1541
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1667 transition count 1541
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1647 transition count 1521
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1647 transition count 1521
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1627 transition count 1501
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1627 transition count 1501
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1607 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1607 transition count 1481
Applied a total of 362 rules in 1133 ms. Remains 1607 /1788 variables (removed 181) and now considering 1481/1682 (removed 201) transitions.
// Phase 1: matrix 1481 rows 1607 cols
[2024-05-25 15:52:50] [INFO ] Computed 190 invariants in 10 ms
[2024-05-25 15:52:51] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-25 15:52:51] [INFO ] Invariant cache hit.
[2024-05-25 15:52:53] [INFO ] Implicit Places using invariants and state equation in 2591 ms returned []
Implicit Place search using SMT with State Equation took 3289 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1607/2444 places, 1481/2272 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7817 ms. Remains : 1607/2444 places, 1481/2272 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s316 1) (GEQ s505 1)) (AND (GEQ s353 1) (GEQ s542 1)) (AND (GEQ s321 1) (GEQ s510 1)) (AND (GEQ s311 1) (GEQ s500 1)) (AND (GEQ s343 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1214 steps with 0 reset in 37 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 finished in 8088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 126 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2381 transition count 2272
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 105 place count 2339 transition count 2230
Iterating global reduction 1 with 42 rules applied. Total rules applied 147 place count 2339 transition count 2230
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 168 place count 2318 transition count 2230
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 190 place count 2296 transition count 2208
Iterating global reduction 2 with 22 rules applied. Total rules applied 212 place count 2296 transition count 2208
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 42 rules applied. Total rules applied 254 place count 2275 transition count 2187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 255 place count 2274 transition count 2186
Iterating global reduction 3 with 1 rules applied. Total rules applied 256 place count 2274 transition count 2186
Applied a total of 256 rules in 1136 ms. Remains 2274 /2444 variables (removed 170) and now considering 2186/2272 (removed 86) transitions.
// Phase 1: matrix 2186 rows 2274 cols
[2024-05-25 15:52:55] [INFO ] Computed 212 invariants in 29 ms
[2024-05-25 15:52:56] [INFO ] Implicit Places using invariants in 1422 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 420, 1136, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1791, 1792, 1793, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1806, 1807, 1808, 1809, 1810, 2084]
Discarding 84 places :
Implicit Place search using SMT only with invariants took 1425 ms to find 84 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2190/2444 places, 2186/2272 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2149 transition count 2145
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2149 transition count 2145
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2129 transition count 2105
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2129 transition count 2105
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2109 transition count 2085
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2109 transition count 2085
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2089 transition count 2065
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2089 transition count 2065
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 2069 transition count 2045
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 2069 transition count 2045
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 2049 transition count 2025
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 2049 transition count 2025
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 2029 transition count 2005
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 2029 transition count 2005
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 2009 transition count 1985
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 2009 transition count 1985
Applied a total of 362 rules in 1744 ms. Remains 2009 /2190 variables (removed 181) and now considering 1985/2186 (removed 201) transitions.
// Phase 1: matrix 1985 rows 2009 cols
[2024-05-25 15:52:58] [INFO ] Computed 128 invariants in 17 ms
[2024-05-25 15:52:58] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-25 15:52:58] [INFO ] Invariant cache hit.
[2024-05-25 15:53:01] [INFO ] Implicit Places using invariants and state equation in 2689 ms returned []
Implicit Place search using SMT with State Equation took 3267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2009/2444 places, 1985/2272 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7574 ms. Remains : 2009/2444 places, 1985/2272 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s1346 1) (GEQ s1344 1) (GEQ s1350 1) (GEQ s1348 1) (GEQ s1354 1) (GEQ s1352 1) (GEQ s1358 1) (GEQ s1356 1) (GEQ s1362 1) (GEQ s1360 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 381 reset in 802 ms.
Product exploration explored 100000 steps with 381 reset in 628 ms.
Computed a total of 2009 stabilizing places and 1985 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2009 transition count 1985
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 224 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Finished random walk after 250 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 303 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 51 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
[2024-05-25 15:53:04] [INFO ] Invariant cache hit.
[2024-05-25 15:53:06] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 86 ms returned sat
[2024-05-25 15:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:53:08] [INFO ] [Real]Absence check using state equation in 1739 ms returned sat
[2024-05-25 15:53:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:53:10] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 141 ms returned sat
[2024-05-25 15:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:53:13] [INFO ] [Nat]Absence check using state equation in 3096 ms returned sat
[2024-05-25 15:53:14] [INFO ] Computed and/alt/rep : 1899/2131/1899 causal constraints (skipped 65 transitions) in 154 ms.
[2024-05-25 15:53:23] [INFO ] Added : 240 causal constraints over 48 iterations in 9670 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 63 out of 2009 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2009/2009 places, 1985/1985 transitions.
Graph (complete) has 2384 edges and 2009 vertex of which 1074 are kept as prefixes of interest. Removing 935 places using SCC suffix rule.4 ms
Discarding 935 places :
Also discarding 830 output transitions
Drop transitions removed 830 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 672 rules applied. Total rules applied 673 place count 1053 transition count 462
Reduce places removed 672 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 735 rules applied. Total rules applied 1408 place count 381 transition count 399
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 1471 place count 318 transition count 399
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1471 place count 318 transition count 378
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1513 place count 297 transition count 378
Applied a total of 1513 rules in 58 ms. Remains 297 /2009 variables (removed 1712) and now considering 378/1985 (removed 1607) transitions.
// Phase 1: matrix 378 rows 297 cols
[2024-05-25 15:53:23] [INFO ] Computed 1 invariants in 3 ms
[2024-05-25 15:53:23] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-25 15:53:23] [INFO ] Invariant cache hit.
[2024-05-25 15:53:24] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-05-25 15:53:24] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-25 15:53:24] [INFO ] Invariant cache hit.
[2024-05-25 15:53:24] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 297/2009 places, 378/1985 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 983 ms. Remains : 297/2009 places, 378/1985 transitions.
Computed a total of 297 stabilizing places and 378 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 297 transition count 378
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 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 52 ms :[(NOT p1)]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 159 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 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
[2024-05-25 15:53:25] [INFO ] Invariant cache hit.
[2024-05-25 15:53:25] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-25 15:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:53:25] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-05-25 15:53:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:53:26] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-25 15:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:53:26] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-05-25 15:53:26] [INFO ] Computed and/alt/rep : 252/252/252 causal constraints (skipped 63 transitions) in 41 ms.
[2024-05-25 15:53:26] [INFO ] Added : 42 causal constraints over 9 iterations in 360 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 57 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2296 reset in 749 ms.
Product exploration explored 100000 steps with 2290 reset in 555 ms.
Built C files in :
/tmp/ltsmin134348778570767174
[2024-05-25 15:53:28] [INFO ] Computing symmetric may disable matrix : 378 transitions.
[2024-05-25 15:53:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:53:28] [INFO ] Computing symmetric may enable matrix : 378 transitions.
[2024-05-25 15:53:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:53:28] [INFO ] Computing Do-Not-Accords matrix : 378 transitions.
[2024-05-25 15:53:28] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:53:28] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin134348778570767174
Running compilation step : cd /tmp/ltsmin134348778570767174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1205 ms.
Running link step : cd /tmp/ltsmin134348778570767174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin134348778570767174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15413655411424213109.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 63 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 378/378 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 297 transition count 252
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 252 place count 171 transition count 252
Applied a total of 252 rules in 7 ms. Remains 171 /297 variables (removed 126) and now considering 252/378 (removed 126) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-25 15:53:43] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 15:53:43] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-25 15:53:43] [INFO ] Invariant cache hit.
[2024-05-25 15:53:43] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-25 15:53:43] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 15:53:43] [INFO ] Invariant cache hit.
[2024-05-25 15:53:44] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/297 places, 252/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 171/297 places, 252/378 transitions.
Built C files in :
/tmp/ltsmin3638195324423570690
[2024-05-25 15:53:44] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-25 15:53:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:53:44] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-25 15:53:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:53:44] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-25 15:53:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:53:44] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3638195324423570690
Running compilation step : cd /tmp/ltsmin3638195324423570690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 743 ms.
Running link step : cd /tmp/ltsmin3638195324423570690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3638195324423570690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2349920588119965941.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:53:59] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:53:59] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:53:59] [INFO ] Time to serialize gal into /tmp/LTL7947767097465587625.gal : 4 ms
[2024-05-25 15:53:59] [INFO ] Time to serialize properties into /tmp/LTL2035228789848228121.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7947767097465587625.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2412852047445646345.hoa' '-atoms' '/tmp/LTL2035228789848228121.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2035228789848228121.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2412852047445646345.hoa
Detected timeout of ITS tools.
[2024-05-25 15:54:14] [INFO ] Flatten gal took : 13 ms
[2024-05-25 15:54:14] [INFO ] Flatten gal took : 13 ms
[2024-05-25 15:54:14] [INFO ] Time to serialize gal into /tmp/LTL13643107870162994381.gal : 4 ms
[2024-05-25 15:54:14] [INFO ] Time to serialize properties into /tmp/LTL2525722967073026256.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13643107870162994381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2525722967073026256.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((m5_13_2>=1)||(m5_15_2>=1))||((m5_9_2>=1)||(m5_11_2>=1)))||(((m5_2_0>=1)||(m5_17_2>=1))||((m5_0_0>=1)||(m5_19_2>=1))))|...2056
Formula 0 simplified : X(F!"(((((((m5_13_2>=1)||(m5_15_2>=1))||((m5_9_2>=1)||(m5_11_2>=1)))||(((m5_2_0>=1)||(m5_17_2>=1))||((m5_0_0>=1)||(m5_19_2>=1))))||(...2048
Detected timeout of ITS tools.
[2024-05-25 15:54:29] [INFO ] Flatten gal took : 13 ms
[2024-05-25 15:54:29] [INFO ] Applying decomposition
[2024-05-25 15:54:29] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10431569216963111899.txt' '-o' '/tmp/graph10431569216963111899.bin' '-w' '/tmp/graph10431569216963111899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10431569216963111899.bin' '-l' '-1' '-v' '-w' '/tmp/graph10431569216963111899.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:54:29] [INFO ] Decomposing Gal with order
[2024-05-25 15:54:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:54:29] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-25 15:54:29] [INFO ] Flatten gal took : 71 ms
[2024-05-25 15:54:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-25 15:54:29] [INFO ] Time to serialize gal into /tmp/LTL12114475578144485831.gal : 8 ms
[2024-05-25 15:54:29] [INFO ] Time to serialize properties into /tmp/LTL16546553932408618133.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12114475578144485831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16546553932408618133.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((i7.u60.m5_13_2>=1)||(i8.u27.m5_15_2>=1))||((i16.u57.m5_9_2>=1)||(i15.u25.m5_11_2>=1)))||(((i1.u6.m5_2_0>=1)||(i18.u29....3023
Formula 0 simplified : X(F!"(((((((i7.u60.m5_13_2>=1)||(i8.u27.m5_15_2>=1))||((i16.u57.m5_9_2>=1)||(i15.u25.m5_11_2>=1)))||(((i1.u6.m5_2_0>=1)||(i18.u29.m5...3015
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12760374247213601667
[2024-05-25 15:54:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12760374247213601667
Running compilation step : cd /tmp/ltsmin12760374247213601667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 944 ms.
Running link step : cd /tmp/ltsmin12760374247213601667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12760374247213601667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04 finished in 125943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 129 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2381 transition count 2272
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 147 place count 2297 transition count 2188
Iterating global reduction 1 with 84 rules applied. Total rules applied 231 place count 2297 transition count 2188
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 252 place count 2276 transition count 2188
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 295 place count 2233 transition count 2145
Iterating global reduction 2 with 43 rules applied. Total rules applied 338 place count 2233 transition count 2145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 2232 transition count 2144
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 2232 transition count 2144
Applied a total of 340 rules in 906 ms. Remains 2232 /2444 variables (removed 212) and now considering 2144/2272 (removed 128) transitions.
// Phase 1: matrix 2144 rows 2232 cols
[2024-05-25 15:55:00] [INFO ] Computed 233 invariants in 18 ms
[2024-05-25 15:55:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 15:55:02] [INFO ] Implicit Places using invariants in 1282 ms returned [1472, 1768]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1286 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2230/2444 places, 2144/2272 transitions.
Applied a total of 0 rules in 264 ms. Remains 2230 /2230 variables (removed 0) and now considering 2144/2144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2457 ms. Remains : 2230/2444 places, 2144/2272 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s1326 1) (LT s1450 1)) (OR (LT s1326 1) (LT s1452 1)) (OR (LT s1326 1) (LT s1446 1)) (OR (LT s1326 1) (LT s1448 1)) (OR (LT s1327 1) (LT s...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 finished in 2725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 4 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Graph (complete) has 3274 edges and 2444 vertex of which 1069 are kept as prefixes of interest. Removing 1375 places using SCC suffix rule.5 ms
Discarding 1375 places :
Also discarding 1208 output transitions
Drop transitions removed 1208 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 62 places :
Implicit places reduction removed 62 places
Drop transitions removed 813 transitions
Trivial Post-agglo rules discarded 813 transitions
Performed 813 trivial Post agglomeration. Transition count delta: 813
Iterating post reduction 0 with 875 rules applied. Total rules applied 876 place count 986 transition count 230
Reduce places removed 813 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 814 rules applied. Total rules applied 1690 place count 173 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1691 place count 172 transition count 229
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 1691 place count 172 transition count 205
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 1740 place count 147 transition count 205
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1761 place count 126 transition count 144
Iterating global reduction 3 with 21 rules applied. Total rules applied 1782 place count 126 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 1788 place count 124 transition count 140
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1791 place count 121 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1791 place count 121 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1796 place count 118 transition count 138
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 1837 place count 77 transition count 97
Iterating global reduction 5 with 41 rules applied. Total rules applied 1878 place count 77 transition count 97
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 5 with 41 rules applied. Total rules applied 1919 place count 77 transition count 56
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 1919 place count 77 transition count 36
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1979 place count 37 transition count 36
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1996 place count 20 transition count 19
Iterating global reduction 6 with 17 rules applied. Total rules applied 2013 place count 20 transition count 19
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 6 with 2 rules applied. Total rules applied 2015 place count 19 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 2018 place count 16 transition count 15
Applied a total of 2018 rules in 53 ms. Remains 16 /2444 variables (removed 2428) and now considering 15/2272 (removed 2257) transitions.
// Phase 1: matrix 15 rows 16 cols
[2024-05-25 15:55:02] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 15:55:02] [INFO ] Implicit Places using invariants in 40 ms returned [1, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/2444 places, 15/2272 transitions.
Graph (complete) has 13 edges and 14 vertex of which 12 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 4 ms. Remains 10 /14 variables (removed 4) and now considering 11/15 (removed 4) transitions.
// Phase 1: matrix 11 rows 10 cols
[2024-05-25 15:55:02] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 15:55:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 15:55:02] [INFO ] Invariant cache hit.
[2024-05-25 15:55:02] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/2444 places, 11/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 10/2444 places, 11/2272 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s9 1), p1:(OR (LT s3 1) (LT s4 1)), p2:(OR (LT s3 1) (LT s4 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13501 reset in 228 ms.
Product exploration explored 100000 steps with 13542 reset in 290 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 543 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 finished in 1480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Graph (complete) has 3274 edges and 2444 vertex of which 1069 are kept as prefixes of interest. Removing 1375 places using SCC suffix rule.4 ms
Discarding 1375 places :
Also discarding 1209 output transitions
Drop transitions removed 1209 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 811 transitions
Trivial Post-agglo rules discarded 811 transitions
Performed 811 trivial Post agglomeration. Transition count delta: 811
Iterating post reduction 0 with 874 rules applied. Total rules applied 875 place count 985 transition count 231
Reduce places removed 811 places and 0 transitions.
Iterating post reduction 1 with 811 rules applied. Total rules applied 1686 place count 174 transition count 231
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 1686 place count 174 transition count 203
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1744 place count 144 transition count 203
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1765 place count 123 transition count 142
Iterating global reduction 2 with 21 rules applied. Total rules applied 1786 place count 123 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 1793 place count 121 transition count 137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1797 place count 117 transition count 137
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1839 place count 75 transition count 95
Iterating global reduction 4 with 42 rules applied. Total rules applied 1881 place count 75 transition count 95
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 1923 place count 75 transition count 53
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 1923 place count 75 transition count 32
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 1986 place count 33 transition count 32
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 2004 place count 15 transition count 14
Iterating global reduction 5 with 18 rules applied. Total rules applied 2022 place count 15 transition count 14
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 5 with 2 rules applied. Total rules applied 2024 place count 14 transition count 13
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 2027 place count 11 transition count 10
Applied a total of 2027 rules in 56 ms. Remains 11 /2444 variables (removed 2433) and now considering 10/2272 (removed 2262) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-25 15:55:04] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 15:55:04] [INFO ] Implicit Places using invariants in 35 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/2444 places, 10/2272 transitions.
Graph (complete) has 7 edges and 10 vertex of which 8 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-25 15:55:04] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 15:55:04] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 15:55:04] [INFO ] Invariant cache hit.
[2024-05-25 15:55:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/2444 places, 7/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 154 ms. Remains : 7/2444 places, 7/2272 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1 1) (GEQ s3 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(p1)&&F((G(F(p0))||(p2&&F(p0))))) U (G((p1&&F((G(F(p0))||(p2&&F(p0))))))||(!p3&&G(p1)&&F((G(F(p0))||(p2&&F(p0)))))))))'
Support contains 5 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Graph (complete) has 3274 edges and 2444 vertex of which 2276 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.4 ms
Discarding 168 places :
Also discarding 167 output transitions
Drop transitions removed 167 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 1236 transitions
Trivial Post-agglo rules discarded 1236 transitions
Performed 1236 trivial Post agglomeration. Transition count delta: 1236
Iterating post reduction 0 with 1299 rules applied. Total rules applied 1300 place count 2192 transition count 848
Reduce places removed 1236 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 1259 rules applied. Total rules applied 2559 place count 956 transition count 825
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 2582 place count 933 transition count 825
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 255 Pre rules applied. Total rules applied 2582 place count 933 transition count 570
Deduced a syphon composed of 255 places in 1 ms
Ensure Unique test removed 105 places
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 615 rules applied. Total rules applied 3197 place count 573 transition count 570
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 3 with 63 rules applied. Total rules applied 3260 place count 573 transition count 507
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 3343 place count 510 transition count 487
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 3366 place count 487 transition count 444
Iterating global reduction 5 with 23 rules applied. Total rules applied 3389 place count 487 transition count 444
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 5 with 146 rules applied. Total rules applied 3535 place count 445 transition count 340
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 6 with 83 rules applied. Total rules applied 3618 place count 362 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3618 place count 362 transition count 339
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3620 place count 361 transition count 339
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 3641 place count 340 transition count 318
Iterating global reduction 7 with 21 rules applied. Total rules applied 3662 place count 340 transition count 318
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3683 place count 340 transition count 297
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 139 rules applied. Total rules applied 3822 place count 261 transition count 237
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 3823 place count 261 transition count 237
Applied a total of 3823 rules in 150 ms. Remains 261 /2444 variables (removed 2183) and now considering 237/2272 (removed 2035) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-25 15:55:04] [INFO ] Computed 66 invariants in 2 ms
[2024-05-25 15:55:05] [INFO ] Implicit Places using invariants in 486 ms returned [21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 84, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 236, 239]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 488 ms to find 64 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/2444 places, 237/2272 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 197 transition count 155
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 115 transition count 155
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 164 place count 115 transition count 134
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 206 place count 94 transition count 134
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 225 place count 75 transition count 115
Iterating global reduction 2 with 19 rules applied. Total rules applied 244 place count 75 transition count 115
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 260 place count 59 transition count 83
Iterating global reduction 2 with 16 rules applied. Total rules applied 276 place count 59 transition count 83
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 292 place count 43 transition count 67
Iterating global reduction 2 with 16 rules applied. Total rules applied 308 place count 43 transition count 67
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 324 place count 27 transition count 35
Iterating global reduction 2 with 16 rules applied. Total rules applied 340 place count 27 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 26 transition count 35
Applied a total of 342 rules in 17 ms. Remains 26 /197 variables (removed 171) and now considering 35/237 (removed 202) transitions.
// Phase 1: matrix 35 rows 26 cols
[2024-05-25 15:55:05] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 15:55:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 15:55:05] [INFO ] Invariant cache hit.
[2024-05-25 15:55:05] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/2444 places, 35/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 734 ms. Remains : 26/2444 places, 35/2272 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=0 dest: 5}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LT s17 1), p0:(GEQ s6 1), p3:(AND (GEQ s15 1) (GEQ s21 1)), p2:(LT s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 finished in 1060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 2 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2381 transition count 2272
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 147 place count 2297 transition count 2188
Iterating global reduction 1 with 84 rules applied. Total rules applied 231 place count 2297 transition count 2188
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 252 place count 2276 transition count 2188
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 316 place count 2212 transition count 2124
Iterating global reduction 2 with 64 rules applied. Total rules applied 380 place count 2212 transition count 2124
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 42 rules applied. Total rules applied 422 place count 2191 transition count 2103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 425 place count 2188 transition count 2060
Iterating global reduction 3 with 3 rules applied. Total rules applied 428 place count 2188 transition count 2060
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 447 place count 2169 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 489 place count 2127 transition count 2018
Iterating global reduction 4 with 42 rules applied. Total rules applied 531 place count 2127 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 573 place count 2085 transition count 1976
Iterating global reduction 4 with 42 rules applied. Total rules applied 615 place count 2085 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 657 place count 2043 transition count 1934
Iterating global reduction 4 with 42 rules applied. Total rules applied 699 place count 2043 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 741 place count 2001 transition count 1892
Iterating global reduction 4 with 42 rules applied. Total rules applied 783 place count 2001 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 825 place count 1959 transition count 1850
Iterating global reduction 4 with 42 rules applied. Total rules applied 867 place count 1959 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 909 place count 1917 transition count 1808
Iterating global reduction 4 with 42 rules applied. Total rules applied 951 place count 1917 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 993 place count 1875 transition count 1766
Iterating global reduction 4 with 42 rules applied. Total rules applied 1035 place count 1875 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1077 place count 1833 transition count 1724
Iterating global reduction 4 with 42 rules applied. Total rules applied 1119 place count 1833 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1161 place count 1791 transition count 1682
Iterating global reduction 4 with 42 rules applied. Total rules applied 1203 place count 1791 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1245 place count 1749 transition count 1640
Iterating global reduction 4 with 42 rules applied. Total rules applied 1287 place count 1749 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1329 place count 1707 transition count 1598
Iterating global reduction 4 with 42 rules applied. Total rules applied 1371 place count 1707 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1413 place count 1665 transition count 1556
Iterating global reduction 4 with 42 rules applied. Total rules applied 1455 place count 1665 transition count 1556
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1497 place count 1623 transition count 1514
Iterating global reduction 4 with 42 rules applied. Total rules applied 1539 place count 1623 transition count 1514
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 4 with 63 rules applied. Total rules applied 1602 place count 1602 transition count 1472
Applied a total of 1602 rules in 2737 ms. Remains 1602 /2444 variables (removed 842) and now considering 1472/2272 (removed 800) transitions.
// Phase 1: matrix 1472 rows 1602 cols
[2024-05-25 15:55:08] [INFO ] Computed 172 invariants in 11 ms
[2024-05-25 15:55:09] [INFO ] Implicit Places using invariants in 882 ms returned [697, 708]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 884 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1600/2444 places, 1472/2272 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1597 transition count 1469
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1597 transition count 1469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1596 transition count 1467
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1596 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1595 transition count 1466
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1595 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1594 transition count 1465
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1594 transition count 1465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1593 transition count 1464
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1593 transition count 1464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1592 transition count 1463
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1592 transition count 1463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1591 transition count 1462
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1591 transition count 1462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1590 transition count 1461
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1590 transition count 1461
Applied a total of 20 rules in 1475 ms. Remains 1590 /1600 variables (removed 10) and now considering 1461/1472 (removed 11) transitions.
// Phase 1: matrix 1461 rows 1590 cols
[2024-05-25 15:55:10] [INFO ] Computed 170 invariants in 12 ms
[2024-05-25 15:55:11] [INFO ] Implicit Places using invariants in 723 ms returned [273, 648, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 751, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1400]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 725 ms to find 43 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1547/2444 places, 1461/2272 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1509 transition count 1423
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1509 transition count 1423
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1490 transition count 1385
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1490 transition count 1385
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 133 place count 1471 transition count 1366
Iterating global reduction 0 with 19 rules applied. Total rules applied 152 place count 1471 transition count 1366
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 171 place count 1452 transition count 1347
Iterating global reduction 0 with 19 rules applied. Total rules applied 190 place count 1452 transition count 1347
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 209 place count 1433 transition count 1328
Iterating global reduction 0 with 19 rules applied. Total rules applied 228 place count 1433 transition count 1328
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 247 place count 1414 transition count 1309
Iterating global reduction 0 with 19 rules applied. Total rules applied 266 place count 1414 transition count 1309
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 285 place count 1395 transition count 1290
Iterating global reduction 0 with 19 rules applied. Total rules applied 304 place count 1395 transition count 1290
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 323 place count 1376 transition count 1271
Iterating global reduction 0 with 19 rules applied. Total rules applied 342 place count 1376 transition count 1271
Applied a total of 342 rules in 972 ms. Remains 1376 /1547 variables (removed 171) and now considering 1271/1461 (removed 190) transitions.
// Phase 1: matrix 1271 rows 1376 cols
[2024-05-25 15:55:12] [INFO ] Computed 127 invariants in 6 ms
[2024-05-25 15:55:12] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-25 15:55:12] [INFO ] Invariant cache hit.
[2024-05-25 15:55:14] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 1376/2444 places, 1271/2272 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 8553 ms. Remains : 1376/2444 places, 1271/2272 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LT s640 1), p0:(LT s692 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1087 ms.
Product exploration explored 100000 steps with 33333 reset in 894 ms.
Computed a total of 1376 stabilizing places and 1271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1376 transition count 1271
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 finished in 11054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2381 transition count 2272
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 147 place count 2297 transition count 2188
Iterating global reduction 1 with 84 rules applied. Total rules applied 231 place count 2297 transition count 2188
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 252 place count 2276 transition count 2188
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 316 place count 2212 transition count 2124
Iterating global reduction 2 with 64 rules applied. Total rules applied 380 place count 2212 transition count 2124
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 42 rules applied. Total rules applied 422 place count 2191 transition count 2103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 425 place count 2188 transition count 2060
Iterating global reduction 3 with 3 rules applied. Total rules applied 428 place count 2188 transition count 2060
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 447 place count 2169 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 489 place count 2127 transition count 2018
Iterating global reduction 4 with 42 rules applied. Total rules applied 531 place count 2127 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 573 place count 2085 transition count 1976
Iterating global reduction 4 with 42 rules applied. Total rules applied 615 place count 2085 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 657 place count 2043 transition count 1934
Iterating global reduction 4 with 42 rules applied. Total rules applied 699 place count 2043 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 741 place count 2001 transition count 1892
Iterating global reduction 4 with 42 rules applied. Total rules applied 783 place count 2001 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 825 place count 1959 transition count 1850
Iterating global reduction 4 with 42 rules applied. Total rules applied 867 place count 1959 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 909 place count 1917 transition count 1808
Iterating global reduction 4 with 42 rules applied. Total rules applied 951 place count 1917 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 993 place count 1875 transition count 1766
Iterating global reduction 4 with 42 rules applied. Total rules applied 1035 place count 1875 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1077 place count 1833 transition count 1724
Iterating global reduction 4 with 42 rules applied. Total rules applied 1119 place count 1833 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1161 place count 1791 transition count 1682
Iterating global reduction 4 with 42 rules applied. Total rules applied 1203 place count 1791 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1245 place count 1749 transition count 1640
Iterating global reduction 4 with 42 rules applied. Total rules applied 1287 place count 1749 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1329 place count 1707 transition count 1598
Iterating global reduction 4 with 42 rules applied. Total rules applied 1371 place count 1707 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1413 place count 1665 transition count 1556
Iterating global reduction 4 with 42 rules applied. Total rules applied 1455 place count 1665 transition count 1556
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1497 place count 1623 transition count 1514
Iterating global reduction 4 with 42 rules applied. Total rules applied 1539 place count 1623 transition count 1514
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 4 with 63 rules applied. Total rules applied 1602 place count 1602 transition count 1472
Applied a total of 1602 rules in 2771 ms. Remains 1602 /2444 variables (removed 842) and now considering 1472/2272 (removed 800) transitions.
// Phase 1: matrix 1472 rows 1602 cols
[2024-05-25 15:55:19] [INFO ] Computed 172 invariants in 19 ms
[2024-05-25 15:55:20] [INFO ] Implicit Places using invariants in 1263 ms returned [273, 653, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 759, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1137, 1138, 1412]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 1267 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1557/2444 places, 1472/2272 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1516 transition count 1431
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1516 transition count 1431
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1496 transition count 1391
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1496 transition count 1391
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1476 transition count 1371
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1476 transition count 1371
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1456 transition count 1351
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1456 transition count 1351
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1436 transition count 1331
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1436 transition count 1331
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1416 transition count 1311
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1416 transition count 1311
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1396 transition count 1291
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1396 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1376 transition count 1271
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1376 transition count 1271
Applied a total of 362 rules in 1133 ms. Remains 1376 /1557 variables (removed 181) and now considering 1271/1472 (removed 201) transitions.
// Phase 1: matrix 1271 rows 1376 cols
[2024-05-25 15:55:21] [INFO ] Computed 127 invariants in 5 ms
[2024-05-25 15:55:22] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-25 15:55:22] [INFO ] Invariant cache hit.
[2024-05-25 15:55:24] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1376/2444 places, 1271/2272 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7648 ms. Remains : 1376/2444 places, 1271/2272 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1015 1)], 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-L00020M0002C001P001G001-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 finished in 7786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Graph (complete) has 3274 edges and 2444 vertex of which 1042 are kept as prefixes of interest. Removing 1402 places using SCC suffix rule.3 ms
Discarding 1402 places :
Also discarding 1234 output transitions
Drop transitions removed 1234 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 804 transitions
Trivial Post-agglo rules discarded 804 transitions
Performed 804 trivial Post agglomeration. Transition count delta: 804
Iterating post reduction 0 with 867 rules applied. Total rules applied 868 place count 958 transition count 213
Reduce places removed 804 places and 0 transitions.
Iterating post reduction 1 with 804 rules applied. Total rules applied 1672 place count 154 transition count 213
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 1672 place count 154 transition count 192
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 1714 place count 133 transition count 192
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1735 place count 112 transition count 131
Iterating global reduction 2 with 21 rules applied. Total rules applied 1756 place count 112 transition count 131
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 1757 place count 111 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1757 place count 111 transition count 130
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 1759 place count 110 transition count 130
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1801 place count 68 transition count 88
Iterating global reduction 3 with 42 rules applied. Total rules applied 1843 place count 68 transition count 88
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 1885 place count 68 transition count 46
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 1885 place count 68 transition count 25
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 63 rules applied. Total rules applied 1948 place count 26 transition count 25
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1967 place count 7 transition count 6
Iterating global reduction 4 with 19 rules applied. Total rules applied 1986 place count 7 transition count 6
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1988 place count 5 transition count 4
Applied a total of 1988 rules in 29 ms. Remains 5 /2444 variables (removed 2439) and now considering 4/2272 (removed 2268) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 15:55:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 15:55:24] [INFO ] Implicit Places using invariants in 28 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2444 places, 4/2272 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 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 15:55:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 15:55:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 15:55:24] [INFO ] Invariant cache hit.
[2024-05-25 15:55:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/2444 places, 2/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 2/2444 places, 2/2272 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], 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 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 83 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 : [(NOT p0), (X p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2272/2272 transitions.
Graph (complete) has 3274 edges and 2444 vertex of which 1841 are kept as prefixes of interest. Removing 603 places using SCC suffix rule.3 ms
Discarding 603 places :
Also discarding 519 output transitions
Drop transitions removed 519 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions removed 1092 transitions
Trivial Post-agglo rules discarded 1092 transitions
Performed 1092 trivial Post agglomeration. Transition count delta: 1092
Iterating post reduction 0 with 1155 rules applied. Total rules applied 1156 place count 1757 transition count 640
Reduce places removed 1092 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 1115 rules applied. Total rules applied 2271 place count 665 transition count 617
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 2294 place count 642 transition count 617
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 2294 place count 642 transition count 484
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 45 places
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 311 rules applied. Total rules applied 2605 place count 464 transition count 484
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 2647 place count 464 transition count 442
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 2709 place count 422 transition count 422
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2733 place count 398 transition count 378
Iterating global reduction 5 with 24 rules applied. Total rules applied 2757 place count 398 transition count 378
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 43 places :
Implicit places reduction removed 43 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 5 with 150 rules applied. Total rules applied 2907 place count 355 transition count 271
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 6 with 85 rules applied. Total rules applied 2992 place count 270 transition count 271
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 3013 place count 249 transition count 250
Iterating global reduction 7 with 21 rules applied. Total rules applied 3034 place count 249 transition count 250
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3055 place count 249 transition count 229
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 8 with 99 rules applied. Total rules applied 3154 place count 190 transition count 189
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 3172 place count 172 transition count 171
Iterating global reduction 8 with 18 rules applied. Total rules applied 3190 place count 172 transition count 171
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3191 place count 171 transition count 169
Iterating global reduction 8 with 1 rules applied. Total rules applied 3192 place count 171 transition count 169
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3193 place count 170 transition count 168
Iterating global reduction 8 with 1 rules applied. Total rules applied 3194 place count 170 transition count 168
Applied a total of 3194 rules in 85 ms. Remains 170 /2444 variables (removed 2274) and now considering 168/2272 (removed 2104) transitions.
// Phase 1: matrix 168 rows 170 cols
[2024-05-25 15:55:24] [INFO ] Computed 42 invariants in 2 ms
[2024-05-25 15:55:25] [INFO ] Implicit Places using invariants in 238 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 166]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 255 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/2444 places, 168/2272 transitions.
Graph (complete) has 227 edges and 129 vertex of which 110 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 110 transition count 106
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 67 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 87 place count 67 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 66 transition count 105
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 106 place count 49 transition count 71
Iterating global reduction 2 with 17 rules applied. Total rules applied 123 place count 49 transition count 71
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 139 place count 33 transition count 55
Iterating global reduction 2 with 16 rules applied. Total rules applied 155 place count 33 transition count 55
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 171 place count 17 transition count 23
Iterating global reduction 2 with 16 rules applied. Total rules applied 187 place count 17 transition count 23
Applied a total of 187 rules in 8 ms. Remains 17 /129 variables (removed 112) and now considering 23/168 (removed 145) transitions.
// Phase 1: matrix 23 rows 17 cols
[2024-05-25 15:55:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 15:55:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 15:55:25] [INFO ] Invariant cache hit.
[2024-05-25 15:55:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/2444 places, 23/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 432 ms. Remains : 17/2444 places, 23/2272 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s12 1) (GEQ s15 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
[2024-05-25 15:55:25] [INFO ] Flatten gal took : 96 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin601908913248776599
[2024-05-25 15:55:25] [INFO ] Too many transitions (2272) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:55:25] [INFO ] Applying decomposition
[2024-05-25 15:55:25] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin601908913248776599
Running compilation step : cd /tmp/ltsmin601908913248776599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 15:55:25] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10984706618766534681.txt' '-o' '/tmp/graph10984706618766534681.bin' '-w' '/tmp/graph10984706618766534681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10984706618766534681.bin' '-l' '-1' '-v' '-w' '/tmp/graph10984706618766534681.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:55:26] [INFO ] Decomposing Gal with order
[2024-05-25 15:55:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:55:26] [INFO ] Removed a total of 473 redundant transitions.
[2024-05-25 15:55:26] [INFO ] Flatten gal took : 194 ms
[2024-05-25 15:55:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 62 ms.
[2024-05-25 15:55:26] [INFO ] Time to serialize gal into /tmp/LTLFireability21963044230192117.gal : 46 ms
[2024-05-25 15:55:26] [INFO ] Time to serialize properties into /tmp/LTLFireability8558890487442186363.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability21963044230192117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8558890487442186363.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((i18.i0.i0.i1.u415.m5_13_2>=1)||(i11.u459.m5_15_2>=1))||((i10.u313.m5_9_2>=1)||(i21.u381.m5_11_2>=1)))||(((i0.u393.m5_2...3271
Formula 0 simplified : X(F!"(((((((i18.i0.i0.i1.u415.m5_13_2>=1)||(i11.u459.m5_15_2>=1))||((i10.u313.m5_9_2>=1)||(i21.u381.m5_11_2>=1)))||(((i0.u393.m5_2_0...3263
Compilation finished in 8394 ms.
Running link step : cd /tmp/ltsmin601908913248776599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin601908913248776599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 16:16:36] [INFO ] Flatten gal took : 167 ms
[2024-05-25 16:16:36] [INFO ] Time to serialize gal into /tmp/LTLFireability3355643178059006125.gal : 29 ms
[2024-05-25 16:16:36] [INFO ] Time to serialize properties into /tmp/LTLFireability17490441042238976319.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3355643178059006125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17490441042238976319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((m5_13_2>=1)||(m5_15_2>=1))||((m5_9_2>=1)||(m5_11_2>=1)))||(((m5_2_0>=1)||(m5_17_2>=1))||((m5_0_0>=1)||(m5_19_2>=1))))|...2056
Formula 0 simplified : X(F!"(((((((m5_13_2>=1)||(m5_15_2>=1))||((m5_9_2>=1)||(m5_11_2>=1)))||(((m5_2_0>=1)||(m5_17_2>=1))||((m5_0_0>=1)||(m5_19_2>=1))))||(...2048
Detected timeout of ITS tools.
[2024-05-25 16:37:46] [INFO ] Flatten gal took : 167 ms
[2024-05-25 16:37:46] [INFO ] Input system was already deterministic with 2272 transitions.
[2024-05-25 16:37:46] [INFO ] Transformed 2444 places.
[2024-05-25 16:37:46] [INFO ] Transformed 2272 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 16:37:47] [INFO ] Time to serialize gal into /tmp/LTLFireability15275770232688248363.gal : 31 ms
[2024-05-25 16:37:48] [INFO ] Time to serialize properties into /tmp/LTLFireability6447969017174796405.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15275770232688248363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6447969017174796405.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("(((((((m5_13_2>=1)||(m5_15_2>=1))||((m5_9_2>=1)||(m5_11_2>=1)))||(((m5_2_0>=1)||(m5_17_2>=1))||((m5_0_0>=1)||(m5_19_2>=1))))|...2056
Formula 0 simplified : X(F!"(((((((m5_13_2>=1)||(m5_15_2>=1))||((m5_9_2>=1)||(m5_11_2>=1)))||(((m5_2_0>=1)||(m5_17_2>=1))||((m5_0_0>=1)||(m5_19_2>=1))))||(...2048
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6437260 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16034736 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-L00020M0002C001P001G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280400308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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