fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463873000460
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AutonomousCar-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
293.407 20498.00 37682.00 295.80 FFFFFTTFFFTFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463873000460.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873000460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.6K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 72K Jun 3 16:02 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 AutonomousCar-PT-04a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654899025255

Running Version 202205111006
[2022-06-10 22:10:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:10:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:10:27] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2022-06-10 22:10:27] [INFO ] Transformed 49 places.
[2022-06-10 22:10:27] [INFO ] Transformed 193 transitions.
[2022-06-10 22:10:27] [INFO ] Found NUPN structural information;
[2022-06-10 22:10:27] [INFO ] Parsed PT model containing 49 places and 193 transitions in 478 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
FORMULA AutonomousCar-PT-04a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 117
Applied a total of 2 rules in 33 ms. Remains 48 /49 variables (removed 1) and now considering 117/118 (removed 1) transitions.
// Phase 1: matrix 117 rows 48 cols
[2022-06-10 22:10:28] [INFO ] Computed 8 place invariants in 21 ms
[2022-06-10 22:10:28] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 117 rows 48 cols
[2022-06-10 22:10:28] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-10 22:10:28] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-10 22:10:28] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [44, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 582 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/49 places, 117/118 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 46/49 places, 117/118 transitions.
Support contains 30 out of 46 places after structural reductions.
[2022-06-10 22:10:29] [INFO ] Flatten gal took : 63 ms
[2022-06-10 22:10:29] [INFO ] Flatten gal took : 29 ms
[2022-06-10 22:10:29] [INFO ] Input system was already deterministic with 117 transitions.
Support contains 27 out of 46 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 571 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10000 steps, including 113 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 46 cols
[2022-06-10 22:10:29] [INFO ] Computed 6 place invariants in 6 ms
[2022-06-10 22:10:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-10 22:10:29] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-04a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(F(p0) U p0))||X(F(G(p0)))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 46 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 41 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 36 transition count 91
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 36 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 35 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 34 transition count 90
Applied a total of 24 rules in 41 ms. Remains 34 /46 variables (removed 12) and now considering 90/117 (removed 27) transitions.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:30] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 22:10:30] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:30] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-10 22:10:30] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-10 22:10:30] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-06-10 22:10:30] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:30] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-10 22:10:30] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/46 places, 90/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/46 places, 90/117 transitions.
Stuttering acceptance computed with spot in 218 ms :[false]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s23 1) (EQ s30 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 40 reset in 309 ms.
Product exploration explored 100000 steps with 40 reset in 129 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[false]
Finished random walk after 222 steps, including 16 resets, run visited all 1 properties in 4 ms. (steps per millisecond=55 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[false]
Stuttering acceptance computed with spot in 39 ms :[false]
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 90/90 transitions.
Applied a total of 0 rules in 8 ms. Remains 34 /34 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:31] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:31] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:31] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-10 22:10:31] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-10 22:10:31] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2022-06-10 22:10:31] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:31] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-10 22:10:32] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 90/90 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[false]
Finished random walk after 197 steps, including 20 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[false]
Stuttering acceptance computed with spot in 47 ms :[false]
Stuttering acceptance computed with spot in 37 ms :[false]
Product exploration explored 100000 steps with 30 reset in 89 ms.
Product exploration explored 100000 steps with 5 reset in 214 ms.
Built C files in :
/tmp/ltsmin11609440962891709876
[2022-06-10 22:10:32] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2022-06-10 22:10:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:10:32] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2022-06-10 22:10:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:10:32] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2022-06-10 22:10:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:10:32] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11609440962891709876
Running compilation step : cd /tmp/ltsmin11609440962891709876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 502 ms.
Running link step : cd /tmp/ltsmin11609440962891709876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11609440962891709876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13634535625292532114.hoa' '--buchi-type=spotba'
LTSmin run took 249 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04a-LTLFireability-00 finished in 3400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(G(p0)))))&&(p1 U (p0 U !p1))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 42 cols
[2022-06-10 22:10:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:33] [INFO ] Implicit Places using invariants in 131 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 97/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 41/46 places, 97/117 transitions.
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p0) p1), (NOT p0), p1, (NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s26 1), p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-01 finished in 596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 46 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 40 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 40 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 39 transition count 110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 36 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 36 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 34 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 33 transition count 93
Applied a total of 26 rules in 53 ms. Remains 33 /46 variables (removed 13) and now considering 93/117 (removed 24) transitions.
// Phase 1: matrix 93 rows 33 cols
[2022-06-10 22:10:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:34] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 93 rows 33 cols
[2022-06-10 22:10:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 22:10:34] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2022-06-10 22:10:34] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 93 rows 33 cols
[2022-06-10 22:10:34] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 22:10:34] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/46 places, 93/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/46 places, 93/117 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s25 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-02 finished in 600 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X((p0 U !X(!(G(p2)&&p1))))))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 5 ms. Remains 43 /46 variables (removed 3) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:34] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:34] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-10 22:10:35] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:35] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/46 places, 102/117 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s6 1) (EQ s24 1) (EQ s38 1)), p2:(AND (EQ s1 1) (EQ s7 1) (EQ s22 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-03 finished in 540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!(p0 U F(p0)))||G(p1)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 46 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 41 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 36 transition count 91
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 36 transition count 91
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 2 with 2 rules applied. Total rules applied 22 place count 35 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 34 transition count 90
Applied a total of 24 rules in 18 ms. Remains 34 /46 variables (removed 12) and now considering 90/117 (removed 27) transitions.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:35] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:35] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-10 22:10:35] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-06-10 22:10:35] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:35] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/46 places, 90/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/46 places, 90/117 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s2 0) (EQ s12 0) (EQ s30 0)), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s8 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4 reset in 253 ms.
Product exploration explored 100000 steps with 13 reset in 181 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 592 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 748 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:37] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:10:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-10 22:10:37] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 15 factoid took 763 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[true, (AND p0 (NOT p1)), (NOT p1), p0]
Stuttering acceptance computed with spot in 194 ms :[true, (AND p0 (NOT p1)), (NOT p1), p0]
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:38] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:38] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:38] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 22:10:38] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-10 22:10:38] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:38] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:10:38] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 90/90 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 393 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 748 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:39] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:10:39] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:10:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-10 22:10:39] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 451 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[true, (AND p0 (NOT p1)), (NOT p1), p0]
Stuttering acceptance computed with spot in 129 ms :[true, (AND p0 (NOT p1)), (NOT p1), p0]
Stuttering acceptance computed with spot in 129 ms :[true, (AND p0 (NOT p1)), (NOT p1), p0]
Product exploration explored 100000 steps with 6 reset in 63 ms.
Product exploration explored 100000 steps with 27 reset in 70 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 136 ms :[true, (AND p0 (NOT p1)), (NOT p1), p0]
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 90/90 transitions.
Applied a total of 0 rules in 9 ms. Remains 34 /34 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2022-06-10 22:10:40] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:10:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:40] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 90/90 transitions.
Product exploration explored 100000 steps with 6 reset in 134 ms.
Product exploration explored 100000 steps with 7 reset in 107 ms.
Built C files in :
/tmp/ltsmin15206014418426257762
[2022-06-10 22:10:41] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15206014418426257762
Running compilation step : cd /tmp/ltsmin15206014418426257762;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin15206014418426257762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15206014418426257762;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11538000722075470429.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04a-LTLFireability-04 finished in 6351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 42 cols
[2022-06-10 22:10:41] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:41] [INFO ] Implicit Places using invariants in 78 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 97/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 41/46 places, 97/117 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 359 ms.
Product exploration explored 100000 steps with 33333 reset in 335 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-04a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-06 finished in 962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((p0 U p1)))||X(F(G(p2)))))'
Support contains 10 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 107
Applied a total of 4 rules in 3 ms. Remains 44 /46 variables (removed 2) and now considering 107/117 (removed 10) transitions.
// Phase 1: matrix 107 rows 44 cols
[2022-06-10 22:10:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:10:42] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 107 rows 44 cols
[2022-06-10 22:10:42] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-10 22:10:42] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-10 22:10:42] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 44 cols
[2022-06-10 22:10:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:42] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 107/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/46 places, 107/117 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(EQ s19 1), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s12 1) (EQ s39 1)), p2:(OR (EQ s19 1) (AND (EQ s14 1) (EQ s18 1) (EQ s27 1) (EQ s33 1) (EQ s40 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-07 finished in 522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(F((G(F(p0))&&(F(p2)||p1))))))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 46 transition count 112
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 41 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 40 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 40 transition count 110
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 14 place count 39 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 36 transition count 95
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 36 transition count 95
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 22 place count 35 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 34 transition count 94
Applied a total of 24 rules in 17 ms. Remains 34 /46 variables (removed 12) and now considering 94/117 (removed 23) transitions.
// Phase 1: matrix 94 rows 34 cols
[2022-06-10 22:10:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:43] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 94 rows 34 cols
[2022-06-10 22:10:43] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 22:10:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 22:10:43] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-06-10 22:10:43] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 94 rows 34 cols
[2022-06-10 22:10:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:43] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/46 places, 94/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/46 places, 94/117 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s11 0), p2:(OR (EQ s1 0) (EQ s2 0) (EQ s14 0) (EQ s30 0)), p1:(OR (EQ s1 0) (EQ s2 0) (EQ s14 0) (EQ s30 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 395 steps with 42 reset in 2 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-09 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U p1)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 42 cols
[2022-06-10 22:10:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:43] [INFO ] Implicit Places using invariants in 77 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 97/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 41/46 places, 97/117 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, p1, p1]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s14 1), p0:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
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 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-04a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-10 finished in 803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 1 ms. Remains 43 /46 variables (removed 3) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:44] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-10 22:10:44] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:10:44] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/46 places, 102/117 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-11 finished in 310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(F(p0))||!(p1 U X(p2))))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 117/117 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 0 with 4 rules applied. Total rules applied 4 place count 46 transition count 113
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 42 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 40 transition count 110
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 14 place count 39 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 36 transition count 95
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 36 transition count 95
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 22 place count 35 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 34 transition count 94
Applied a total of 24 rules in 16 ms. Remains 34 /46 variables (removed 12) and now considering 94/117 (removed 23) transitions.
// Phase 1: matrix 94 rows 34 cols
[2022-06-10 22:10:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:44] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 94 rows 34 cols
[2022-06-10 22:10:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:10:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 22:10:45] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2022-06-10 22:10:45] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 94 rows 34 cols
[2022-06-10 22:10:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:45] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/46 places, 94/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/46 places, 94/117 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s2 1) (EQ s9 1) (EQ s30 1)), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s17 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5 reset in 62 ms.
Stuttering criterion allowed to conclude after 63 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-13 finished in 393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:10:45] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:10:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-10 22:10:45] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 43 cols
[2022-06-10 22:10:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:10:45] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/46 places, 102/117 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s16 1) (NEQ s38 1)), p0:(EQ s25 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 84 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-15 finished in 347 ms.
All properties solved by simple procedures.
Total runtime 18383 ms.

BK_STOP 1654899045753

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463873000460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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