About the Execution of ITS-Tools for FamilyReunion-COL-L00010M0001C001P001G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1704.035 | 110056.00 | 259568.00 | 445.60 | TFTFTFTFTTFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110600619.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600619
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.7K Apr 30 08:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 08:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 30 08:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 30 08:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 134K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652697972695
Running Version 202205111006
[2022-05-16 10:46:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 10:46:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 10:46:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 10:46:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 10:46:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2022-05-16 10:46:14] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2022-05-16 10:46:14] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 10:46:14] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 10 ms.
[2022-05-16 10:46:14] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 7 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10006 steps, including 14 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 10:46:14] [INFO ] Computed 33 place invariants in 17 ms
[2022-05-16 10:46:15] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 10:46:15] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 10:46:15] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2022-05-16 10:46:15] [INFO ] Flatten gal took : 29 ms
[2022-05-16 10:46:15] [INFO ] Flatten gal took : 10 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
[2022-05-16 10:46:15] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 30 ms.
[2022-05-16 10:46:15] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Deduced a syphon composed of 11 places in 12 ms
Reduce places removed 19 places and 0 transitions.
Support contains 210 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 41 places and 0 transitions.
Discarding 176 places :
Implicit places reduction removed 176 places
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 1143 transition count 1069
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 273 place count 1087 transition count 1013
Iterating global reduction 1 with 56 rules applied. Total rules applied 329 place count 1087 transition count 1013
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 341 place count 1075 transition count 991
Iterating global reduction 1 with 12 rules applied. Total rules applied 353 place count 1075 transition count 991
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 364 place count 1064 transition count 991
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 375 place count 1053 transition count 980
Iterating global reduction 2 with 11 rules applied. Total rules applied 386 place count 1053 transition count 980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 387 place count 1052 transition count 969
Iterating global reduction 2 with 1 rules applied. Total rules applied 388 place count 1052 transition count 969
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 399 place count 1041 transition count 958
Iterating global reduction 2 with 11 rules applied. Total rules applied 410 place count 1041 transition count 958
Applied a total of 410 rules in 485 ms. Remains 1041 /1360 variables (removed 319) and now considering 958/1069 (removed 111) transitions.
// Phase 1: matrix 958 rows 1041 cols
[2022-05-16 10:46:15] [INFO ] Computed 116 place invariants in 44 ms
[2022-05-16 10:46:16] [INFO ] Implicit Places using invariants in 427 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 198, 486, 598, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 908]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 429 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1015/1360 places, 958/1069 transitions.
Applied a total of 0 rules in 24 ms. Remains 1015 /1015 variables (removed 0) and now considering 958/958 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1015/1360 places, 958/1069 transitions.
Support contains 210 out of 1015 places after structural reductions.
[2022-05-16 10:46:16] [INFO ] Flatten gal took : 58 ms
[2022-05-16 10:46:16] [INFO ] Flatten gal took : 47 ms
[2022-05-16 10:46:16] [INFO ] Input system was already deterministic with 958 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 958 rows 1015 cols
[2022-05-16 10:46:16] [INFO ] Computed 90 place invariants in 17 ms
[2022-05-16 10:46:16] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2022-05-16 10:46:16] [INFO ] [Real]Absence check using 3 positive and 87 generalized place invariants in 17 ms returned sat
[2022-05-16 10:46:16] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 1015 stabilizing places and 958 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1015 transition count 958
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X(p0)))&&F(G(F(X(p0))))))'
Support contains 11 out of 1015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1015/1015 places, 958/958 transitions.
Graph (complete) has 1177 edges and 1015 vertex of which 396 are kept as prefixes of interest. Removing 619 places using SCC suffix rule.5 ms
Discarding 619 places :
Also discarding 562 output transitions
Drop transitions removed 562 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 341 rules applied. Total rules applied 342 place count 374 transition count 55
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 352 rules applied. Total rules applied 694 place count 44 transition count 33
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 705 place count 33 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 705 place count 33 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 727 place count 22 transition count 22
Applied a total of 727 rules in 21 ms. Remains 22 /1015 variables (removed 993) and now considering 22/958 (removed 936) transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 10:46:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:46:16] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 10:46:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:46:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-16 10:46:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-16 10:46:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 10:46:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/1015 places, 22/958 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/1015 places, 22/958 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5854 reset in 254 ms.
Product exploration explored 100000 steps with 5845 reset in 158 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 finished in 876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F((F(p1)&&p0))))'
Support contains 33 out of 1015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1015/1015 places, 958/958 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1003 transition count 958
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 55 place count 960 transition count 915
Iterating global reduction 1 with 43 rules applied. Total rules applied 98 place count 960 transition count 915
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 120 place count 938 transition count 893
Iterating global reduction 1 with 22 rules applied. Total rules applied 142 place count 938 transition count 893
Applied a total of 142 rules in 122 ms. Remains 938 /1015 variables (removed 77) and now considering 893/958 (removed 65) transitions.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:17] [INFO ] Computed 78 place invariants in 19 ms
[2022-05-16 10:46:18] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:18] [INFO ] Computed 78 place invariants in 17 ms
[2022-05-16 10:46:18] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:18] [INFO ] Computed 78 place invariants in 12 ms
[2022-05-16 10:46:19] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 938/1015 places, 893/958 transitions.
Finished structural reductions, in 1 iterations. Remains : 938/1015 places, 893/958 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374)), p1:(GT 1 (ADD s474 s475 s4...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1355 reset in 313 ms.
Product exploration explored 100000 steps with 1365 reset in 270 ms.
Computed a total of 938 stabilizing places and 893 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 893
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 (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 351 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:20] [INFO ] Computed 78 place invariants in 4 ms
[2022-05-16 10:46:20] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 55 ms returned sat
[2022-05-16 10:46:21] [INFO ] After 752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 10:46:21] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 18 ms returned sat
[2022-05-16 10:46:21] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 10:46:21] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-16 10:46:22] [INFO ] After 752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 375 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:22] [INFO ] Computed 78 place invariants in 4 ms
[2022-05-16 10:46:23] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 24 ms returned sat
[2022-05-16 10:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:46:23] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2022-05-16 10:46:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:46:24] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 25 ms returned sat
[2022-05-16 10:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:46:24] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2022-05-16 10:46:24] [INFO ] Computed and/alt/rep : 880/990/880 causal constraints (skipped 2 transitions) in 49 ms.
[2022-05-16 10:46:25] [INFO ] Added : 99 causal constraints over 20 iterations in 1035 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 33 out of 938 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 938/938 places, 893/893 transitions.
Applied a total of 0 rules in 44 ms. Remains 938 /938 variables (removed 0) and now considering 893/893 (removed 0) transitions.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:25] [INFO ] Computed 78 place invariants in 6 ms
[2022-05-16 10:46:26] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:26] [INFO ] Computed 78 place invariants in 4 ms
[2022-05-16 10:46:26] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:26] [INFO ] Computed 78 place invariants in 12 ms
[2022-05-16 10:46:27] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 938/938 places, 893/893 transitions.
Computed a total of 938 stabilizing places and 893 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 893
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 (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:27] [INFO ] Computed 78 place invariants in 5 ms
[2022-05-16 10:46:27] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 20 ms returned sat
[2022-05-16 10:46:28] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 10:46:28] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 19 ms returned sat
[2022-05-16 10:46:28] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 10:46:28] [INFO ] After 500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-16 10:46:28] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 346 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:29] [INFO ] Computed 78 place invariants in 3 ms
[2022-05-16 10:46:29] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 24 ms returned sat
[2022-05-16 10:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:46:30] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2022-05-16 10:46:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:46:30] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 24 ms returned sat
[2022-05-16 10:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:46:31] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2022-05-16 10:46:31] [INFO ] Computed and/alt/rep : 880/990/880 causal constraints (skipped 2 transitions) in 42 ms.
[2022-05-16 10:46:32] [INFO ] Added : 99 causal constraints over 20 iterations in 986 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1363 reset in 221 ms.
Product exploration explored 100000 steps with 1358 reset in 227 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 33 out of 938 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 938/938 places, 893/893 transitions.
Graph (complete) has 1079 edges and 938 vertex of which 936 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 297 rules applied. Total rules applied 298 place count 936 transition count 891
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 352 Pre rules applied. Total rules applied 298 place count 936 transition count 957
Deduced a syphon composed of 649 places in 1 ms
Iterating global reduction 1 with 352 rules applied. Total rules applied 650 place count 936 transition count 957
Discarding 418 places :
Symmetric choice reduction at 1 with 418 rule applications. Total rules 1068 place count 518 transition count 539
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 1 with 418 rules applied. Total rules applied 1486 place count 518 transition count 539
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 1508 place count 518 transition count 517
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1508 place count 518 transition count 517
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1519 place count 518 transition count 517
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 297 places in 0 ms
Iterating global reduction 2 with 44 rules applied. Total rules applied 1563 place count 518 transition count 517
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1585 place count 496 transition count 495
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 1607 place count 496 transition count 495
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1618 place count 496 transition count 528
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1629 place count 485 transition count 506
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1640 place count 485 transition count 506
Deduced a syphon composed of 275 places in 0 ms
Applied a total of 1640 rules in 183 ms. Remains 485 /938 variables (removed 453) and now considering 506/893 (removed 387) transitions.
[2022-05-16 10:46:33] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 506 rows 485 cols
[2022-05-16 10:46:33] [INFO ] Computed 78 place invariants in 14 ms
[2022-05-16 10:46:33] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/938 places, 506/893 transitions.
Finished structural reductions, in 1 iterations. Remains : 485/938 places, 506/893 transitions.
Product exploration explored 100000 steps with 12595 reset in 777 ms.
Product exploration explored 100000 steps with 12560 reset in 741 ms.
Built C files in :
/tmp/ltsmin6026343957780213904
[2022-05-16 10:46:35] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6026343957780213904
Running compilation step : cd /tmp/ltsmin6026343957780213904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1407 ms.
Running link step : cd /tmp/ltsmin6026343957780213904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6026343957780213904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17049929809882821870.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 938 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 938/938 places, 893/893 transitions.
Applied a total of 0 rules in 20 ms. Remains 938 /938 variables (removed 0) and now considering 893/893 (removed 0) transitions.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:50] [INFO ] Computed 78 place invariants in 10 ms
[2022-05-16 10:46:50] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:50] [INFO ] Computed 78 place invariants in 4 ms
[2022-05-16 10:46:51] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 10:46:51] [INFO ] Computed 78 place invariants in 6 ms
[2022-05-16 10:46:51] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 938/938 places, 893/893 transitions.
Built C files in :
/tmp/ltsmin3933699259481621385
[2022-05-16 10:46:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3933699259481621385
Running compilation step : cd /tmp/ltsmin3933699259481621385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1285 ms.
Running link step : cd /tmp/ltsmin3933699259481621385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3933699259481621385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7227893746800607318.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 10:47:06] [INFO ] Flatten gal took : 34 ms
[2022-05-16 10:47:06] [INFO ] Flatten gal took : 33 ms
[2022-05-16 10:47:06] [INFO ] Time to serialize gal into /tmp/LTL3868743730047775192.gal : 6 ms
[2022-05-16 10:47:06] [INFO ] Time to serialize properties into /tmp/LTL13844911188013080344.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3868743730047775192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13844911188013080344.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3868743...267
Read 1 LTL properties
Checking formula 0 : !(((F(X("((((((ml2_0+ml2_1)+(ml2_2+ml2_3))+((ml2_4+ml2_5)+(ml2_6+ml2_7)))+(((ml2_8+ml2_9)+(ml2_10+ml2_11))+((ml2_12+ml2_13)+(ml2_14+ml...526
Formula 0 simplified : !(FX"((((((ml2_0+ml2_1)+(ml2_2+ml2_3))+((ml2_4+ml2_5)+(ml2_6+ml2_7)))+(((ml2_8+ml2_9)+(ml2_10+ml2_11))+((ml2_12+ml2_13)+(ml2_14+ml2_...514
Detected timeout of ITS tools.
[2022-05-16 10:47:22] [INFO ] Flatten gal took : 36 ms
[2022-05-16 10:47:22] [INFO ] Applying decomposition
[2022-05-16 10:47:22] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6029605529223235674.txt' '-o' '/tmp/graph6029605529223235674.bin' '-w' '/tmp/graph6029605529223235674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6029605529223235674.bin' '-l' '-1' '-v' '-w' '/tmp/graph6029605529223235674.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:47:22] [INFO ] Decomposing Gal with order
[2022-05-16 10:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:47:22] [INFO ] Removed a total of 36 redundant transitions.
[2022-05-16 10:47:22] [INFO ] Flatten gal took : 89 ms
[2022-05-16 10:47:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 17 ms.
[2022-05-16 10:47:22] [INFO ] Time to serialize gal into /tmp/LTL16595655966735979248.gal : 12 ms
[2022-05-16 10:47:22] [INFO ] Time to serialize properties into /tmp/LTL17685777950048017089.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16595655966735979248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17685777950048017089.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1659565...268
Read 1 LTL properties
Checking formula 0 : !(((F(X("((((((gu155.ml2_0+gu155.ml2_1)+(gu155.ml2_2+gu155.ml2_3))+((gu155.ml2_4+gu155.ml2_5)+(gu155.ml2_6+gu155.ml2_7)))+(((gu155.ml2...911
Formula 0 simplified : !(FX"((((((gu155.ml2_0+gu155.ml2_1)+(gu155.ml2_2+gu155.ml2_3))+((gu155.ml2_4+gu155.ml2_5)+(gu155.ml2_6+gu155.ml2_7)))+(((gu155.ml2_8...899
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14771283304218390647
[2022-05-16 10:47:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14771283304218390647
Running compilation step : cd /tmp/ltsmin14771283304218390647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1279 ms.
Running link step : cd /tmp/ltsmin14771283304218390647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14771283304218390647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X((LTLAPp0==true)))&&<>((<>((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 finished in 95041 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((G(p1)&&p1)))))'
Support contains 55 out of 1015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1015/1015 places, 958/958 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1003 transition count 958
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 44 place count 971 transition count 926
Iterating global reduction 1 with 32 rules applied. Total rules applied 76 place count 971 transition count 926
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 87 place count 960 transition count 915
Iterating global reduction 1 with 11 rules applied. Total rules applied 98 place count 960 transition count 915
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 109 place count 949 transition count 904
Iterating global reduction 1 with 11 rules applied. Total rules applied 120 place count 949 transition count 904
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 131 place count 938 transition count 893
Iterating global reduction 1 with 11 rules applied. Total rules applied 142 place count 938 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 153 place count 927 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 164 place count 927 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 175 place count 916 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 186 place count 916 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 197 place count 905 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 208 place count 905 transition count 860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 219 place count 894 transition count 849
Iterating global reduction 1 with 11 rules applied. Total rules applied 230 place count 894 transition count 849
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 241 place count 883 transition count 838
Iterating global reduction 1 with 11 rules applied. Total rules applied 252 place count 883 transition count 838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 263 place count 872 transition count 827
Iterating global reduction 1 with 11 rules applied. Total rules applied 274 place count 872 transition count 827
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 285 place count 861 transition count 816
Iterating global reduction 1 with 11 rules applied. Total rules applied 296 place count 861 transition count 816
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 307 place count 850 transition count 805
Iterating global reduction 1 with 11 rules applied. Total rules applied 318 place count 850 transition count 805
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 329 place count 850 transition count 794
Applied a total of 329 rules in 270 ms. Remains 850 /1015 variables (removed 165) and now considering 794/958 (removed 164) transitions.
// Phase 1: matrix 794 rows 850 cols
[2022-05-16 10:47:53] [INFO ] Computed 78 place invariants in 11 ms
[2022-05-16 10:47:53] [INFO ] Implicit Places using invariants in 192 ms returned [364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 193 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 839/1015 places, 794/958 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 818 transition count 773
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 818 transition count 773
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 808 transition count 753
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 808 transition count 753
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 798 transition count 743
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 798 transition count 743
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 788 transition count 733
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 788 transition count 733
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 778 transition count 723
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 778 transition count 723
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 768 transition count 713
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 768 transition count 713
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 758 transition count 703
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 758 transition count 703
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 748 transition count 693
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 748 transition count 693
Applied a total of 182 rules in 133 ms. Remains 748 /839 variables (removed 91) and now considering 693/794 (removed 101) transitions.
// Phase 1: matrix 693 rows 748 cols
[2022-05-16 10:47:53] [INFO ] Computed 67 place invariants in 8 ms
[2022-05-16 10:47:53] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 693 rows 748 cols
[2022-05-16 10:47:53] [INFO ] Computed 67 place invariants in 9 ms
[2022-05-16 10:47:54] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 748/1015 places, 693/958 transitions.
Finished structural reductions, in 2 iterations. Remains : 748/1015 places, 693/958 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ 2 (ADD s561 s562 s563 s564 s565 s566 s567 s568 s569 s570 s571 s572 s573 s574 s575 s576 s577 s578 s579 s580 s581 s582)), p1:(LEQ (ADD s33 s34 s35 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 155 reset in 253 ms.
Product exploration explored 100000 steps with 155 reset in 291 ms.
Computed a total of 748 stabilizing places and 693 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 748 transition count 693
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 (NOT p0)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 finished in 2211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 33 out of 1015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1015/1015 places, 958/958 transitions.
Graph (complete) has 1177 edges and 1015 vertex of which 385 are kept as prefixes of interest. Removing 630 places using SCC suffix rule.3 ms
Discarding 630 places :
Also discarding 573 output transitions
Drop transitions removed 573 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 265 place count 374 transition count 110
Reduce places removed 264 places and 0 transitions.
Iterating post reduction 1 with 264 rules applied. Total rules applied 529 place count 110 transition count 110
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 529 place count 110 transition count 88
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 584 place count 77 transition count 88
Applied a total of 584 rules in 13 ms. Remains 77 /1015 variables (removed 938) and now considering 88/958 (removed 870) transitions.
// Phase 1: matrix 88 rows 77 cols
[2022-05-16 10:47:55] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 10:47:55] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 88 rows 77 cols
[2022-05-16 10:47:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:47:55] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-16 10:47:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 88 rows 77 cols
[2022-05-16 10:47:55] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 10:47:55] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1015 places, 88/958 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/1015 places, 88/958 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54) (ADD s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76))], 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 55 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((G((F(p0)&&p1))||p2))))))'
Support contains 66 out of 1015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1015/1015 places, 958/958 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1003 transition count 958
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 34 place count 981 transition count 936
Iterating global reduction 1 with 22 rules applied. Total rules applied 56 place count 981 transition count 936
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 959 transition count 914
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 959 transition count 914
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 948 transition count 903
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 948 transition count 903
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 937 transition count 892
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 937 transition count 892
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 926 transition count 881
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 926 transition count 881
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 177 place count 915 transition count 870
Iterating global reduction 1 with 11 rules applied. Total rules applied 188 place count 915 transition count 870
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 199 place count 904 transition count 859
Iterating global reduction 1 with 11 rules applied. Total rules applied 210 place count 904 transition count 859
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 221 place count 893 transition count 848
Iterating global reduction 1 with 11 rules applied. Total rules applied 232 place count 893 transition count 848
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 243 place count 882 transition count 837
Iterating global reduction 1 with 11 rules applied. Total rules applied 254 place count 882 transition count 837
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 265 place count 871 transition count 826
Iterating global reduction 1 with 11 rules applied. Total rules applied 276 place count 871 transition count 826
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 287 place count 860 transition count 815
Iterating global reduction 1 with 11 rules applied. Total rules applied 298 place count 860 transition count 815
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 309 place count 849 transition count 804
Iterating global reduction 1 with 11 rules applied. Total rules applied 320 place count 849 transition count 804
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 331 place count 849 transition count 793
Applied a total of 331 rules in 272 ms. Remains 849 /1015 variables (removed 166) and now considering 793/958 (removed 165) transitions.
// Phase 1: matrix 793 rows 849 cols
[2022-05-16 10:47:55] [INFO ] Computed 78 place invariants in 3 ms
[2022-05-16 10:47:55] [INFO ] Implicit Places using invariants in 181 ms returned [364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 186 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 838/1015 places, 793/958 transitions.
Applied a total of 0 rules in 17 ms. Remains 838 /838 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 838/1015 places, 793/958 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ (ADD s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627 s628) (ADD s783 s784 s785 s786 s787 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 250 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13 finished in 887 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(G(!F(!X(G(p0))))) U p0))'
Support contains 11 out of 1015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1015/1015 places, 958/958 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1003 transition count 958
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 55 place count 960 transition count 915
Iterating global reduction 1 with 43 rules applied. Total rules applied 98 place count 960 transition count 915
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 120 place count 938 transition count 893
Iterating global reduction 1 with 22 rules applied. Total rules applied 142 place count 938 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 153 place count 927 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 164 place count 927 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 175 place count 916 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 186 place count 916 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 197 place count 905 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 208 place count 905 transition count 860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 219 place count 894 transition count 849
Iterating global reduction 1 with 11 rules applied. Total rules applied 230 place count 894 transition count 849
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 241 place count 883 transition count 838
Iterating global reduction 1 with 11 rules applied. Total rules applied 252 place count 883 transition count 838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 263 place count 872 transition count 827
Iterating global reduction 1 with 11 rules applied. Total rules applied 274 place count 872 transition count 827
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 285 place count 861 transition count 816
Iterating global reduction 1 with 11 rules applied. Total rules applied 296 place count 861 transition count 816
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 307 place count 850 transition count 805
Iterating global reduction 1 with 11 rules applied. Total rules applied 318 place count 850 transition count 805
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 329 place count 839 transition count 794
Iterating global reduction 1 with 11 rules applied. Total rules applied 340 place count 839 transition count 794
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 351 place count 828 transition count 783
Iterating global reduction 1 with 11 rules applied. Total rules applied 362 place count 828 transition count 783
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 373 place count 828 transition count 772
Applied a total of 373 rules in 270 ms. Remains 828 /1015 variables (removed 187) and now considering 772/958 (removed 186) transitions.
// Phase 1: matrix 772 rows 828 cols
[2022-05-16 10:47:56] [INFO ] Computed 78 place invariants in 9 ms
[2022-05-16 10:47:56] [INFO ] Implicit Places using invariants in 187 ms returned [364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 188 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 817/1015 places, 772/958 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 796 transition count 751
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 796 transition count 751
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 786 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 786 transition count 731
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 776 transition count 721
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 776 transition count 721
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 766 transition count 711
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 766 transition count 711
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 756 transition count 701
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 756 transition count 701
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 746 transition count 691
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 746 transition count 691
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 736 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 736 transition count 681
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 726 transition count 671
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 726 transition count 671
Applied a total of 182 rules in 133 ms. Remains 726 /817 variables (removed 91) and now considering 671/772 (removed 101) transitions.
// Phase 1: matrix 671 rows 726 cols
[2022-05-16 10:47:56] [INFO ] Computed 67 place invariants in 9 ms
[2022-05-16 10:47:56] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 671 rows 726 cols
[2022-05-16 10:47:56] [INFO ] Computed 67 place invariants in 4 ms
[2022-05-16 10:47:57] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 726/1015 places, 671/958 transitions.
Finished structural reductions, in 2 iterations. Remains : 726/1015 places, 671/958 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, p0, true, p0]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 (ADD s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 439 ms.
Product exploration explored 100000 steps with 33333 reset in 451 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 finished in 2365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F((F(p1)&&p0))))'
Found a CL insensitive property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 33 out of 1015 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1015/1015 places, 958/958 transitions.
Graph (complete) has 1177 edges and 1015 vertex of which 991 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 969 transition count 363
Reduce places removed 561 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 583 rules applied. Total rules applied 1156 place count 408 transition count 341
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1178 place count 386 transition count 341
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 1178 place count 386 transition count 187
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 374 rules applied. Total rules applied 1552 place count 166 transition count 187
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1574 place count 166 transition count 165
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 44 rules applied. Total rules applied 1618 place count 144 transition count 143
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1629 place count 133 transition count 143
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1629 place count 133 transition count 132
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1651 place count 122 transition count 132
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1662 place count 111 transition count 121
Iterating global reduction 6 with 11 rules applied. Total rules applied 1673 place count 111 transition count 121
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1684 place count 111 transition count 110
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1684 place count 111 transition count 99
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 33 rules applied. Total rules applied 1717 place count 89 transition count 99
Applied a total of 1717 rules in 38 ms. Remains 89 /1015 variables (removed 926) and now considering 99/958 (removed 859) transitions.
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 10:47:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 10:47:58] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 10:47:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 10:47:58] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 10:47:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:47:58] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 89/1015 places, 99/958 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/1015 places, 99/958 transitions.
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55)), p1:(GT 1 (ADD s78 s79 s80 s81 s82 s83 s84 s85 s8...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14423 reset in 196 ms.
Product exploration explored 100000 steps with 14367 reset in 211 ms.
Computed a total of 89 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 89 transition count 99
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 (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 8 factoid took 338 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 10:48:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:48:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 10:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:48:00] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 10:48:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:48:00] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 10:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:48:00] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-16 10:48:00] [INFO ] Computed and/alt/rep : 77/88/77 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 10:48:00] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 89 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 : 89/89 places, 99/99 transitions.
Applied a total of 0 rules in 20 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 10:48:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:48:00] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 10:48:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 10:48:00] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-16 10:48:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 10:48:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 10:48:00] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 99/99 transitions.
Computed a total of 89 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 89 transition count 99
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)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 263 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 10:48:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:48:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 10:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:48:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 10:48:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:48:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 10:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:48:01] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 10:48:01] [INFO ] Computed and/alt/rep : 77/88/77 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 10:48:01] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14410 reset in 174 ms.
Product exploration explored 100000 steps with 14432 reset in 193 ms.
Built C files in :
/tmp/ltsmin14519088841567676442
[2022-05-16 10:48:01] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2022-05-16 10:48:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:01] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2022-05-16 10:48:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:01] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2022-05-16 10:48:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14519088841567676442
Running compilation step : cd /tmp/ltsmin14519088841567676442;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin14519088841567676442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14519088841567676442;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10890059805671279799.hoa' '--buchi-type=spotba'
LTSmin run took 366 ms.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 finished in 3848 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-16 10:48:02] [INFO ] Flatten gal took : 41 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 108505 ms.
BK_STOP 1652698082751
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110600619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00010M0001C001P001G001.tgz
mv FamilyReunion-COL-L00010M0001C001P001G001 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;