Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-18b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716497880977

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 20:58:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:58:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:58:02] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-23 20:58:02] [INFO ] Transformed 4370 places.
[2024-05-23 20:58:02] [INFO ] Transformed 5037 transitions.
[2024-05-23 20:58:02] [INFO ] Found NUPN structural information;
[2024-05-23 20:58:02] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 4370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Discarding 1818 places :
Symmetric choice reduction at 0 with 1818 rule applications. Total rules 1818 place count 2552 transition count 3219
Iterating global reduction 0 with 1818 rules applied. Total rules applied 3636 place count 2552 transition count 3219
Discarding 857 places :
Symmetric choice reduction at 0 with 857 rule applications. Total rules 4493 place count 1695 transition count 2362
Iterating global reduction 0 with 857 rules applied. Total rules applied 5350 place count 1695 transition count 2362
Discarding 552 places :
Symmetric choice reduction at 0 with 552 rule applications. Total rules 5902 place count 1143 transition count 1810
Iterating global reduction 0 with 552 rules applied. Total rules applied 6454 place count 1143 transition count 1810
Ensure Unique test removed 266 transitions
Reduce isomorphic transitions removed 266 transitions.
Iterating post reduction 0 with 266 rules applied. Total rules applied 6720 place count 1143 transition count 1544
Applied a total of 6720 rules in 783 ms. Remains 1143 /4370 variables (removed 3227) and now considering 1544/5037 (removed 3493) transitions.
// Phase 1: matrix 1544 rows 1143 cols
[2024-05-23 20:58:04] [INFO ] Computed 20 invariants in 63 ms
[2024-05-23 20:58:04] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-23 20:58:04] [INFO ] Invariant cache hit.
[2024-05-23 20:58:05] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
[2024-05-23 20:58:05] [INFO ] Invariant cache hit.
[2024-05-23 20:58:06] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1143/4370 places, 1544/5037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3132 ms. Remains : 1143/4370 places, 1544/5037 transitions.
Support contains 33 out of 1143 places after structural reductions.
[2024-05-23 20:58:06] [INFO ] Flatten gal took : 123 ms
[2024-05-23 20:58:06] [INFO ] Flatten gal took : 74 ms
[2024-05-23 20:58:06] [INFO ] Input system was already deterministic with 1544 transitions.
Support contains 32 out of 1143 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-23 20:58:07] [INFO ] Invariant cache hit.
[2024-05-23 20:58:08] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-23 20:58:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-23 20:58:09] [INFO ] After 951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-23 20:58:10] [INFO ] Deduced a trap composed of 343 places in 356 ms of which 12 ms to minimize.
[2024-05-23 20:58:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2024-05-23 20:58:11] [INFO ] After 2363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 538 ms.
[2024-05-23 20:58:11] [INFO ] After 3504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 10 properties in 128 ms.
Support contains 4 out of 1143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Graph (trivial) has 1080 edges and 1143 vertex of which 109 / 1143 are part of one of the 18 SCC in 7 ms
Free SCC test removed 91 places
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 1052 transition count 1345
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 179 place count 963 transition count 1345
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 179 place count 963 transition count 1301
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 267 place count 919 transition count 1301
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 325 place count 861 transition count 1243
Iterating global reduction 2 with 58 rules applied. Total rules applied 383 place count 861 transition count 1243
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 390 place count 861 transition count 1236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 390 place count 861 transition count 1235
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 860 transition count 1235
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 404 place count 848 transition count 1223
Iterating global reduction 3 with 12 rules applied. Total rules applied 416 place count 848 transition count 1223
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 427 place count 848 transition count 1212
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 4 with 224 rules applied. Total rules applied 651 place count 736 transition count 1100
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 687 place count 736 transition count 1064
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 708 place count 715 transition count 1043
Iterating global reduction 5 with 21 rules applied. Total rules applied 729 place count 715 transition count 1043
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 732 place count 715 transition count 1040
Free-agglomeration rule applied 615 times.
Iterating global reduction 6 with 615 rules applied. Total rules applied 1347 place count 715 transition count 425
Reduce places removed 615 places and 0 transitions.
Drop transitions removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Graph (complete) has 273 edges and 100 vertex of which 45 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 903 rules applied. Total rules applied 2250 place count 45 transition count 138
Drop transitions removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 7 with 77 rules applied. Total rules applied 2327 place count 45 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2328 place count 44 transition count 60
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 35 edges and 43 vertex of which 14 / 43 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 2330 place count 36 transition count 60
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 2344 place count 36 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 7 Pre rules applied. Total rules applied 2344 place count 36 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 2358 place count 29 transition count 39
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2365 place count 29 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 2379 place count 22 transition count 25
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 2386 place count 22 transition count 18
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 2405 place count 10 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2407 place count 10 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 2409 place count 8 transition count 9
Applied a total of 2409 rules in 913 ms. Remains 8 /1143 variables (removed 1135) and now considering 9/1544 (removed 1535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 913 ms. Remains : 8/1143 places, 9/1544 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(p1 U p2)))'
Support contains 6 out of 1143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1119 transition count 1520
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1119 transition count 1520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 1119 transition count 1514
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 69 place count 1104 transition count 1499
Iterating global reduction 1 with 15 rules applied. Total rules applied 84 place count 1104 transition count 1499
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 1104 transition count 1493
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 97 place count 1097 transition count 1486
Iterating global reduction 2 with 7 rules applied. Total rules applied 104 place count 1097 transition count 1486
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 1097 transition count 1480
Applied a total of 110 rules in 121 ms. Remains 1097 /1143 variables (removed 46) and now considering 1480/1544 (removed 64) transitions.
// Phase 1: matrix 1480 rows 1097 cols
[2024-05-23 20:58:12] [INFO ] Computed 20 invariants in 36 ms
[2024-05-23 20:58:13] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-23 20:58:13] [INFO ] Invariant cache hit.
[2024-05-23 20:58:14] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
[2024-05-23 20:58:14] [INFO ] Invariant cache hit.
[2024-05-23 20:58:14] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1097/1143 places, 1480/1544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2030 ms. Remains : 1097/1143 places, 1480/1544 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s67 0) (EQ s35 1)), p1:(OR (EQ s588 0) (EQ s223 1)), p0:(OR (EQ s158 0) (EQ s77 1))], 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 50000 reset in 996 ms.
Product exploration explored 100000 steps with 50000 reset in 924 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-00 finished in 4381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1116 transition count 1517
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1116 transition count 1517
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 61 place count 1116 transition count 1510
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 78 place count 1099 transition count 1493
Iterating global reduction 1 with 17 rules applied. Total rules applied 95 place count 1099 transition count 1493
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 104 place count 1099 transition count 1484
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 1093 transition count 1478
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 1093 transition count 1478
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 121 place count 1093 transition count 1473
Applied a total of 121 rules in 113 ms. Remains 1093 /1143 variables (removed 50) and now considering 1473/1544 (removed 71) transitions.
// Phase 1: matrix 1473 rows 1093 cols
[2024-05-23 20:58:17] [INFO ] Computed 20 invariants in 28 ms
[2024-05-23 20:58:17] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-23 20:58:17] [INFO ] Invariant cache hit.
[2024-05-23 20:58:18] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2024-05-23 20:58:18] [INFO ] Invariant cache hit.
[2024-05-23 20:58:19] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1093/1143 places, 1473/1544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2080 ms. Remains : 1093/1143 places, 1473/1544 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s712 0) (EQ s28 1))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 813 ms.
Product exploration explored 100000 steps with 50000 reset in 830 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-01 finished in 3857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&(F(p2)||p1))))'
Support contains 6 out of 1143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Graph (trivial) has 1078 edges and 1143 vertex of which 109 / 1143 are part of one of the 18 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 1051 transition count 1362
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 179 place count 962 transition count 1362
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 179 place count 962 transition count 1319
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 265 place count 919 transition count 1319
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 321 place count 863 transition count 1263
Iterating global reduction 2 with 56 rules applied. Total rules applied 377 place count 863 transition count 1263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 384 place count 863 transition count 1256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 396 place count 851 transition count 1244
Iterating global reduction 3 with 12 rules applied. Total rules applied 408 place count 851 transition count 1244
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 418 place count 851 transition count 1234
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 4 with 222 rules applied. Total rules applied 640 place count 740 transition count 1123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 642 place count 738 transition count 1121
Iterating global reduction 4 with 2 rules applied. Total rules applied 644 place count 738 transition count 1121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 646 place count 738 transition count 1119
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 664 place count 738 transition count 1101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 666 place count 736 transition count 1099
Applied a total of 666 rules in 605 ms. Remains 736 /1143 variables (removed 407) and now considering 1099/1544 (removed 445) transitions.
[2024-05-23 20:58:21] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
// Phase 1: matrix 1064 rows 736 cols
[2024-05-23 20:58:21] [INFO ] Computed 20 invariants in 28 ms
[2024-05-23 20:58:21] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-23 20:58:21] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:21] [INFO ] Invariant cache hit.
[2024-05-23 20:58:22] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
[2024-05-23 20:58:22] [INFO ] Redundant transitions in 64 ms returned []
[2024-05-23 20:58:22] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:22] [INFO ] Invariant cache hit.
[2024-05-23 20:58:23] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 736/1143 places, 1099/1544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2162 ms. Remains : 736/1143 places, 1099/1544 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s380 0) (EQ s364 1)), p1:(OR (EQ s681 0) (EQ s11 1)), p2:(OR (EQ s314 0) (EQ s628 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4095 reset in 1093 ms.
Product exploration explored 100000 steps with 4103 reset in 1034 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 415 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 275875 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275875 steps, saw 96471 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 20:58:29] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:29] [INFO ] Invariant cache hit.
[2024-05-23 20:58:29] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 20:58:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-23 20:58:29] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 20:58:30] [INFO ] Deduced a trap composed of 316 places in 207 ms of which 1 ms to minimize.
[2024-05-23 20:58:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-05-23 20:58:30] [INFO ] After 738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-23 20:58:30] [INFO ] After 973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 736/736 places, 1099/1099 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 736 transition count 1063
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 54 place count 718 transition count 1045
Iterating global reduction 1 with 18 rules applied. Total rules applied 72 place count 718 transition count 1045
Free-agglomeration rule applied 617 times.
Iterating global reduction 1 with 617 rules applied. Total rules applied 689 place count 718 transition count 428
Reduce places removed 618 places and 0 transitions.
Drop transitions removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Graph (complete) has 189 edges and 100 vertex of which 45 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 55 output transitions
Drop transitions removed 55 transitions
Graph (trivial) has 57 edges and 45 vertex of which 14 / 45 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 907 rules applied. Total rules applied 1596 place count 38 transition count 86
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1632 place count 38 transition count 50
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1632 place count 38 transition count 43
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1646 place count 31 transition count 43
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1653 place count 31 transition count 36
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1667 place count 24 transition count 29
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 1674 place count 24 transition count 22
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1692 place count 13 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1693 place count 13 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1694 place count 12 transition count 14
Applied a total of 1694 rules in 158 ms. Remains 12 /736 variables (removed 724) and now considering 14/1099 (removed 1085) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 12/736 places, 14/1099 transitions.
Finished random walk after 426 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=426 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 6 out of 736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 736/736 places, 1099/1099 transitions.
Applied a total of 0 rules in 60 ms. Remains 736 /736 variables (removed 0) and now considering 1099/1099 (removed 0) transitions.
[2024-05-23 20:58:30] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:30] [INFO ] Invariant cache hit.
[2024-05-23 20:58:31] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-23 20:58:31] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:31] [INFO ] Invariant cache hit.
[2024-05-23 20:58:32] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2024-05-23 20:58:32] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-23 20:58:32] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:32] [INFO ] Invariant cache hit.
[2024-05-23 20:58:32] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1530 ms. Remains : 736/736 places, 1099/1099 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 416 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 293167 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293167 steps, saw 103372 distinct states, run finished after 3003 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 20:58:36] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:36] [INFO ] Invariant cache hit.
[2024-05-23 20:58:36] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 20:58:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-23 20:58:36] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 20:58:37] [INFO ] Deduced a trap composed of 316 places in 200 ms of which 1 ms to minimize.
[2024-05-23 20:58:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-05-23 20:58:37] [INFO ] After 764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-23 20:58:37] [INFO ] After 1015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 736/736 places, 1099/1099 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 736 transition count 1063
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 54 place count 718 transition count 1045
Iterating global reduction 1 with 18 rules applied. Total rules applied 72 place count 718 transition count 1045
Free-agglomeration rule applied 617 times.
Iterating global reduction 1 with 617 rules applied. Total rules applied 689 place count 718 transition count 428
Reduce places removed 618 places and 0 transitions.
Drop transitions removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Graph (complete) has 189 edges and 100 vertex of which 45 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 55 output transitions
Drop transitions removed 55 transitions
Graph (trivial) has 57 edges and 45 vertex of which 14 / 45 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 907 rules applied. Total rules applied 1596 place count 38 transition count 86
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1632 place count 38 transition count 50
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1632 place count 38 transition count 43
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1646 place count 31 transition count 43
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1653 place count 31 transition count 36
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1667 place count 24 transition count 29
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 1674 place count 24 transition count 22
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1692 place count 13 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1693 place count 13 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1694 place count 12 transition count 14
Applied a total of 1694 rules in 95 ms. Remains 12 /736 variables (removed 724) and now considering 14/1099 (removed 1085) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 12/736 places, 14/1099 transitions.
Finished random walk after 120 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 4079 reset in 957 ms.
Product exploration explored 100000 steps with 4116 reset in 978 ms.
Built C files in :
/tmp/ltsmin16723967624629642455
[2024-05-23 20:58:39] [INFO ] Computing symmetric may disable matrix : 1099 transitions.
[2024-05-23 20:58:39] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:58:39] [INFO ] Computing symmetric may enable matrix : 1099 transitions.
[2024-05-23 20:58:39] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:58:40] [INFO ] Computing Do-Not-Accords matrix : 1099 transitions.
[2024-05-23 20:58:40] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:58:40] [INFO ] Built C files in 322ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16723967624629642455
Running compilation step : cd /tmp/ltsmin16723967624629642455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16723967624629642455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16723967624629642455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 736/736 places, 1099/1099 transitions.
Applied a total of 0 rules in 72 ms. Remains 736 /736 variables (removed 0) and now considering 1099/1099 (removed 0) transitions.
[2024-05-23 20:58:43] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:43] [INFO ] Invariant cache hit.
[2024-05-23 20:58:43] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-23 20:58:43] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:43] [INFO ] Invariant cache hit.
[2024-05-23 20:58:44] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2024-05-23 20:58:44] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-23 20:58:44] [INFO ] Flow matrix only has 1064 transitions (discarded 35 similar events)
[2024-05-23 20:58:44] [INFO ] Invariant cache hit.
[2024-05-23 20:58:44] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1538 ms. Remains : 736/736 places, 1099/1099 transitions.
Built C files in :
/tmp/ltsmin13448201519049310072
[2024-05-23 20:58:44] [INFO ] Computing symmetric may disable matrix : 1099 transitions.
[2024-05-23 20:58:44] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:58:44] [INFO ] Computing symmetric may enable matrix : 1099 transitions.
[2024-05-23 20:58:44] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:58:44] [INFO ] Computing Do-Not-Accords matrix : 1099 transitions.
[2024-05-23 20:58:44] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:58:45] [INFO ] Built C files in 285ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13448201519049310072
Running compilation step : cd /tmp/ltsmin13448201519049310072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13448201519049310072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13448201519049310072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 20:58:48] [INFO ] Flatten gal took : 38 ms
[2024-05-23 20:58:48] [INFO ] Flatten gal took : 40 ms
[2024-05-23 20:58:48] [INFO ] Time to serialize gal into /tmp/LTL7893968059215063853.gal : 8 ms
[2024-05-23 20:58:48] [INFO ] Time to serialize properties into /tmp/LTL3449420276053200469.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7893968059215063853.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9466566383870741210.hoa' '-atoms' '/tmp/LTL3449420276053200469.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3449420276053200469.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9466566383870741210.hoa
Detected timeout of ITS tools.
[2024-05-23 20:59:03] [INFO ] Flatten gal took : 53 ms
[2024-05-23 20:59:03] [INFO ] Flatten gal took : 32 ms
[2024-05-23 20:59:03] [INFO ] Time to serialize gal into /tmp/LTL5812744856769362645.gal : 7 ms
[2024-05-23 20:59:03] [INFO ] Time to serialize properties into /tmp/LTL4016515137673605391.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5812744856769362645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4016515137673605391.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((p2602==0)||(p2517==1))")))&&(("((p4098==0)||(p129==1))")||(F("((p2208==0)||(p3844==1))"))))))
Formula 0 simplified : F(GF!"((p2602==0)||(p2517==1))" | (!"((p4098==0)||(p129==1))" & G!"((p2208==0)||(p3844==1))"))
Detected timeout of ITS tools.
[2024-05-23 20:59:18] [INFO ] Flatten gal took : 30 ms
[2024-05-23 20:59:18] [INFO ] Applying decomposition
[2024-05-23 20:59:18] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15386327582855745487.txt' '-o' '/tmp/graph15386327582855745487.bin' '-w' '/tmp/graph15386327582855745487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15386327582855745487.bin' '-l' '-1' '-v' '-w' '/tmp/graph15386327582855745487.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:59:18] [INFO ] Decomposing Gal with order
[2024-05-23 20:59:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:59:18] [INFO ] Removed a total of 439 redundant transitions.
[2024-05-23 20:59:19] [INFO ] Flatten gal took : 329 ms
[2024-05-23 20:59:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 21 ms.
[2024-05-23 20:59:19] [INFO ] Time to serialize gal into /tmp/LTL9231211141831812665.gal : 14 ms
[2024-05-23 20:59:19] [INFO ] Time to serialize properties into /tmp/LTL3253379545877558525.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9231211141831812665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3253379545877558525.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((u48.p2602==0)||(u48.p2517==1))")))&&(("((i14.u56.p4098==0)||(u2.p129==1))")||(F("((i13.u39.p2208==0)||(i11.u55.p3844==1))...162
Formula 0 simplified : F(GF!"((u48.p2602==0)||(u48.p2517==1))" | (!"((i14.u56.p4098==0)||(u2.p129==1))" & G!"((i13.u39.p2208==0)||(i11.u55.p3844==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10355918703128387332
[2024-05-23 20:59:34] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10355918703128387332
Running compilation step : cd /tmp/ltsmin10355918703128387332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1732 ms.
Running link step : cd /tmp/ltsmin10355918703128387332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10355918703128387332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-03 finished in 88203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 1143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1116 transition count 1517
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1116 transition count 1517
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 1116 transition count 1509
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 78 place count 1100 transition count 1493
Iterating global reduction 1 with 16 rules applied. Total rules applied 94 place count 1100 transition count 1493
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 103 place count 1100 transition count 1484
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 1094 transition count 1478
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 1094 transition count 1478
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 1094 transition count 1473
Applied a total of 120 rules in 103 ms. Remains 1094 /1143 variables (removed 49) and now considering 1473/1544 (removed 71) transitions.
// Phase 1: matrix 1473 rows 1094 cols
[2024-05-23 20:59:49] [INFO ] Computed 20 invariants in 26 ms
[2024-05-23 20:59:49] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-23 20:59:49] [INFO ] Invariant cache hit.
[2024-05-23 20:59:50] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
[2024-05-23 20:59:50] [INFO ] Invariant cache hit.
[2024-05-23 20:59:51] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1094/1143 places, 1473/1544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2142 ms. Remains : 1094/1143 places, 1473/1544 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s344 1), p1:(OR (EQ s912 0) (EQ s539 1))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 837 ms.
Product exploration explored 100000 steps with 50000 reset in 839 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-04 finished in 4132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Graph (trivial) has 1085 edges and 1143 vertex of which 109 / 1143 are part of one of the 18 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 1051 transition count 1358
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 187 place count 958 transition count 1358
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 187 place count 958 transition count 1315
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 273 place count 915 transition count 1315
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 334 place count 854 transition count 1254
Iterating global reduction 2 with 61 rules applied. Total rules applied 395 place count 854 transition count 1254
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 403 place count 854 transition count 1246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 403 place count 854 transition count 1245
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 405 place count 853 transition count 1245
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 417 place count 841 transition count 1233
Iterating global reduction 3 with 12 rules applied. Total rules applied 429 place count 841 transition count 1233
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 440 place count 841 transition count 1222
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 658 place count 732 transition count 1113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 661 place count 729 transition count 1110
Iterating global reduction 4 with 3 rules applied. Total rules applied 664 place count 729 transition count 1110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 667 place count 729 transition count 1107
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 685 place count 729 transition count 1089
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 686 place count 729 transition count 1089
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 688 place count 727 transition count 1087
Applied a total of 688 rules in 363 ms. Remains 727 /1143 variables (removed 416) and now considering 1087/1544 (removed 457) transitions.
[2024-05-23 20:59:53] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
// Phase 1: matrix 1052 rows 727 cols
[2024-05-23 20:59:53] [INFO ] Computed 20 invariants in 29 ms
[2024-05-23 20:59:54] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-23 20:59:54] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 20:59:54] [INFO ] Invariant cache hit.
[2024-05-23 20:59:54] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2024-05-23 20:59:54] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-23 20:59:54] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 20:59:54] [INFO ] Invariant cache hit.
[2024-05-23 20:59:55] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 727/1143 places, 1087/1544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1912 ms. Remains : 727/1143 places, 1087/1544 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-05 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:(OR (EQ s261 0) (EQ s24 1))], 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 4088 reset in 986 ms.
Product exploration explored 100000 steps with 4085 reset in 988 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 417 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 534098 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 534098 steps, saw 131021 distinct states, run finished after 3002 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:00:00] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:00:00] [INFO ] Invariant cache hit.
[2024-05-23 21:00:00] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:00:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-23 21:00:01] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:00:01] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-23 21:00:01] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 727 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 727/727 places, 1087/1087 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 727 transition count 1051
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 54 place count 709 transition count 1033
Iterating global reduction 1 with 18 rules applied. Total rules applied 72 place count 709 transition count 1033
Free-agglomeration rule applied 615 times.
Iterating global reduction 1 with 615 rules applied. Total rules applied 687 place count 709 transition count 418
Discarding 75 places :
Also discarding 301 output transitions
Drop transitions removed 301 transitions
Remove reverse transitions (loop back) rule discarded transition t305.t1187.t1053.t1054 and 75 places that fell out of Prefix Of Interest.
Drop transitions removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (trivial) has 20 edges and 17 vertex of which 14 / 17 are part of one of the 4 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 95 rules applied. Total rules applied 782 place count 7 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 802 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 803 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 803 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 805 place count 4 transition count 4
Applied a total of 805 rules in 87 ms. Remains 4 /727 variables (removed 723) and now considering 4/1087 (removed 1083) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 4/727 places, 4/1087 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 727 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 727/727 places, 1087/1087 transitions.
Applied a total of 0 rules in 56 ms. Remains 727 /727 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2024-05-23 21:00:01] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:00:01] [INFO ] Invariant cache hit.
[2024-05-23 21:00:02] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 21:00:02] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:00:02] [INFO ] Invariant cache hit.
[2024-05-23 21:00:02] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2024-05-23 21:00:02] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-23 21:00:02] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:00:02] [INFO ] Invariant cache hit.
[2024-05-23 21:00:03] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1589 ms. Remains : 727/727 places, 1087/1087 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 417 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 550702 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 550702 steps, saw 133969 distinct states, run finished after 3004 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:00:06] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:00:06] [INFO ] Invariant cache hit.
[2024-05-23 21:00:06] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:00:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-23 21:00:07] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:00:07] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-23 21:00:07] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 727 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 727/727 places, 1087/1087 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 727 transition count 1051
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 54 place count 709 transition count 1033
Iterating global reduction 1 with 18 rules applied. Total rules applied 72 place count 709 transition count 1033
Free-agglomeration rule applied 615 times.
Iterating global reduction 1 with 615 rules applied. Total rules applied 687 place count 709 transition count 418
Discarding 75 places :
Also discarding 301 output transitions
Drop transitions removed 301 transitions
Remove reverse transitions (loop back) rule discarded transition t305.t1187.t1053.t1054 and 75 places that fell out of Prefix Of Interest.
Drop transitions removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (trivial) has 20 edges and 17 vertex of which 14 / 17 are part of one of the 4 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 95 rules applied. Total rules applied 782 place count 7 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 802 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 803 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 803 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 805 place count 4 transition count 4
Applied a total of 805 rules in 84 ms. Remains 4 /727 variables (removed 723) and now considering 4/1087 (removed 1083) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 4/727 places, 4/1087 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4089 reset in 933 ms.
Product exploration explored 100000 steps with 4097 reset in 939 ms.
Built C files in :
/tmp/ltsmin6456096261674832346
[2024-05-23 21:00:09] [INFO ] Computing symmetric may disable matrix : 1087 transitions.
[2024-05-23 21:00:09] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:00:09] [INFO ] Computing symmetric may enable matrix : 1087 transitions.
[2024-05-23 21:00:09] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:00:09] [INFO ] Computing Do-Not-Accords matrix : 1087 transitions.
[2024-05-23 21:00:09] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:00:09] [INFO ] Built C files in 272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6456096261674832346
Running compilation step : cd /tmp/ltsmin6456096261674832346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6456096261674832346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6456096261674832346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 727 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 727/727 places, 1087/1087 transitions.
Applied a total of 0 rules in 55 ms. Remains 727 /727 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2024-05-23 21:00:12] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:00:12] [INFO ] Invariant cache hit.
[2024-05-23 21:00:13] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-23 21:00:13] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:00:13] [INFO ] Invariant cache hit.
[2024-05-23 21:00:13] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2024-05-23 21:00:13] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-23 21:00:13] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:00:13] [INFO ] Invariant cache hit.
[2024-05-23 21:00:14] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1456 ms. Remains : 727/727 places, 1087/1087 transitions.
Built C files in :
/tmp/ltsmin15946554475645760547
[2024-05-23 21:00:14] [INFO ] Computing symmetric may disable matrix : 1087 transitions.
[2024-05-23 21:00:14] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:00:14] [INFO ] Computing symmetric may enable matrix : 1087 transitions.
[2024-05-23 21:00:14] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:00:14] [INFO ] Computing Do-Not-Accords matrix : 1087 transitions.
[2024-05-23 21:00:14] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:00:14] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15946554475645760547
Running compilation step : cd /tmp/ltsmin15946554475645760547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15946554475645760547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15946554475645760547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 21:00:17] [INFO ] Flatten gal took : 26 ms
[2024-05-23 21:00:17] [INFO ] Flatten gal took : 26 ms
[2024-05-23 21:00:17] [INFO ] Time to serialize gal into /tmp/LTL9119149832294010896.gal : 5 ms
[2024-05-23 21:00:17] [INFO ] Time to serialize properties into /tmp/LTL8275011995834154592.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9119149832294010896.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1701254069554112438.hoa' '-atoms' '/tmp/LTL8275011995834154592.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8275011995834154592.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1701254069554112438.hoa
Detected timeout of ITS tools.
[2024-05-23 21:00:32] [INFO ] Flatten gal took : 30 ms
[2024-05-23 21:00:32] [INFO ] Flatten gal took : 28 ms
[2024-05-23 21:00:32] [INFO ] Time to serialize gal into /tmp/LTL8644886349749611291.gal : 5 ms
[2024-05-23 21:00:32] [INFO ] Time to serialize properties into /tmp/LTL6937328550991133918.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8644886349749611291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6937328550991133918.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p1801==0)||(p215==1))"))))
Formula 0 simplified : FG!"((p1801==0)||(p215==1))"
Detected timeout of ITS tools.
[2024-05-23 21:00:47] [INFO ] Flatten gal took : 25 ms
[2024-05-23 21:00:47] [INFO ] Applying decomposition
[2024-05-23 21:00:47] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10468148628115181737.txt' '-o' '/tmp/graph10468148628115181737.bin' '-w' '/tmp/graph10468148628115181737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10468148628115181737.bin' '-l' '-1' '-v' '-w' '/tmp/graph10468148628115181737.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:00:48] [INFO ] Decomposing Gal with order
[2024-05-23 21:00:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:00:48] [INFO ] Removed a total of 432 redundant transitions.
[2024-05-23 21:00:48] [INFO ] Flatten gal took : 134 ms
[2024-05-23 21:00:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 24 ms.
[2024-05-23 21:00:48] [INFO ] Time to serialize gal into /tmp/LTL6937329841322029483.gal : 26 ms
[2024-05-23 21:00:48] [INFO ] Time to serialize properties into /tmp/LTL220680081921801793.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6937329841322029483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL220680081921801793.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("((i10.u30.p1801==0)||(i1.u5.p215==1))"))))
Formula 0 simplified : FG!"((i10.u30.p1801==0)||(i1.u5.p215==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13283278198502000100
[2024-05-23 21:01:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13283278198502000100
Running compilation step : cd /tmp/ltsmin13283278198502000100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1664 ms.
Running link step : cd /tmp/ltsmin13283278198502000100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13283278198502000100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-05 finished in 85089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1118 transition count 1519
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1118 transition count 1519
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 1118 transition count 1512
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 73 place count 1102 transition count 1496
Iterating global reduction 1 with 16 rules applied. Total rules applied 89 place count 1102 transition count 1496
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 98 place count 1102 transition count 1487
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 1097 transition count 1482
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 1097 transition count 1482
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 112 place count 1097 transition count 1478
Applied a total of 112 rules in 105 ms. Remains 1097 /1143 variables (removed 46) and now considering 1478/1544 (removed 66) transitions.
// Phase 1: matrix 1478 rows 1097 cols
[2024-05-23 21:01:18] [INFO ] Computed 20 invariants in 22 ms
[2024-05-23 21:01:19] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-23 21:01:19] [INFO ] Invariant cache hit.
[2024-05-23 21:01:19] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2024-05-23 21:01:19] [INFO ] Invariant cache hit.
[2024-05-23 21:01:20] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1097/1143 places, 1478/1544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2132 ms. Remains : 1097/1143 places, 1478/1544 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s585 0) (EQ s367 1)) (AND (EQ s385 0) (EQ s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-08 finished in 2230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Graph (trivial) has 1084 edges and 1143 vertex of which 109 / 1143 are part of one of the 18 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 1051 transition count 1359
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 185 place count 959 transition count 1359
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 185 place count 959 transition count 1316
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 271 place count 916 transition count 1316
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 331 place count 856 transition count 1256
Iterating global reduction 2 with 60 rules applied. Total rules applied 391 place count 856 transition count 1256
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 398 place count 856 transition count 1249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 398 place count 856 transition count 1248
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 400 place count 855 transition count 1248
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 412 place count 843 transition count 1236
Iterating global reduction 3 with 12 rules applied. Total rules applied 424 place count 843 transition count 1236
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 435 place count 843 transition count 1225
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 655 place count 733 transition count 1115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 658 place count 730 transition count 1112
Iterating global reduction 4 with 3 rules applied. Total rules applied 661 place count 730 transition count 1112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 664 place count 730 transition count 1109
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 682 place count 730 transition count 1091
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 684 place count 728 transition count 1089
Applied a total of 684 rules in 266 ms. Remains 728 /1143 variables (removed 415) and now considering 1089/1544 (removed 455) transitions.
[2024-05-23 21:01:20] [INFO ] Flow matrix only has 1054 transitions (discarded 35 similar events)
// Phase 1: matrix 1054 rows 728 cols
[2024-05-23 21:01:20] [INFO ] Computed 20 invariants in 19 ms
[2024-05-23 21:01:21] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-23 21:01:21] [INFO ] Flow matrix only has 1054 transitions (discarded 35 similar events)
[2024-05-23 21:01:21] [INFO ] Invariant cache hit.
[2024-05-23 21:01:22] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2024-05-23 21:01:22] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-23 21:01:22] [INFO ] Flow matrix only has 1054 transitions (discarded 35 similar events)
[2024-05-23 21:01:22] [INFO ] Invariant cache hit.
[2024-05-23 21:01:22] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 728/1143 places, 1089/1544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1814 ms. Remains : 728/1143 places, 1089/1544 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-09 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:(AND (EQ s25 0) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-09 finished in 1904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Graph (trivial) has 1084 edges and 1143 vertex of which 109 / 1143 are part of one of the 18 SCC in 0 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 1051 transition count 1359
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 185 place count 959 transition count 1359
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 185 place count 959 transition count 1315
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 273 place count 915 transition count 1315
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 334 place count 854 transition count 1254
Iterating global reduction 2 with 61 rules applied. Total rules applied 395 place count 854 transition count 1254
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 402 place count 854 transition count 1247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 402 place count 854 transition count 1246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 404 place count 853 transition count 1246
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 416 place count 841 transition count 1234
Iterating global reduction 3 with 12 rules applied. Total rules applied 428 place count 841 transition count 1234
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 440 place count 841 transition count 1222
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 658 place count 732 transition count 1113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 661 place count 729 transition count 1110
Iterating global reduction 4 with 3 rules applied. Total rules applied 664 place count 729 transition count 1110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 667 place count 729 transition count 1107
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 685 place count 729 transition count 1089
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 686 place count 729 transition count 1089
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 688 place count 727 transition count 1087
Applied a total of 688 rules in 312 ms. Remains 727 /1143 variables (removed 416) and now considering 1087/1544 (removed 457) transitions.
[2024-05-23 21:01:22] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
// Phase 1: matrix 1052 rows 727 cols
[2024-05-23 21:01:22] [INFO ] Computed 20 invariants in 28 ms
[2024-05-23 21:01:23] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-23 21:01:23] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:01:23] [INFO ] Invariant cache hit.
[2024-05-23 21:01:23] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2024-05-23 21:01:23] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-23 21:01:23] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 21:01:23] [INFO ] Invariant cache hit.
[2024-05-23 21:01:24] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 727/1143 places, 1087/1544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1761 ms. Remains : 727/1143 places, 1087/1544 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s198 0) (EQ s234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-10 finished in 1816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1116 transition count 1517
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1116 transition count 1517
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 1116 transition count 1509
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 78 place count 1100 transition count 1493
Iterating global reduction 1 with 16 rules applied. Total rules applied 94 place count 1100 transition count 1493
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 102 place count 1100 transition count 1485
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 1094 transition count 1479
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 1094 transition count 1479
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 119 place count 1094 transition count 1474
Applied a total of 119 rules in 103 ms. Remains 1094 /1143 variables (removed 49) and now considering 1474/1544 (removed 70) transitions.
// Phase 1: matrix 1474 rows 1094 cols
[2024-05-23 21:01:24] [INFO ] Computed 20 invariants in 35 ms
[2024-05-23 21:01:24] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-23 21:01:24] [INFO ] Invariant cache hit.
[2024-05-23 21:01:25] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2024-05-23 21:01:25] [INFO ] Invariant cache hit.
[2024-05-23 21:01:26] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1094/1143 places, 1474/1544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2146 ms. Remains : 1094/1143 places, 1474/1544 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s539 0) (EQ s994 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 584 ms.
Product exploration explored 100000 steps with 33333 reset in 593 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-12 finished in 3461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 1143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Graph (trivial) has 1084 edges and 1143 vertex of which 103 / 1143 are part of one of the 17 SCC in 1 ms
Free SCC test removed 86 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 1056 transition count 1363
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 187 place count 963 transition count 1363
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 187 place count 963 transition count 1318
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 277 place count 918 transition count 1318
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 335 place count 860 transition count 1260
Iterating global reduction 2 with 58 rules applied. Total rules applied 393 place count 860 transition count 1260
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 401 place count 860 transition count 1252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 401 place count 860 transition count 1251
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 403 place count 859 transition count 1251
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 415 place count 847 transition count 1239
Iterating global reduction 3 with 12 rules applied. Total rules applied 427 place count 847 transition count 1239
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 439 place count 847 transition count 1227
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 665 place count 734 transition count 1114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 667 place count 732 transition count 1112
Iterating global reduction 4 with 2 rules applied. Total rules applied 669 place count 732 transition count 1112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 671 place count 732 transition count 1110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 673 place count 731 transition count 1110
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 692 place count 731 transition count 1091
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 694 place count 729 transition count 1089
Applied a total of 694 rules in 288 ms. Remains 729 /1143 variables (removed 414) and now considering 1089/1544 (removed 455) transitions.
[2024-05-23 21:01:28] [INFO ] Flow matrix only has 1055 transitions (discarded 34 similar events)
// Phase 1: matrix 1055 rows 729 cols
[2024-05-23 21:01:28] [INFO ] Computed 20 invariants in 26 ms
[2024-05-23 21:01:28] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-23 21:01:28] [INFO ] Flow matrix only has 1055 transitions (discarded 34 similar events)
[2024-05-23 21:01:28] [INFO ] Invariant cache hit.
[2024-05-23 21:01:29] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2024-05-23 21:01:29] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-23 21:01:29] [INFO ] Flow matrix only has 1055 transitions (discarded 34 similar events)
[2024-05-23 21:01:29] [INFO ] Invariant cache hit.
[2024-05-23 21:01:29] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 729/1143 places, 1089/1544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1779 ms. Remains : 729/1143 places, 1089/1544 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s418 1), p0:(EQ s242 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-13 finished in 1870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1143/1143 places, 1544/1544 transitions.
Graph (trivial) has 1085 edges and 1143 vertex of which 109 / 1143 are part of one of the 18 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 1051 transition count 1358
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 187 place count 958 transition count 1358
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 187 place count 958 transition count 1315
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 273 place count 915 transition count 1315
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 333 place count 855 transition count 1255
Iterating global reduction 2 with 60 rules applied. Total rules applied 393 place count 855 transition count 1255
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 400 place count 855 transition count 1248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 400 place count 855 transition count 1247
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 402 place count 854 transition count 1247
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 414 place count 842 transition count 1235
Iterating global reduction 3 with 12 rules applied. Total rules applied 426 place count 842 transition count 1235
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 437 place count 842 transition count 1224
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 657 place count 732 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 660 place count 729 transition count 1111
Iterating global reduction 4 with 3 rules applied. Total rules applied 663 place count 729 transition count 1111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 666 place count 729 transition count 1108
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 684 place count 729 transition count 1090
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 686 place count 727 transition count 1088
Applied a total of 686 rules in 290 ms. Remains 727 /1143 variables (removed 416) and now considering 1088/1544 (removed 456) transitions.
[2024-05-23 21:01:30] [INFO ] Flow matrix only has 1053 transitions (discarded 35 similar events)
// Phase 1: matrix 1053 rows 727 cols
[2024-05-23 21:01:30] [INFO ] Computed 20 invariants in 29 ms
[2024-05-23 21:01:30] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-23 21:01:30] [INFO ] Flow matrix only has 1053 transitions (discarded 35 similar events)
[2024-05-23 21:01:30] [INFO ] Invariant cache hit.
[2024-05-23 21:01:31] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2024-05-23 21:01:31] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-23 21:01:31] [INFO ] Flow matrix only has 1053 transitions (discarded 35 similar events)
[2024-05-23 21:01:31] [INFO ] Invariant cache hit.
[2024-05-23 21:01:31] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 727/1143 places, 1088/1544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1749 ms. Remains : 727/1143 places, 1088/1544 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s208 0) (EQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 255 steps with 10 reset in 8 ms.
FORMULA FlexibleBarrier-PT-18b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLCardinality-14 finished in 1811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&(F(p2)||p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-23 21:01:31] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6028062684768387296
[2024-05-23 21:01:31] [INFO ] Too many transitions (1544) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:01:31] [INFO ] Applying decomposition
[2024-05-23 21:01:31] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6028062684768387296
Running compilation step : cd /tmp/ltsmin6028062684768387296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 21:01:31] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2499367075238214070.txt' '-o' '/tmp/graph2499367075238214070.bin' '-w' '/tmp/graph2499367075238214070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2499367075238214070.bin' '-l' '-1' '-v' '-w' '/tmp/graph2499367075238214070.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:01:31] [INFO ] Decomposing Gal with order
[2024-05-23 21:01:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:01:32] [INFO ] Removed a total of 455 redundant transitions.
[2024-05-23 21:01:32] [INFO ] Flatten gal took : 129 ms
[2024-05-23 21:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 31 ms.
[2024-05-23 21:01:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality16397237014164392822.gal : 15 ms
[2024-05-23 21:01:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality7521823712544123865.ltl : 125 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16397237014164392822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7521823712544123865.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G((F(G("((i17.u183.p2602==0)||(i17.u175.p2517==1))")))&&(("((i17.u203.p4098==0)||(i1.u19.p129==1))")||(F("((i15.u154.p2208==0)||(i1...179
Formula 0 simplified : F(GF!"((i17.u183.p2602==0)||(i17.u175.p2517==1))" | (!"((i17.u203.p4098==0)||(i1.u19.p129==1))" & G!"((i15.u154.p2208==0)||(i19.u202...169
Compilation finished in 2971 ms.
Running link step : cd /tmp/ltsmin6028062684768387296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6028062684768387296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 21:22:42] [INFO ] Applying decomposition
[2024-05-23 21:22:42] [INFO ] Flatten gal took : 95 ms
[2024-05-23 21:22:42] [INFO ] Decomposing Gal with order
[2024-05-23 21:22:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:22:42] [INFO ] Removed a total of 427 redundant transitions.
[2024-05-23 21:22:43] [INFO ] Flatten gal took : 256 ms
[2024-05-23 21:22:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1530 labels/synchronizations in 543 ms.
[2024-05-23 21:22:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality10256083601603507601.gal : 28 ms
[2024-05-23 21:22:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality11623433589837085563.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10256083601603507601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11623433589837085563.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G((F(G("((i0.i0.i0.u33.p2602==0)||(i0.i0.i0.u33.p2517==1))")))&&(("((i1.u37.p4098==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...241
Formula 0 simplified : F(GF!"((i0.i0.i0.u33.p2602==0)||(i0.i0.i0.u33.p2517==1))" | (!"((i1.u37.p4098==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....231
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin6028062684768387296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&(<>((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6028062684768387296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 21:43:59] [INFO ] Flatten gal took : 387 ms
[2024-05-23 21:44:05] [INFO ] Input system was already deterministic with 1544 transitions.
[2024-05-23 21:44:05] [INFO ] Transformed 1143 places.
[2024-05-23 21:44:05] [INFO ] Transformed 1544 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 21:44:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality13774069645489510812.gal : 36 ms
[2024-05-23 21:44:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality6818537073969196330.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13774069645489510812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6818537073969196330.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F(G("((p2602==0)||(p2517==1))")))&&(("((p4098==0)||(p129==1))")||(F("((p2208==0)||(p3844==1))"))))))
Formula 0 simplified : F(GF!"((p2602==0)||(p2517==1))" | (!"((p4098==0)||(p129==1))" & G!"((p2208==0)||(p3844==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7788772 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15909796 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-18b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FlexibleBarrier-PT-18b, 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 r197-tall-171640624800077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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