Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593200459.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutoFlight-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593200459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 134K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678513746232

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 05:49:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:49:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:49:08] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-11 05:49:08] [INFO ] Transformed 574 places.
[2023-03-11 05:49:08] [INFO ] Transformed 572 transitions.
[2023-03-11 05:49:08] [INFO ] Found NUPN structural information;
[2023-03-11 05:49:08] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-06b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 502 transition count 500
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 502 transition count 500
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 154 place count 502 transition count 490
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 181 place count 475 transition count 463
Iterating global reduction 1 with 27 rules applied. Total rules applied 208 place count 475 transition count 463
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 212 place count 471 transition count 459
Iterating global reduction 1 with 4 rules applied. Total rules applied 216 place count 471 transition count 459
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 219 place count 468 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 222 place count 468 transition count 456
Applied a total of 222 rules in 139 ms. Remains 468 /574 variables (removed 106) and now considering 456/572 (removed 116) transitions.
// Phase 1: matrix 456 rows 468 cols
[2023-03-11 05:49:08] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-11 05:49:09] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-11 05:49:09] [INFO ] Invariant cache hit.
[2023-03-11 05:49:09] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2023-03-11 05:49:09] [INFO ] Invariant cache hit.
[2023-03-11 05:49:10] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/574 places, 456/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1446 ms. Remains : 468/574 places, 456/572 transitions.
Support contains 37 out of 468 places after structural reductions.
[2023-03-11 05:49:10] [INFO ] Flatten gal took : 67 ms
[2023-03-11 05:49:10] [INFO ] Flatten gal took : 34 ms
[2023-03-11 05:49:10] [INFO ] Input system was already deterministic with 456 transitions.
Support contains 33 out of 468 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 05:49:10] [INFO ] Invariant cache hit.
[2023-03-11 05:49:11] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-11 05:49:11] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 05:49:11] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:49:11] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-11 05:49:11] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 05:49:11] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 05:49:11] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 5 ms to minimize.
[2023-03-11 05:49:11] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2023-03-11 05:49:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2023-03-11 05:49:11] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 0 ms to minimize.
[2023-03-11 05:49:12] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2023-03-11 05:49:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2023-03-11 05:49:12] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 1 ms to minimize.
[2023-03-11 05:49:12] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 0 ms to minimize.
[2023-03-11 05:49:12] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 0 ms to minimize.
[2023-03-11 05:49:12] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2023-03-11 05:49:12] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 0 ms to minimize.
[2023-03-11 05:49:13] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2023-03-11 05:49:13] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 1 ms to minimize.
[2023-03-11 05:49:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1083 ms
[2023-03-11 05:49:13] [INFO ] After 2094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-11 05:49:13] [INFO ] After 2441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 72 ms.
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 456/456 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 468 transition count 291
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 186 rules applied. Total rules applied 351 place count 303 transition count 270
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 363 place count 291 transition count 270
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 363 place count 291 transition count 213
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 477 place count 234 transition count 213
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 482 place count 229 transition count 208
Iterating global reduction 3 with 5 rules applied. Total rules applied 487 place count 229 transition count 208
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 487 place count 229 transition count 204
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 495 place count 225 transition count 204
Performed 85 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 665 place count 140 transition count 108
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 689 place count 140 transition count 84
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 713 place count 116 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 714 place count 115 transition count 83
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 34 rules applied. Total rules applied 748 place count 98 transition count 66
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 765 place count 81 transition count 66
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 765 place count 81 transition count 54
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 789 place count 69 transition count 54
Applied a total of 789 rules in 68 ms. Remains 69 /468 variables (removed 399) and now considering 54/456 (removed 402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 69/468 places, 54/456 transitions.
Finished random walk after 97 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=48 )
FORMULA AutoFlight-PT-06b-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-06b-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 122 stabilizing places and 122 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((p1&&F(p2))))))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 456 transition count 444
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 456 transition count 444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 456 transition count 442
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 452 transition count 438
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 452 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 450 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 449 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 449 transition count 435
Applied a total of 40 rules in 97 ms. Remains 449 /468 variables (removed 19) and now considering 435/456 (removed 21) transitions.
// Phase 1: matrix 435 rows 449 cols
[2023-03-11 05:49:14] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-11 05:49:14] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-11 05:49:14] [INFO ] Invariant cache hit.
[2023-03-11 05:49:14] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-11 05:49:14] [INFO ] Invariant cache hit.
[2023-03-11 05:49:14] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/468 places, 435/456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 824 ms. Remains : 449/468 places, 435/456 transitions.
Stuttering acceptance computed with spot in 601 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s53 1), p1:(OR (EQ s68 0) (EQ s438 1)), p2:(OR (EQ s396 0) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33501 reset in 409 ms.
Product exploration explored 100000 steps with 33358 reset in 276 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/449 stabilizing places and 108/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 924 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:49:17] [INFO ] Invariant cache hit.
[2023-03-11 05:49:17] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:49:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2023-03-11 05:49:17] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-11 05:49:18] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:49:18] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2023-03-11 05:49:18] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 1 ms to minimize.
[2023-03-11 05:49:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2023-03-11 05:49:18] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 0 ms to minimize.
[2023-03-11 05:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-11 05:49:18] [INFO ] After 1017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-11 05:49:19] [INFO ] After 1238ms 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 2 properties in 20 ms.
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 435/435 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 449 transition count 276
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 178 rules applied. Total rules applied 337 place count 290 transition count 257
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 349 place count 278 transition count 257
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 349 place count 278 transition count 202
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 459 place count 223 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 460 place count 222 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 222 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 461 place count 222 transition count 200
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 463 place count 221 transition count 200
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 635 place count 135 transition count 103
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 659 place count 135 transition count 79
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 683 place count 111 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 684 place count 110 transition count 78
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 75 rules applied. Total rules applied 759 place count 81 transition count 32
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 805 place count 35 transition count 32
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 805 place count 35 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 825 place count 25 transition count 22
Applied a total of 825 rules in 31 ms. Remains 25 /449 variables (removed 424) and now considering 22/435 (removed 413) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 25/449 places, 22/435 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 15 factoid took 1076 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Applied a total of 0 rules in 29 ms. Remains 449 /449 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-11 05:49:20] [INFO ] Invariant cache hit.
[2023-03-11 05:49:20] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-11 05:49:20] [INFO ] Invariant cache hit.
[2023-03-11 05:49:21] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-11 05:49:21] [INFO ] Invariant cache hit.
[2023-03-11 05:49:21] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 449/449 places, 435/435 transitions.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/449 stabilizing places and 108/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 864 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:49:22] [INFO ] Invariant cache hit.
[2023-03-11 05:49:23] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:49:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 27 ms returned sat
[2023-03-11 05:49:23] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-11 05:49:23] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:49:23] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-11 05:49:23] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 0 ms to minimize.
[2023-03-11 05:49:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2023-03-11 05:49:24] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 1 ms to minimize.
[2023-03-11 05:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-11 05:49:24] [INFO ] After 875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-11 05:49:24] [INFO ] After 1129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 435 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=145 )
Parikh walk visited 3 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 15 factoid took 1376 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 345 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33312 reset in 319 ms.
Product exploration explored 100000 steps with 33147 reset in 289 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 449 transition count 435
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 150 place count 449 transition count 429
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 150 place count 449 transition count 429
Deduced a syphon composed of 203 places in 1 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 209 place count 449 transition count 429
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 325 place count 333 transition count 313
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 116 rules applied. Total rules applied 441 place count 333 transition count 313
Performed 104 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 191 places in 0 ms
Iterating global reduction 2 with 104 rules applied. Total rules applied 545 place count 333 transition count 302
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 611 place count 267 transition count 236
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 677 place count 267 transition count 236
Deduced a syphon composed of 125 places in 0 ms
Applied a total of 677 rules in 132 ms. Remains 267 /449 variables (removed 182) and now considering 236/435 (removed 199) transitions.
[2023-03-11 05:49:27] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 236 rows 267 cols
[2023-03-11 05:49:27] [INFO ] Computed 40 place invariants in 21 ms
[2023-03-11 05:49:28] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 267/449 places, 236/435 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 508 ms. Remains : 267/449 places, 236/435 transitions.
Built C files in :
/tmp/ltsmin12938526620669223232
[2023-03-11 05:49:28] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12938526620669223232
Running compilation step : cd /tmp/ltsmin12938526620669223232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 687 ms.
Running link step : cd /tmp/ltsmin12938526620669223232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin12938526620669223232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12987976367006862286.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Applied a total of 0 rules in 18 ms. Remains 449 /449 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 449 cols
[2023-03-11 05:49:43] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-11 05:49:43] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-11 05:49:43] [INFO ] Invariant cache hit.
[2023-03-11 05:49:43] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-11 05:49:43] [INFO ] Invariant cache hit.
[2023-03-11 05:49:44] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 449/449 places, 435/435 transitions.
Built C files in :
/tmp/ltsmin11791113302070245288
[2023-03-11 05:49:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11791113302070245288
Running compilation step : cd /tmp/ltsmin11791113302070245288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin11791113302070245288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin11791113302070245288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18181842063589617433.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 05:49:59] [INFO ] Flatten gal took : 20 ms
[2023-03-11 05:49:59] [INFO ] Flatten gal took : 25 ms
[2023-03-11 05:49:59] [INFO ] Time to serialize gal into /tmp/LTL9422912794189241682.gal : 4 ms
[2023-03-11 05:49:59] [INFO ] Time to serialize properties into /tmp/LTL3814638352232117073.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9422912794189241682.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14185041682070663213.hoa' '-atoms' '/tmp/LTL3814638352232117073.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3814638352232117073.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14185041682070663213.hoa
Detected timeout of ITS tools.
[2023-03-11 05:50:14] [INFO ] Flatten gal took : 14 ms
[2023-03-11 05:50:14] [INFO ] Flatten gal took : 14 ms
[2023-03-11 05:50:14] [INFO ] Time to serialize gal into /tmp/LTL5525019200073987305.gal : 3 ms
[2023-03-11 05:50:14] [INFO ] Time to serialize properties into /tmp/LTL1004356424962185959.ltl : 8 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5525019200073987305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1004356424962185959.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(p64==1)"))U(X(G((F("((p518==0)||(p479==1))"))&&("((p88==0)||(p562==1))"))))))
Formula 0 simplified : G!"(p64==1)" R XF(!"((p88==0)||(p562==1))" | G!"((p518==0)||(p479==1))")
Detected timeout of ITS tools.
[2023-03-11 05:50:29] [INFO ] Flatten gal took : 39 ms
[2023-03-11 05:50:29] [INFO ] Applying decomposition
[2023-03-11 05:50:29] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1865305815678252958.txt' '-o' '/tmp/graph1865305815678252958.bin' '-w' '/tmp/graph1865305815678252958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1865305815678252958.bin' '-l' '-1' '-v' '-w' '/tmp/graph1865305815678252958.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:50:29] [INFO ] Decomposing Gal with order
[2023-03-11 05:50:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:50:29] [INFO ] Removed a total of 87 redundant transitions.
[2023-03-11 05:50:30] [INFO ] Flatten gal took : 67 ms
[2023-03-11 05:50:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2023-03-11 05:50:30] [INFO ] Time to serialize gal into /tmp/LTL9768118367281236350.gal : 5 ms
[2023-03-11 05:50:30] [INFO ] Time to serialize properties into /tmp/LTL14409181669204184817.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9768118367281236350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14409181669204184817.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i20.u21.p64==1)"))U(X(G((F("((i25.i0.i0.u159.p518==0)||(i19.u149.p479==1))"))&&("((i5.u28.p88==0)||(i27.u184.p562==1))"))))))
Formula 0 simplified : G!"(i20.u21.p64==1)" R XF(!"((i5.u28.p88==0)||(i27.u184.p562==1))" | G!"((i25.i0.i0.u159.p518==0)||(i19.u149.p479==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11322654744445489544
[2023-03-11 05:50:45] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11322654744445489544
Running compilation step : cd /tmp/ltsmin11322654744445489544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 646 ms.
Running link step : cd /tmp/ltsmin11322654744445489544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin11322654744445489544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U X([]((<>((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-06b-LTLCardinality-00 finished in 106294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 455 transition count 443
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 455 transition count 443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 455 transition count 441
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 450 transition count 436
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 448 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 448 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 447 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 447 transition count 433
Applied a total of 44 rules in 57 ms. Remains 447 /468 variables (removed 21) and now considering 433/456 (removed 23) transitions.
// Phase 1: matrix 433 rows 447 cols
[2023-03-11 05:51:00] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-11 05:51:00] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-11 05:51:00] [INFO ] Invariant cache hit.
[2023-03-11 05:51:00] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-11 05:51:00] [INFO ] Invariant cache hit.
[2023-03-11 05:51:01] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/468 places, 433/456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 789 ms. Remains : 447/468 places, 433/456 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s113 0) (NEQ s389 1)), p0:(OR (EQ s174 0) (EQ s214 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 472 reset in 228 ms.
Product exploration explored 100000 steps with 477 reset in 258 ms.
Computed a total of 109 stabilizing places and 109 stable transitions
Computed a total of 109 stabilizing places and 109 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:51:02] [INFO ] Invariant cache hit.
[2023-03-11 05:51:02] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:51:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-11 05:51:02] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 05:51:02] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:51:02] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2023-03-11 05:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-11 05:51:02] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-11 05:51:02] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 417 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 433/433 transitions.
Applied a total of 0 rules in 18 ms. Remains 447 /447 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-03-11 05:51:03] [INFO ] Invariant cache hit.
[2023-03-11 05:51:04] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-11 05:51:04] [INFO ] Invariant cache hit.
[2023-03-11 05:51:04] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-11 05:51:04] [INFO ] Invariant cache hit.
[2023-03-11 05:51:04] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1024 ms. Remains : 447/447 places, 433/433 transitions.
Computed a total of 109 stabilizing places and 109 stable transitions
Computed a total of 109 stabilizing places and 109 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:51:05] [INFO ] Invariant cache hit.
[2023-03-11 05:51:05] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:51:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-11 05:51:05] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 05:51:05] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:51:05] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2023-03-11 05:51:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-11 05:51:06] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 05:51:06] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 382 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 479 reset in 218 ms.
Product exploration explored 100000 steps with 473 reset in 175 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 447/447 places, 433/433 transitions.
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 447 transition count 433
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 11 rules applied. Total rules applied 148 place count 447 transition count 427
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 148 place count 447 transition count 427
Deduced a syphon composed of 203 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 209 place count 447 transition count 427
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 325 place count 331 transition count 311
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 116 rules applied. Total rules applied 441 place count 331 transition count 311
Performed 105 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 192 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 546 place count 331 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 547 place count 331 transition count 299
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 611 place count 267 transition count 235
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 3 with 64 rules applied. Total rules applied 675 place count 267 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 676 place count 267 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 677 place count 266 transition count 234
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 678 place count 266 transition count 234
Deduced a syphon composed of 128 places in 0 ms
Applied a total of 678 rules in 103 ms. Remains 266 /447 variables (removed 181) and now considering 234/433 (removed 199) transitions.
[2023-03-11 05:51:07] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 234 rows 266 cols
[2023-03-11 05:51:07] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-11 05:51:08] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 266/447 places, 234/433 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 266/447 places, 234/433 transitions.
Built C files in :
/tmp/ltsmin11735927977535349148
[2023-03-11 05:51:08] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11735927977535349148
Running compilation step : cd /tmp/ltsmin11735927977535349148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 611 ms.
Running link step : cd /tmp/ltsmin11735927977535349148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin11735927977535349148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4265835574356840744.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 447 /447 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 447 cols
[2023-03-11 05:51:23] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-11 05:51:23] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-11 05:51:23] [INFO ] Invariant cache hit.
[2023-03-11 05:51:23] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-03-11 05:51:23] [INFO ] Invariant cache hit.
[2023-03-11 05:51:23] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 684 ms. Remains : 447/447 places, 433/433 transitions.
Built C files in :
/tmp/ltsmin12631996348008259461
[2023-03-11 05:51:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12631996348008259461
Running compilation step : cd /tmp/ltsmin12631996348008259461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 583 ms.
Running link step : cd /tmp/ltsmin12631996348008259461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin12631996348008259461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17807510448930685702.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 05:51:39] [INFO ] Flatten gal took : 13 ms
[2023-03-11 05:51:39] [INFO ] Flatten gal took : 12 ms
[2023-03-11 05:51:39] [INFO ] Time to serialize gal into /tmp/LTL8397332559267619964.gal : 3 ms
[2023-03-11 05:51:39] [INFO ] Time to serialize properties into /tmp/LTL11433263284629280202.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8397332559267619964.gal' '-t' 'CGAL' '-hoa' '/tmp/aut424914634868514320.hoa' '-atoms' '/tmp/LTL11433263284629280202.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL11433263284629280202.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut424914634868514320.hoa
Detected timeout of ITS tools.
[2023-03-11 05:51:54] [INFO ] Flatten gal took : 11 ms
[2023-03-11 05:51:54] [INFO ] Flatten gal took : 10 ms
[2023-03-11 05:51:54] [INFO ] Time to serialize gal into /tmp/LTL2519137884247632241.gal : 15 ms
[2023-03-11 05:51:54] [INFO ] Time to serialize properties into /tmp/LTL12640400230387100072.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2519137884247632241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12640400230387100072.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((p270==0)||(p322==1))"))||(X(F("((p168!=0)&&(p513!=1))")))))
Formula 0 simplified : F!"((p270==0)||(p322==1))" & XG!"((p168!=0)&&(p513!=1))"
Detected timeout of ITS tools.
[2023-03-11 05:52:09] [INFO ] Flatten gal took : 34 ms
[2023-03-11 05:52:09] [INFO ] Applying decomposition
[2023-03-11 05:52:09] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1330662162144536875.txt' '-o' '/tmp/graph1330662162144536875.bin' '-w' '/tmp/graph1330662162144536875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1330662162144536875.bin' '-l' '-1' '-v' '-w' '/tmp/graph1330662162144536875.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:52:09] [INFO ] Decomposing Gal with order
[2023-03-11 05:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:52:09] [INFO ] Removed a total of 84 redundant transitions.
[2023-03-11 05:52:09] [INFO ] Flatten gal took : 30 ms
[2023-03-11 05:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-11 05:52:09] [INFO ] Time to serialize gal into /tmp/LTL13266905396704977710.gal : 5 ms
[2023-03-11 05:52:09] [INFO ] Time to serialize properties into /tmp/LTL17119962810507536367.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13266905396704977710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17119962810507536367.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G("((i14.u72.p270==0)||(i0.u89.p322==1))"))||(X(F("((i9.u46.p168!=0)&&(i25.i0.i1.u161.p513!=1))")))))
Formula 0 simplified : F!"((i14.u72.p270==0)||(i0.u89.p322==1))" & XG!"((i9.u46.p168!=0)&&(i25.i0.i1.u161.p513!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16129819793116363021
[2023-03-11 05:52:24] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16129819793116363021
Running compilation step : cd /tmp/ltsmin16129819793116363021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 625 ms.
Running link step : cd /tmp/ltsmin16129819793116363021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16129819793116363021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-06b-LTLCardinality-01 finished in 99397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 467 transition count 293
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 182 rules applied. Total rules applied 344 place count 305 transition count 273
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 356 place count 293 transition count 273
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 356 place count 293 transition count 215
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 472 place count 235 transition count 215
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 478 place count 229 transition count 209
Iterating global reduction 3 with 6 rules applied. Total rules applied 484 place count 229 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 484 place count 229 transition count 205
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 492 place count 225 transition count 205
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 660 place count 141 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 661 place count 140 transition count 109
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 14 rules applied. Total rules applied 675 place count 130 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 679 place count 126 transition count 105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 679 place count 126 transition count 100
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 689 place count 121 transition count 100
Applied a total of 689 rules in 43 ms. Remains 121 /468 variables (removed 347) and now considering 100/456 (removed 356) transitions.
// Phase 1: matrix 100 rows 121 cols
[2023-03-11 05:52:39] [INFO ] Computed 30 place invariants in 0 ms
[2023-03-11 05:52:39] [INFO ] Implicit Places using invariants in 82 ms returned [52, 72, 92, 98, 102, 106, 111, 115, 120]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 85 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/468 places, 100/456 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 92
Applied a total of 16 rules in 10 ms. Remains 104 /112 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 104 cols
[2023-03-11 05:52:39] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-11 05:52:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 05:52:39] [INFO ] Invariant cache hit.
[2023-03-11 05:52:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:52:39] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/468 places, 92/456 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 312 ms. Remains : 104/468 places, 92/456 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1), p1:(AND (OR (EQ s9 0) (EQ s90 1)) (OR (EQ s33 0) (EQ s5 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3421 reset in 209 ms.
Stack based approach found an accepted trace after 3248 steps with 110 reset with depth 10 and stack size 10 in 9 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-02 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&G(p1)))) U (!p0&&F(!p2))))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 164 place count 467 transition count 291
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 185 rules applied. Total rules applied 349 place count 303 transition count 270
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 361 place count 291 transition count 270
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 361 place count 291 transition count 212
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 477 place count 233 transition count 212
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 484 place count 226 transition count 205
Iterating global reduction 3 with 7 rules applied. Total rules applied 491 place count 226 transition count 205
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 491 place count 226 transition count 201
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 499 place count 222 transition count 201
Performed 79 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 657 place count 143 transition count 112
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 658 place count 143 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 660 place count 142 transition count 110
Applied a total of 660 rules in 24 ms. Remains 142 /468 variables (removed 326) and now considering 110/456 (removed 346) transitions.
// Phase 1: matrix 110 rows 142 cols
[2023-03-11 05:52:40] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-11 05:52:40] [INFO ] Implicit Places using invariants in 161 ms returned [50, 51, 52, 53, 54, 57, 58, 59, 60, 61, 116, 122, 128, 134, 141]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 163 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/468 places, 110/456 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 127 transition count 100
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 117 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 114 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 114 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 109 transition count 92
Applied a total of 36 rules in 9 ms. Remains 109 /127 variables (removed 18) and now considering 92/110 (removed 18) transitions.
// Phase 1: matrix 92 rows 109 cols
[2023-03-11 05:52:40] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-11 05:52:40] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-11 05:52:40] [INFO ] Invariant cache hit.
[2023-03-11 05:52:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 05:52:40] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/468 places, 92/456 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 532 ms. Remains : 109/468 places, 92/456 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR p0 p2), (OR (NOT p1) (NOT p0)), p2, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s39 1), p2:(OR (EQ s53 0) (EQ s67 1)), p1:(OR (EQ s0 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 9042 reset in 214 ms.
Stack based approach found an accepted trace after 5106 steps with 469 reset with depth 19 and stack size 19 in 19 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-11 finished in 1034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 455 transition count 443
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 455 transition count 443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 455 transition count 441
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 451 transition count 437
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 451 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 450 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 449 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 449 transition count 435
Applied a total of 40 rules in 44 ms. Remains 449 /468 variables (removed 19) and now considering 435/456 (removed 21) transitions.
// Phase 1: matrix 435 rows 449 cols
[2023-03-11 05:52:41] [INFO ] Computed 40 place invariants in 4 ms
[2023-03-11 05:52:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-11 05:52:41] [INFO ] Invariant cache hit.
[2023-03-11 05:52:41] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-11 05:52:41] [INFO ] Invariant cache hit.
[2023-03-11 05:52:42] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/468 places, 435/456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 775 ms. Remains : 449/468 places, 435/456 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s208 0) (NEQ s102 1)), p0:(OR (EQ s108 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-12 finished in 930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G((p1&&F(p2)))||G(p0))))))'
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 467 transition count 295
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 181 rules applied. Total rules applied 341 place count 307 transition count 274
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 354 place count 295 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 294 transition count 273
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 355 place count 294 transition count 215
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 471 place count 236 transition count 215
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 478 place count 229 transition count 208
Iterating global reduction 4 with 7 rules applied. Total rules applied 485 place count 229 transition count 208
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 485 place count 229 transition count 203
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 495 place count 224 transition count 203
Performed 83 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 661 place count 141 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 662 place count 140 transition count 108
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 669 place count 135 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 671 place count 133 transition count 106
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 671 place count 133 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 677 place count 130 transition count 103
Applied a total of 677 rules in 49 ms. Remains 130 /468 variables (removed 338) and now considering 103/456 (removed 353) transitions.
// Phase 1: matrix 103 rows 130 cols
[2023-03-11 05:52:42] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-11 05:52:42] [INFO ] Implicit Places using invariants in 86 ms returned [103, 109, 115, 120, 124, 129]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 87 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/468 places, 103/456 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 99
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 117 transition count 96
Applied a total of 14 rules in 29 ms. Remains 117 /124 variables (removed 7) and now considering 96/103 (removed 7) transitions.
// Phase 1: matrix 96 rows 117 cols
[2023-03-11 05:52:42] [INFO ] Computed 29 place invariants in 0 ms
[2023-03-11 05:52:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 05:52:42] [INFO ] Invariant cache hit.
[2023-03-11 05:52:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-11 05:52:42] [INFO ] Implicit Places using invariants and state equation in 237 ms returned [46, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 302 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/468 places, 96/456 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 115 transition count 94
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 94
Applied a total of 4 rules in 5 ms. Remains 113 /115 variables (removed 2) and now considering 94/96 (removed 2) transitions.
// Phase 1: matrix 94 rows 113 cols
[2023-03-11 05:52:42] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-11 05:52:42] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-11 05:52:42] [INFO ] Invariant cache hit.
[2023-03-11 05:52:42] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 05:52:43] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 113/468 places, 94/456 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 771 ms. Remains : 113/468 places, 94/456 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s70 0) (NEQ s91 1)), p1:(NEQ s48 1), p2:(NEQ s92 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 782 steps with 35 reset in 5 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-14 finished in 1043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 467 transition count 293
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 183 rules applied. Total rules applied 345 place count 305 transition count 272
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 357 place count 293 transition count 272
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 357 place count 293 transition count 214
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 473 place count 235 transition count 214
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 482 place count 226 transition count 205
Iterating global reduction 3 with 9 rules applied. Total rules applied 491 place count 226 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 491 place count 226 transition count 200
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 501 place count 221 transition count 200
Performed 83 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 667 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 668 place count 137 transition count 105
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 14 rules applied. Total rules applied 682 place count 127 transition count 101
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 686 place count 123 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 686 place count 123 transition count 95
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 698 place count 117 transition count 95
Applied a total of 698 rules in 50 ms. Remains 117 /468 variables (removed 351) and now considering 95/456 (removed 361) transitions.
// Phase 1: matrix 95 rows 117 cols
[2023-03-11 05:52:43] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-11 05:52:43] [INFO ] Implicit Places using invariants in 83 ms returned [46, 66, 86, 91, 101, 106, 110, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 86 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/468 places, 95/456 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 103 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 103 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 96 transition count 82
Applied a total of 26 rules in 11 ms. Remains 96 /109 variables (removed 13) and now considering 82/95 (removed 13) transitions.
// Phase 1: matrix 82 rows 96 cols
[2023-03-11 05:52:43] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-11 05:52:43] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-11 05:52:43] [INFO ] Invariant cache hit.
[2023-03-11 05:52:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:52:43] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/468 places, 82/456 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 322 ms. Remains : 96/468 places, 82/456 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s43 0), p1:(OR (EQ s91 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-15 finished in 623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((p1&&F(p2))))))'
Found a Lengthening insensitive property : AutoFlight-PT-06b-LTLCardinality-00
Stuttering acceptance computed with spot in 382 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 467 transition count 297
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 178 rules applied. Total rules applied 336 place count 309 transition count 277
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 350 place count 297 transition count 275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 352 place count 295 transition count 275
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 352 place count 295 transition count 218
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 466 place count 238 transition count 218
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 471 place count 233 transition count 213
Iterating global reduction 4 with 5 rules applied. Total rules applied 476 place count 233 transition count 213
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 476 place count 233 transition count 210
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 482 place count 230 transition count 210
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 654 place count 144 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 655 place count 144 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 656 place count 143 transition count 112
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 14 rules applied. Total rules applied 670 place count 133 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 674 place count 129 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 674 place count 129 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 686 place count 123 transition count 102
Applied a total of 686 rules in 70 ms. Remains 123 /468 variables (removed 345) and now considering 102/456 (removed 354) transitions.
// Phase 1: matrix 102 rows 123 cols
[2023-03-11 05:52:44] [INFO ] Computed 30 place invariants in 0 ms
[2023-03-11 05:52:44] [INFO ] Implicit Places using invariants in 125 ms returned [50, 70, 97, 107, 112, 122]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 140 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/468 places, 102/456 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 109 transition count 94
Applied a total of 16 rules in 4 ms. Remains 109 /117 variables (removed 8) and now considering 94/102 (removed 8) transitions.
// Phase 1: matrix 94 rows 109 cols
[2023-03-11 05:52:44] [INFO ] Computed 24 place invariants in 0 ms
[2023-03-11 05:52:44] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 05:52:44] [INFO ] Invariant cache hit.
[2023-03-11 05:52:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:52:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 109/468 places, 94/456 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 421 ms. Remains : 109/468 places, 94/456 transitions.
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s7 1), p1:(OR (EQ s13 0) (EQ s107 1)), p2:(OR (EQ s98 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6730 steps with 1973 reset in 15 ms.
Treatment of property AutoFlight-PT-06b-LTLCardinality-00 finished in 974 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : AutoFlight-PT-06b-LTLCardinality-01
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 467 transition count 294
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 181 rules applied. Total rules applied 342 place count 306 transition count 274
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 354 place count 295 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 294 transition count 273
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 355 place count 294 transition count 215
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 471 place count 236 transition count 215
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 480 place count 227 transition count 206
Iterating global reduction 4 with 9 rules applied. Total rules applied 489 place count 227 transition count 206
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 489 place count 227 transition count 201
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 499 place count 222 transition count 201
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 667 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 668 place count 137 transition count 105
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 14 rules applied. Total rules applied 682 place count 127 transition count 101
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 686 place count 123 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 686 place count 123 transition count 95
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 698 place count 117 transition count 95
Applied a total of 698 rules in 44 ms. Remains 117 /468 variables (removed 351) and now considering 95/456 (removed 361) transitions.
// Phase 1: matrix 95 rows 117 cols
[2023-03-11 05:52:45] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-11 05:52:45] [INFO ] Implicit Places using invariants in 73 ms returned [47, 67, 87, 92, 102, 107, 111, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 74 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 109/468 places, 95/456 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 103 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 103 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 97 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 97 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 95 transition count 81
Applied a total of 28 rules in 9 ms. Remains 95 /109 variables (removed 14) and now considering 81/95 (removed 14) transitions.
// Phase 1: matrix 81 rows 95 cols
[2023-03-11 05:52:45] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-11 05:52:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 05:52:45] [INFO ] Invariant cache hit.
[2023-03-11 05:52:45] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 95/468 places, 81/456 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 339 ms. Remains : 95/468 places, 81/456 transitions.
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s25 0) (NEQ s86 1)), p0:(OR (EQ s44 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 447 steps with 26 reset in 1 ms.
Treatment of property AutoFlight-PT-06b-LTLCardinality-01 finished in 533 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-11 05:52:45] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12894269351070102974
[2023-03-11 05:52:45] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2023-03-11 05:52:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:45] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2023-03-11 05:52:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:45] [INFO ] Applying decomposition
[2023-03-11 05:52:45] [INFO ] Flatten gal took : 20 ms
[2023-03-11 05:52:45] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8466087259871751753.txt' '-o' '/tmp/graph8466087259871751753.bin' '-w' '/tmp/graph8466087259871751753.weights'
[2023-03-11 05:52:45] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:45] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12894269351070102974
Running compilation step : cd /tmp/ltsmin12894269351070102974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8466087259871751753.bin' '-l' '-1' '-v' '-w' '/tmp/graph8466087259871751753.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:52:45] [INFO ] Decomposing Gal with order
[2023-03-11 05:52:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:52:45] [INFO ] Removed a total of 80 redundant transitions.
[2023-03-11 05:52:45] [INFO ] Flatten gal took : 25 ms
[2023-03-11 05:52:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2023-03-11 05:52:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality7139925803344954945.gal : 5 ms
[2023-03-11 05:52:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality11857617242885201485.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7139925803344954945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11857617242885201485.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("((i1.u77.p270==0)||(i16.u95.p322==1))"))||(X(F("((i9.u50.p168!=0)&&(i24.u173.p513!=1))")))))
Formula 0 simplified : F!"((i1.u77.p270==0)||(i16.u95.p322==1))" & XG!"((i9.u50.p168!=0)&&(i24.u173.p513!=1))"
Compilation finished in 877 ms.
Running link step : cd /tmp/ltsmin12894269351070102974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin12894269351070102974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp3==true))||X(<>((LTLAPp4==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t149, t152, t162, t191, t194, t225, t301, t330, t440, t441, t442, t443, t444, t446, t447, i0....1132
Computing Next relation with stutter on 1920 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.044: LTL layer: formula: ([]((LTLAPp3==true))||X(<>((LTLAPp4==true))))
pins2lts-mc-linux64( 6/ 8), 0.044: "([]((LTLAPp3==true))||X(<>((LTLAPp4==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.045: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.087: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.258: DFS-FIFO for weak LTL, using special progress label 462
pins2lts-mc-linux64( 0/ 8), 0.258: There are 463 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.258: State length is 469, there are 461 groups
pins2lts-mc-linux64( 0/ 8), 0.258: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.258: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.258: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.258: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.288: ~1 levels ~960 states ~4400 transitions
pins2lts-mc-linux64( 4/ 8), 0.337: ~1 levels ~1920 states ~10480 transitions
pins2lts-mc-linux64( 4/ 8), 0.386: ~1 levels ~3840 states ~22352 transitions
pins2lts-mc-linux64( 0/ 8), 0.539: ~1 levels ~7680 states ~57632 transitions
pins2lts-mc-linux64( 0/ 8), 0.753: ~1 levels ~15360 states ~125144 transitions
pins2lts-mc-linux64( 7/ 8), 1.151: ~1 levels ~30720 states ~238456 transitions
pins2lts-mc-linux64( 0/ 8), 1.944: ~1 levels ~61440 states ~550552 transitions
pins2lts-mc-linux64( 3/ 8), 3.256: ~1 levels ~122880 states ~1018680 transitions
pins2lts-mc-linux64( 3/ 8), 5.651: ~1 levels ~245760 states ~2107640 transitions
pins2lts-mc-linux64( 3/ 8), 9.982: ~1 levels ~491520 states ~4365944 transitions
pins2lts-mc-linux64( 3/ 8), 17.992: ~1 levels ~983040 states ~9183392 transitions
pins2lts-mc-linux64( 3/ 8), 33.639: ~1 levels ~1966080 states ~18734872 transitions
pins2lts-mc-linux64( 3/ 8), 66.973: ~1 levels ~3932160 states ~39741696 transitions
pins2lts-mc-linux64( 3/ 8), 132.816: ~1 levels ~7864320 states ~79100040 transitions
pins2lts-mc-linux64( 3/ 8), 271.064: ~1 levels ~15728640 states ~167603128 transitions
pins2lts-mc-linux64( 3/ 8), 548.691: ~1 levels ~31457280 states ~345347104 transitions
pins2lts-mc-linux64( 1/ 8), 1131.591: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1131.610:
pins2lts-mc-linux64( 0/ 8), 1131.610: mean standard work distribution: 7.8% (states) 3.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1131.610:
pins2lts-mc-linux64( 0/ 8), 1131.610: Explored 57576404 states 742273129 transitions, fanout: 12.892
pins2lts-mc-linux64( 0/ 8), 1131.610: Total exploration time 1131.350 sec (1131.290 sec minimum, 1131.319 sec on average)
pins2lts-mc-linux64( 0/ 8), 1131.610: States per second: 50892, Transitions per second: 656095
pins2lts-mc-linux64( 0/ 8), 1131.610:
pins2lts-mc-linux64( 0/ 8), 1131.610: Progress states detected: 113740073
pins2lts-mc-linux64( 0/ 8), 1131.610: Redundant explorations: -49.3790
pins2lts-mc-linux64( 0/ 8), 1131.610:
pins2lts-mc-linux64( 0/ 8), 1131.610: Queue width: 8B, total height: 90977545, memory: 694.10MB
pins2lts-mc-linux64( 0/ 8), 1131.610: Tree memory: 1123.8MB, 10.4 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1131.610: Tree fill ratio (roots/leafs): 84.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1131.610: Stored 647 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1131.610: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1131.610: Est. total memory use: 1817.9MB (~1718.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12894269351070102974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp3==true))||X(<>((LTLAPp4==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12894269351070102974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp3==true))||X(<>((LTLAPp4==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-11 06:13:57] [INFO ] Applying decomposition
[2023-03-11 06:13:57] [INFO ] Flatten gal took : 12 ms
[2023-03-11 06:13:58] [INFO ] Decomposing Gal with order
[2023-03-11 06:13:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:13:58] [INFO ] Removed a total of 14 redundant transitions.
[2023-03-11 06:13:58] [INFO ] Flatten gal took : 26 ms
[2023-03-11 06:13:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 21 ms.
[2023-03-11 06:13:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality3348448672186395254.gal : 5 ms
[2023-03-11 06:13:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality7960080925332922309.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3348448672186395254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7960080925332922309.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u48.p270==0)||(i0.i0.i0.i0.i0.i0.u54.p322==1))"))||(X(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....234
Formula 0 simplified : F!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u48.p270==0)||(i0.i0.i0.i0.i0.i0.u54.p322==1))" & XG!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...224
Detected timeout of ITS tools.
[2023-03-11 06:35:12] [INFO ] Flatten gal took : 829 ms
[2023-03-11 06:35:13] [INFO ] Input system was already deterministic with 456 transitions.
[2023-03-11 06:35:13] [INFO ] Transformed 468 places.
[2023-03-11 06:35:13] [INFO ] Transformed 456 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
[2023-03-11 06:35:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality2526489079644604801.gal : 6 ms
[2023-03-11 06:35:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality14785374197951097385.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2526489079644604801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14785374197951097385.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((p270==0)||(p322==1))"))||(X(F("((p168!=0)&&(p513!=1))")))))
Formula 0 simplified : F!"((p270==0)||(p322==1))" & XG!"((p168!=0)&&(p513!=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 169244 kB
After kill :
MemTotal: 16393236 kB
MemFree: 15978792 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-06b, 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 r005-oct2-167813593200459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b 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 ;