Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716279979846

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 08:26:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 08:26:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:26:22] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-21 08:26:22] [INFO ] Transformed 574 places.
[2024-05-21 08:26:22] [INFO ] Transformed 572 transitions.
[2024-05-21 08:26:22] [INFO ] Found NUPN structural information;
[2024-05-21 08:26:22] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-03 TRUE 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 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 499 transition count 497
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 499 transition count 497
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 162 place count 499 transition count 485
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 193 place count 468 transition count 454
Iterating global reduction 1 with 31 rules applied. Total rules applied 224 place count 468 transition count 454
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 230 place count 462 transition count 448
Iterating global reduction 1 with 6 rules applied. Total rules applied 236 place count 462 transition count 448
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 242 place count 456 transition count 442
Iterating global reduction 1 with 6 rules applied. Total rules applied 248 place count 456 transition count 442
Applied a total of 248 rules in 217 ms. Remains 456 /574 variables (removed 118) and now considering 442/572 (removed 130) transitions.
// Phase 1: matrix 442 rows 456 cols
[2024-05-21 08:26:23] [INFO ] Computed 40 invariants in 30 ms
[2024-05-21 08:26:23] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-21 08:26:23] [INFO ] Invariant cache hit.
[2024-05-21 08:26:24] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2024-05-21 08:26:24] [INFO ] Invariant cache hit.
[2024-05-21 08:26:24] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 456/574 places, 442/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1715 ms. Remains : 456/574 places, 442/572 transitions.
Support contains 18 out of 456 places after structural reductions.
[2024-05-21 08:26:25] [INFO ] Flatten gal took : 102 ms
[2024-05-21 08:26:25] [INFO ] Flatten gal took : 39 ms
[2024-05-21 08:26:25] [INFO ] Input system was already deterministic with 442 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 08:26:25] [INFO ] Invariant cache hit.
[2024-05-21 08:26:26] [INFO ] [Real]Absence check using 39 positive place invariants in 41 ms returned sat
[2024-05-21 08:26:26] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-21 08:26:26] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 08:26:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 24 ms returned sat
[2024-05-21 08:26:26] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-21 08:26:26] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 08:26:26] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 7 ms to minimize.
[2024-05-21 08:26:27] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2024-05-21 08:26:27] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2024-05-21 08:26:27] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 2 ms to minimize.
[2024-05-21 08:26:27] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2024-05-21 08:26:27] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 1 ms to minimize.
[2024-05-21 08:26:27] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2024-05-21 08:26:28] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 1 ms to minimize.
[2024-05-21 08:26:28] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 1 ms to minimize.
[2024-05-21 08:26:28] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 1 ms to minimize.
[2024-05-21 08:26:28] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 1 ms to minimize.
[2024-05-21 08:26:28] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 1 ms to minimize.
[2024-05-21 08:26:28] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 1 ms to minimize.
[2024-05-21 08:26:29] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 1 ms to minimize.
[2024-05-21 08:26:29] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 1 ms to minimize.
[2024-05-21 08:26:29] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2565 ms
[2024-05-21 08:26:29] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 1 ms to minimize.
[2024-05-21 08:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-05-21 08:26:29] [INFO ] After 3197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-21 08:26:29] [INFO ] After 3504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 45 ms.
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 442/442 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 456 transition count 283
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 297 transition count 264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 349 place count 285 transition count 264
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 349 place count 285 transition count 207
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 463 place count 228 transition count 207
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 466 place count 225 transition count 204
Iterating global reduction 3 with 3 rules applied. Total rules applied 469 place count 225 transition count 204
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 469 place count 225 transition count 202
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 473 place count 223 transition count 202
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 641 place count 139 transition count 107
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 665 place count 139 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 689 place count 115 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 690 place count 114 transition count 82
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 724 place count 97 transition count 65
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 741 place count 80 transition count 65
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 741 place count 80 transition count 53
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 765 place count 68 transition count 53
Applied a total of 765 rules in 98 ms. Remains 68 /456 variables (removed 388) and now considering 53/442 (removed 389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 68/456 places, 53/442 transitions.
Finished random walk after 94 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 115 stabilizing places and 115 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((p1&&F(p2))))))'
Support contains 5 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 451 transition count 437
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 451 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 449 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 449 transition count 435
Applied a total of 14 rules in 78 ms. Remains 449 /456 variables (removed 7) and now considering 435/442 (removed 7) transitions.
// Phase 1: matrix 435 rows 449 cols
[2024-05-21 08:26:30] [INFO ] Computed 40 invariants in 5 ms
[2024-05-21 08:26:30] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 08:26:30] [INFO ] Invariant cache hit.
[2024-05-21 08:26:30] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-21 08:26:30] [INFO ] Invariant cache hit.
[2024-05-21 08:26:31] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/456 places, 435/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1061 ms. Remains : 449/456 places, 435/442 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 383 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 33350 reset in 454 ms.
Product exploration explored 100000 steps with 33315 reset in 399 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 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 274 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 208 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 293 ms. (steps per millisecond=34 ) properties (out of 7) seen :4
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
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 08:26:33] [INFO ] Invariant cache hit.
[2024-05-21 08:26:33] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 08:26:33] [INFO ] [Nat]Absence check using 39 positive place invariants in 22 ms returned sat
[2024-05-21 08:26:33] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 08:26:33] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 08:26:34] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2024-05-21 08:26:34] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2024-05-21 08:26:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
[2024-05-21 08:26:34] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 6 ms to minimize.
[2024-05-21 08:26:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2024-05-21 08:26:34] [INFO ] After 975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-21 08:26:34] [INFO ] After 1208ms 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 24 ms.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 435/435 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 449 transition count 277
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 176 rules applied. Total rules applied 334 place count 291 transition count 259
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 346 place count 279 transition count 259
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 346 place count 279 transition count 205
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 454 place count 225 transition count 205
Performed 87 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 628 place count 138 transition count 107
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 629 place count 138 transition count 106
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 653 place count 138 transition count 82
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 677 place count 114 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 678 place count 113 transition count 81
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 4 with 70 rules applied. Total rules applied 748 place count 85 transition count 39
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 790 place count 43 transition count 39
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 790 place count 43 transition count 27
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 814 place count 31 transition count 27
Applied a total of 814 rules in 56 ms. Remains 31 /449 variables (removed 418) and now considering 27/435 (removed 408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 31/449 places, 27/435 transitions.
Finished random walk after 116 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=116 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (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 p2) (NOT p0))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 15 factoid took 789 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 201 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 203 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 10 ms. Remains 449 /449 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2024-05-21 08:26:35] [INFO ] Invariant cache hit.
[2024-05-21 08:26:36] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 08:26:36] [INFO ] Invariant cache hit.
[2024-05-21 08:26:36] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-21 08:26:36] [INFO ] Invariant cache hit.
[2024-05-21 08:26:36] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 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 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 265 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 200 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 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-21 08:26:37] [INFO ] Invariant cache hit.
[2024-05-21 08:26:37] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2024-05-21 08:26:37] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-21 08:26:37] [INFO ] After 221ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 08:26:38] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 1 ms to minimize.
[2024-05-21 08:26:38] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 1 ms to minimize.
[2024-05-21 08:26:38] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 0 ms to minimize.
[2024-05-21 08:26:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 554 ms
[2024-05-21 08:26:38] [INFO ] After 797ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:26:38] [INFO ] After 930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:26:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2024-05-21 08:26:38] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 08:26:38] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 08:26:39] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 1 ms to minimize.
[2024-05-21 08:26:39] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 1 ms to minimize.
[2024-05-21 08:26:39] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 1 ms to minimize.
[2024-05-21 08:26:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 502 ms
[2024-05-21 08:26:39] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-21 08:26:39] [INFO ] After 953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 258 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (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 p2) (NOT p0))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 15 factoid took 784 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 199 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 196 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 200 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 33253 reset in 307 ms.
Product exploration explored 100000 steps with 33218 reset in 334 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 199 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 0 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 99 ms. Remains 267 /449 variables (removed 182) and now considering 236/435 (removed 199) transitions.
[2024-05-21 08:26:42] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 236 rows 267 cols
[2024-05-21 08:26:42] [INFO ] Computed 40 invariants in 6 ms
[2024-05-21 08:26:42] [INFO ] Dead Transitions using invariants and state equation in 318 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 439 ms. Remains : 267/449 places, 236/435 transitions.
Built C files in :
/tmp/ltsmin5427112669051251286
[2024-05-21 08:26:42] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5427112669051251286
Running compilation step : cd /tmp/ltsmin5427112669051251286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1162 ms.
Running link step : cd /tmp/ltsmin5427112669051251286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5427112669051251286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6272971656596309378.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 10 ms. Remains 449 /449 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 449 cols
[2024-05-21 08:26:57] [INFO ] Computed 40 invariants in 4 ms
[2024-05-21 08:26:57] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 08:26:57] [INFO ] Invariant cache hit.
[2024-05-21 08:26:58] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-21 08:26:58] [INFO ] Invariant cache hit.
[2024-05-21 08:26:58] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1005 ms. Remains : 449/449 places, 435/435 transitions.
Built C files in :
/tmp/ltsmin15217015745757887884
[2024-05-21 08:26:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15217015745757887884
Running compilation step : cd /tmp/ltsmin15217015745757887884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1001 ms.
Running link step : cd /tmp/ltsmin15217015745757887884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15217015745757887884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11903431733868286846.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 08:27:13] [INFO ] Flatten gal took : 30 ms
[2024-05-21 08:27:13] [INFO ] Flatten gal took : 30 ms
[2024-05-21 08:27:13] [INFO ] Time to serialize gal into /tmp/LTL716062495523299670.gal : 23 ms
[2024-05-21 08:27:13] [INFO ] Time to serialize properties into /tmp/LTL10757605029745984367.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL716062495523299670.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13640462017024663771.hoa' '-atoms' '/tmp/LTL10757605029745984367.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10757605029745984367.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13640462017024663771.hoa
Detected timeout of ITS tools.
[2024-05-21 08:27:28] [INFO ] Flatten gal took : 26 ms
[2024-05-21 08:27:28] [INFO ] Flatten gal took : 22 ms
[2024-05-21 08:27:29] [INFO ] Time to serialize gal into /tmp/LTL15138159718098076238.gal : 5 ms
[2024-05-21 08:27:29] [INFO ] Time to serialize properties into /tmp/LTL3920888748445974267.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15138159718098076238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3920888748445974267.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((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.
[2024-05-21 08:27:44] [INFO ] Flatten gal took : 21 ms
[2024-05-21 08:27:44] [INFO ] Applying decomposition
[2024-05-21 08:27:44] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6876729441223665303.txt' '-o' '/tmp/graph6876729441223665303.bin' '-w' '/tmp/graph6876729441223665303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6876729441223665303.bin' '-l' '-1' '-v' '-w' '/tmp/graph6876729441223665303.weights' '-q' '0' '-e' '0.001'
[2024-05-21 08:27:44] [INFO ] Decomposing Gal with order
[2024-05-21 08:27:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 08:27:44] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-21 08:27:44] [INFO ] Flatten gal took : 99 ms
[2024-05-21 08:27:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-21 08:27:44] [INFO ] Time to serialize gal into /tmp/LTL6349214564257743113.gal : 14 ms
[2024-05-21 08:27:44] [INFO ] Time to serialize properties into /tmp/LTL17763206737141839932.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6349214564257743113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17763206737141839932.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i6.u23.p64==1)"))U(X(G((F("((i25.u160.p518==0)||(i23.u147.p479==1))"))&&("((i4.u29.p88==0)||(i27.u181.p562==1))"))))))
Formula 0 simplified : G!"(i6.u23.p64==1)" R XF(!"((i4.u29.p88==0)||(i27.u181.p562==1))" | G!"((i25.u160.p518==0)||(i23.u147.p479==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7625080008165396930
[2024-05-21 08:27:59] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7625080008165396930
Running compilation step : cd /tmp/ltsmin7625080008165396930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 990 ms.
Running link step : cd /tmp/ltsmin7625080008165396930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7625080008165396930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) 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 104610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 450 transition count 436
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 447 transition count 433
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 447 transition count 433
Applied a total of 18 rules in 35 ms. Remains 447 /456 variables (removed 9) and now considering 433/442 (removed 9) transitions.
// Phase 1: matrix 433 rows 447 cols
[2024-05-21 08:28:14] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 08:28:14] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 08:28:14] [INFO ] Invariant cache hit.
[2024-05-21 08:28:15] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2024-05-21 08:28:15] [INFO ] Invariant cache hit.
[2024-05-21 08:28:15] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/456 places, 433/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1091 ms. Remains : 447/456 places, 433/442 transitions.
Stuttering acceptance computed with spot in 119 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 474 reset in 233 ms.
Product exploration explored 100000 steps with 473 reset in 332 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 08:28:17] [INFO ] Invariant cache hit.
[2024-05-21 08:28:17] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 08:28:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 19 ms returned sat
[2024-05-21 08:28:17] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 08:28:17] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 08:28:17] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-21 08:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-21 08:28:17] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-21 08:28:17] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 5 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 433/433 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 447 transition count 281
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 170 rules applied. Total rules applied 322 place count 295 transition count 263
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 335 place count 283 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 336 place count 282 transition count 262
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 336 place count 282 transition count 206
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 448 place count 226 transition count 206
Performed 88 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 624 place count 138 transition count 106
Free-agglomeration rule applied 23 times.
Iterating global reduction 4 with 23 rules applied. Total rules applied 647 place count 138 transition count 83
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 670 place count 115 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 671 place count 114 transition count 82
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 5 with 72 rules applied. Total rules applied 743 place count 87 transition count 37
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 788 place count 42 transition count 37
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 788 place count 42 transition count 26
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 810 place count 31 transition count 26
Applied a total of 810 rules in 51 ms. Remains 31 /447 variables (removed 416) and now considering 26/433 (removed 407) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 31/447 places, 26/433 transitions.
Finished random walk after 165 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=165 )
Parikh walk visited 0 properties in 0 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 (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 247 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 446 transition count 281
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 169 rules applied. Total rules applied 320 place count 295 transition count 263
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 333 place count 283 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 334 place count 282 transition count 262
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 334 place count 282 transition count 206
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 446 place count 226 transition count 206
Performed 88 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 622 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 623 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 637 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 641 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 641 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 653 place count 117 transition count 95
Applied a total of 653 rules in 52 ms. Remains 117 /447 variables (removed 330) and now considering 95/433 (removed 338) transitions.
// Phase 1: matrix 95 rows 117 cols
[2024-05-21 08:28:18] [INFO ] Computed 30 invariants in 1 ms
[2024-05-21 08:28:18] [INFO ] Implicit Places using invariants in 102 ms returned [47, 67, 87, 92, 102, 107, 111, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 105 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/447 places, 95/433 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 26 ms. Remains 95 /109 variables (removed 14) and now considering 81/95 (removed 14) transitions.
// Phase 1: matrix 81 rows 95 cols
[2024-05-21 08:28:18] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 08:28:18] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 08:28:18] [INFO ] Invariant cache hit.
[2024-05-21 08:28:18] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/447 places, 81/433 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 95/447 places, 81/433 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 435 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 988 steps, including 34 resets, run visited all 5 properties in 7 ms. (steps per millisecond=141 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 556 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering criterion allowed to conclude after 1663 steps with 105 reset in 5 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-01 finished in 6024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 455 transition count 285
Reduce places removed 156 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 175 rules applied. Total rules applied 331 place count 299 transition count 266
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 343 place count 287 transition count 266
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 343 place count 287 transition count 210
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 455 place count 231 transition count 210
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 459 place count 227 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 463 place count 227 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 463 place count 227 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 469 place count 224 transition count 203
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 641 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 642 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 656 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 660 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 660 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 672 place count 117 transition count 95
Applied a total of 672 rules in 48 ms. Remains 117 /456 variables (removed 339) and now considering 95/442 (removed 347) transitions.
// Phase 1: matrix 95 rows 117 cols
[2024-05-21 08:28:20] [INFO ] Computed 30 invariants in 1 ms
[2024-05-21 08:28:20] [INFO ] Implicit Places using invariants in 129 ms returned [69, 89, 94, 98, 102, 107, 111, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 131 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/456 places, 95/442 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
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 16 place count 101 transition count 87
Applied a total of 16 rules in 11 ms. Remains 101 /109 variables (removed 8) and now considering 87/95 (removed 8) transitions.
// Phase 1: matrix 87 rows 101 cols
[2024-05-21 08:28:20] [INFO ] Computed 22 invariants in 0 ms
[2024-05-21 08:28:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 08:28:20] [INFO ] Invariant cache hit.
[2024-05-21 08:28:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 08:28:21] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/456 places, 87/442 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 439 ms. Remains : 101/456 places, 87/442 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s44 0) (NEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-09 finished in 494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&G(p1)))) U (!p0&&F(!p2))))'
Support contains 5 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 442/442 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 455 transition count 283
Reduce places removed 158 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 177 rules applied. Total rules applied 335 place count 297 transition count 264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 347 place count 285 transition count 264
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 347 place count 285 transition count 207
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 461 place count 228 transition count 207
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 465 place count 224 transition count 203
Iterating global reduction 3 with 4 rules applied. Total rules applied 469 place count 224 transition count 203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 469 place count 224 transition count 201
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 473 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 631 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 632 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 634 place count 142 transition count 110
Applied a total of 634 rules in 77 ms. Remains 142 /456 variables (removed 314) and now considering 110/442 (removed 332) transitions.
// Phase 1: matrix 110 rows 142 cols
[2024-05-21 08:28:21] [INFO ] Computed 40 invariants in 1 ms
[2024-05-21 08:28:21] [INFO ] Implicit Places using invariants in 130 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 133 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/456 places, 110/442 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
[2024-05-21 08:28:21] [INFO ] Computed 25 invariants in 1 ms
[2024-05-21 08:28:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 08:28:21] [INFO ] Invariant cache hit.
[2024-05-21 08:28:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 08:28:21] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/456 places, 92/442 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 488 ms. Remains : 109/456 places, 92/442 transitions.
Stuttering acceptance computed with spot in 182 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 9095 reset in 181 ms.
Stack based approach found an accepted trace after 18857 steps with 1694 reset with depth 5 and stack size 5 in 83 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-11 finished in 957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((p1&&F(p2))))))'
Found a Lengthening insensitive property : AutoFlight-PT-06b-LTLCardinality-00
Stuttering acceptance computed with spot in 197 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 456 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 455 transition count 288
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 171 rules applied. Total rules applied 324 place count 302 transition count 270
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 337 place count 290 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 289 transition count 269
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 338 place count 289 transition count 212
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 452 place count 232 transition count 212
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 455 place count 229 transition count 209
Iterating global reduction 4 with 3 rules applied. Total rules applied 458 place count 229 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 458 place count 229 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 460 place count 228 transition count 208
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 628 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 629 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 630 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 644 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 648 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 648 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 660 place count 123 transition count 102
Applied a total of 660 rules in 45 ms. Remains 123 /456 variables (removed 333) and now considering 102/442 (removed 340) transitions.
// Phase 1: matrix 102 rows 123 cols
[2024-05-21 08:28:22] [INFO ] Computed 30 invariants in 1 ms
[2024-05-21 08:28:22] [INFO ] Implicit Places using invariants in 105 ms returned [50, 70, 97, 107, 112, 122]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 107 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/456 places, 102/442 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 9 ms. Remains 109 /117 variables (removed 8) and now considering 94/102 (removed 8) transitions.
// Phase 1: matrix 94 rows 109 cols
[2024-05-21 08:28:22] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 08:28:22] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 08:28:22] [INFO ] Invariant cache hit.
[2024-05-21 08:28:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 08:28:22] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 109/456 places, 94/442 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 382 ms. Remains : 109/456 places, 94/442 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]]
Product exploration explored 100000 steps with 28321 reset in 339 ms.
Stuttering criterion allowed to conclude after 25112 steps with 7302 reset in 109 ms.
Treatment of property AutoFlight-PT-06b-LTLCardinality-00 finished in 1248 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 08:28:23] [INFO ] Flatten gal took : 18 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 120974 ms.

BK_STOP 1716280104433

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is 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 r043-smll-171620180100092"
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 ;