Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690600635.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678367284386

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 13:08:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 13:08:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:08:06] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-09 13:08:06] [INFO ] Transformed 2162 places.
[2023-03-09 13:08:06] [INFO ] Transformed 3840 transitions.
[2023-03-09 13:08:06] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-030-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 818 places :
Symmetric choice reduction at 0 with 818 rule applications. Total rules 818 place count 1344 transition count 2204
Iterating global reduction 0 with 818 rules applied. Total rules applied 1636 place count 1344 transition count 2204
Applied a total of 1636 rules in 237 ms. Remains 1344 /2162 variables (removed 818) and now considering 2204/3840 (removed 1636) transitions.
// Phase 1: matrix 2204 rows 1344 cols
[2023-03-09 13:08:06] [INFO ] Computed 61 place invariants in 32 ms
[2023-03-09 13:08:07] [INFO ] Implicit Places using invariants in 943 ms returned [12, 26, 40, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 418]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 967 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1316/2162 places, 2204/3840 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1289 transition count 2177
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1289 transition count 2177
Applied a total of 54 rules in 98 ms. Remains 1289 /1316 variables (removed 27) and now considering 2177/2204 (removed 27) transitions.
// Phase 1: matrix 2177 rows 1289 cols
[2023-03-09 13:08:07] [INFO ] Computed 33 place invariants in 22 ms
[2023-03-09 13:08:08] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-09 13:08:08] [INFO ] Invariant cache hit.
[2023-03-09 13:08:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:08:14] [INFO ] Implicit Places using invariants and state equation in 6358 ms returned []
Implicit Place search using SMT with State Equation took 6889 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1289/2162 places, 2177/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8192 ms. Remains : 1289/2162 places, 2177/3840 transitions.
Support contains 54 out of 1289 places after structural reductions.
[2023-03-09 13:08:14] [INFO ] Flatten gal took : 155 ms
[2023-03-09 13:08:15] [INFO ] Flatten gal took : 123 ms
[2023-03-09 13:08:15] [INFO ] Input system was already deterministic with 2177 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 31) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 13:08:16] [INFO ] Invariant cache hit.
[2023-03-09 13:08:16] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-09 13:08:16] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 13:08:16] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-09 13:08:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2023-03-09 13:08:16] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 13:08:17] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2023-03-09 13:08:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:08:18] [INFO ] After 613ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :6 sat :5
[2023-03-09 13:08:19] [INFO ] After 1494ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-09 13:08:19] [INFO ] After 3073ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
Fused 11 Parikh solutions to 3 different solutions.
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 5 properties in 15 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA CANConstruction-PT-030-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 94 stabilizing places and 123 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1289 transition count 1980
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1092 transition count 1980
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 394 place count 1092 transition count 1952
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 450 place count 1064 transition count 1952
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 471 place count 1043 transition count 1910
Iterating global reduction 2 with 21 rules applied. Total rules applied 492 place count 1043 transition count 1910
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 506 place count 1043 transition count 1896
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 520 place count 1029 transition count 1896
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 580 place count 999 transition count 1866
Applied a total of 580 rules in 342 ms. Remains 999 /1289 variables (removed 290) and now considering 1866/2177 (removed 311) transitions.
// Phase 1: matrix 1866 rows 999 cols
[2023-03-09 13:08:20] [INFO ] Computed 33 place invariants in 18 ms
[2023-03-09 13:08:20] [INFO ] Implicit Places using invariants in 694 ms returned [14, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 696 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/1289 places, 1866/2177 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 997 transition count 1862
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 993 transition count 1862
Applied a total of 8 rules in 89 ms. Remains 993 /997 variables (removed 4) and now considering 1862/1866 (removed 4) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2023-03-09 13:08:21] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 13:08:21] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-09 13:08:21] [INFO ] Invariant cache hit.
[2023-03-09 13:08:22] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:08:27] [INFO ] Implicit Places using invariants and state equation in 6036 ms returned []
Implicit Place search using SMT with State Equation took 6578 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 993/1289 places, 1862/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7707 ms. Remains : 993/1289 places, 1862/2177 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s503 s415)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-03 finished in 7895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1&&F(G(p1)))))))'
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1266 transition count 2132
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1266 transition count 2132
Applied a total of 46 rules in 96 ms. Remains 1266 /1289 variables (removed 23) and now considering 2132/2177 (removed 45) transitions.
// Phase 1: matrix 2132 rows 1266 cols
[2023-03-09 13:08:27] [INFO ] Computed 33 place invariants in 21 ms
[2023-03-09 13:08:28] [INFO ] Implicit Places using invariants in 691 ms returned [48, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 694 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1264/1289 places, 2132/2177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1262 transition count 2130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1262 transition count 2130
Applied a total of 4 rules in 98 ms. Remains 1262 /1264 variables (removed 2) and now considering 2130/2132 (removed 2) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2023-03-09 13:08:28] [INFO ] Computed 31 place invariants in 23 ms
[2023-03-09 13:08:29] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-09 13:08:29] [INFO ] Invariant cache hit.
[2023-03-09 13:08:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:08:35] [INFO ] Implicit Places using invariants and state equation in 6297 ms returned []
Implicit Place search using SMT with State Equation took 6894 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1262/1289 places, 2130/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7783 ms. Remains : 1262/1289 places, 2130/2177 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1062 s91), p1:(LEQ 1 s91)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1486 ms.
Product exploration explored 100000 steps with 50000 reset in 1352 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-04 finished in 10868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||((p1 U p2)&&(p1||X(X(p3)))))))'
Support contains 7 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1269 transition count 2138
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1269 transition count 2138
Applied a total of 40 rules in 93 ms. Remains 1269 /1289 variables (removed 20) and now considering 2138/2177 (removed 39) transitions.
// Phase 1: matrix 2138 rows 1269 cols
[2023-03-09 13:08:38] [INFO ] Computed 33 place invariants in 22 ms
[2023-03-09 13:08:39] [INFO ] Implicit Places using invariants in 561 ms returned [48, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 563 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1267/1289 places, 2138/2177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1265 transition count 2136
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1265 transition count 2136
Applied a total of 4 rules in 88 ms. Remains 1265 /1267 variables (removed 2) and now considering 2136/2138 (removed 2) transitions.
// Phase 1: matrix 2136 rows 1265 cols
[2023-03-09 13:08:39] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 13:08:39] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-09 13:08:39] [INFO ] Invariant cache hit.
[2023-03-09 13:08:40] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:08:46] [INFO ] Implicit Places using invariants and state equation in 6490 ms returned []
Implicit Place search using SMT with State Equation took 7008 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1265/1289 places, 2136/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7754 ms. Remains : 1265/1289 places, 2136/2177 transitions.
Stuttering acceptance computed with spot in 549 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3), true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=5, aps=[p2:(LEQ 1 s334), p1:(LEQ s945 s946), p0:(LEQ s1245 s1160), p3:(LEQ s666 s190)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 979 ms.
Product exploration explored 100000 steps with 33333 reset in 838 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0 p3), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-05 finished in 10510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 3 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1268 transition count 2135
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1268 transition count 2135
Applied a total of 42 rules in 112 ms. Remains 1268 /1289 variables (removed 21) and now considering 2135/2177 (removed 42) transitions.
// Phase 1: matrix 2135 rows 1268 cols
[2023-03-09 13:08:49] [INFO ] Computed 33 place invariants in 22 ms
[2023-03-09 13:08:49] [INFO ] Implicit Places using invariants in 623 ms returned [48, 351]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 625 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1266/1289 places, 2135/2177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1264 transition count 2133
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1264 transition count 2133
Applied a total of 4 rules in 86 ms. Remains 1264 /1266 variables (removed 2) and now considering 2133/2135 (removed 2) transitions.
// Phase 1: matrix 2133 rows 1264 cols
[2023-03-09 13:08:49] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 13:08:50] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-03-09 13:08:50] [INFO ] Invariant cache hit.
[2023-03-09 13:08:51] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:08:57] [INFO ] Implicit Places using invariants and state equation in 6748 ms returned []
Implicit Place search using SMT with State Equation took 7349 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1264/1289 places, 2133/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8174 ms. Remains : 1264/1289 places, 2133/2177 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LEQ s1228 s240) (LEQ 1 s138)), p0:(GT s1228 s240)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-06 finished in 8334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 6 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1289 transition count 1982
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1094 transition count 1982
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 390 place count 1094 transition count 1954
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 446 place count 1066 transition count 1954
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 465 place count 1047 transition count 1916
Iterating global reduction 2 with 19 rules applied. Total rules applied 484 place count 1047 transition count 1916
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 494 place count 1047 transition count 1906
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 504 place count 1037 transition count 1906
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 568 place count 1005 transition count 1874
Applied a total of 568 rules in 205 ms. Remains 1005 /1289 variables (removed 284) and now considering 1874/2177 (removed 303) transitions.
// Phase 1: matrix 1874 rows 1005 cols
[2023-03-09 13:08:57] [INFO ] Computed 33 place invariants in 8 ms
[2023-03-09 13:08:58] [INFO ] Implicit Places using invariants in 492 ms returned [14, 96]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 494 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1289 places, 1874/2177 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 1003 transition count 1870
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 999 transition count 1870
Applied a total of 8 rules in 53 ms. Remains 999 /1003 variables (removed 4) and now considering 1870/1874 (removed 4) transitions.
// Phase 1: matrix 1870 rows 999 cols
[2023-03-09 13:08:58] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 13:08:58] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-09 13:08:58] [INFO ] Invariant cache hit.
[2023-03-09 13:08:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:04] [INFO ] Implicit Places using invariants and state equation in 5742 ms returned []
Implicit Place search using SMT with State Equation took 6222 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 999/1289 places, 1870/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6976 ms. Remains : 999/1289 places, 1870/2177 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT s42 s659), p0:(AND (OR (GT s42 s659) (GT s821 s686)) (GT s71 s636))], 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 241 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-07 finished in 7082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1289 transition count 1980
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1092 transition count 1980
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 394 place count 1092 transition count 1952
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 450 place count 1064 transition count 1952
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 472 place count 1042 transition count 1908
Iterating global reduction 2 with 22 rules applied. Total rules applied 494 place count 1042 transition count 1908
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 15 rules applied. Total rules applied 509 place count 1042 transition count 1893
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 524 place count 1027 transition count 1893
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 582 place count 998 transition count 1864
Applied a total of 582 rules in 180 ms. Remains 998 /1289 variables (removed 291) and now considering 1864/2177 (removed 313) transitions.
// Phase 1: matrix 1864 rows 998 cols
[2023-03-09 13:09:04] [INFO ] Computed 33 place invariants in 16 ms
[2023-03-09 13:09:05] [INFO ] Implicit Places using invariants in 581 ms returned [14, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 584 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/1289 places, 1864/2177 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 996 transition count 1860
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 992 transition count 1860
Applied a total of 8 rules in 49 ms. Remains 992 /996 variables (removed 4) and now considering 1860/1864 (removed 4) transitions.
// Phase 1: matrix 1860 rows 992 cols
[2023-03-09 13:09:05] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 13:09:05] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-09 13:09:05] [INFO ] Invariant cache hit.
[2023-03-09 13:09:06] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:11] [INFO ] Implicit Places using invariants and state equation in 5707 ms returned []
Implicit Place search using SMT with State Equation took 6144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 992/1289 places, 1860/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6960 ms. Remains : 992/1289 places, 1860/2177 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s595)], 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 393 steps with 1 reset in 7 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-09 finished in 7170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1289 transition count 1981
Reduce places removed 196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 197 rules applied. Total rules applied 393 place count 1093 transition count 1980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 1092 transition count 1980
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 394 place count 1092 transition count 1952
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 450 place count 1064 transition count 1952
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 472 place count 1042 transition count 1908
Iterating global reduction 3 with 22 rules applied. Total rules applied 494 place count 1042 transition count 1908
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 509 place count 1042 transition count 1893
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 524 place count 1027 transition count 1893
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 582 place count 998 transition count 1864
Applied a total of 582 rules in 178 ms. Remains 998 /1289 variables (removed 291) and now considering 1864/2177 (removed 313) transitions.
// Phase 1: matrix 1864 rows 998 cols
[2023-03-09 13:09:11] [INFO ] Computed 33 place invariants in 17 ms
[2023-03-09 13:09:12] [INFO ] Implicit Places using invariants in 593 ms returned [14, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 595 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/1289 places, 1864/2177 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 996 transition count 1860
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 992 transition count 1860
Applied a total of 8 rules in 58 ms. Remains 992 /996 variables (removed 4) and now considering 1860/1864 (removed 4) transitions.
// Phase 1: matrix 1860 rows 992 cols
[2023-03-09 13:09:12] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 13:09:13] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-09 13:09:13] [INFO ] Invariant cache hit.
[2023-03-09 13:09:13] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:18] [INFO ] Implicit Places using invariants and state equation in 5634 ms returned []
Implicit Place search using SMT with State Equation took 6241 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 992/1289 places, 1860/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7073 ms. Remains : 992/1289 places, 1860/2177 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 487 reset in 669 ms.
Stack based approach found an accepted trace after 23537 steps with 113 reset with depth 175 and stack size 175 in 201 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-12 finished in 8008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1289 transition count 1983
Reduce places removed 194 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 389 place count 1095 transition count 1982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 1094 transition count 1982
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 390 place count 1094 transition count 1954
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 446 place count 1066 transition count 1954
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 466 place count 1046 transition count 1914
Iterating global reduction 3 with 20 rules applied. Total rules applied 486 place count 1046 transition count 1914
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 499 place count 1046 transition count 1901
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 512 place count 1033 transition count 1901
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 574 place count 1002 transition count 1870
Applied a total of 574 rules in 178 ms. Remains 1002 /1289 variables (removed 287) and now considering 1870/2177 (removed 307) transitions.
// Phase 1: matrix 1870 rows 1002 cols
[2023-03-09 13:09:19] [INFO ] Computed 33 place invariants in 22 ms
[2023-03-09 13:09:20] [INFO ] Implicit Places using invariants in 633 ms returned [14, 94]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 635 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1289 places, 1870/2177 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 1000 transition count 1866
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 996 transition count 1866
Applied a total of 8 rules in 59 ms. Remains 996 /1000 variables (removed 4) and now considering 1866/1870 (removed 4) transitions.
// Phase 1: matrix 1866 rows 996 cols
[2023-03-09 13:09:20] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 13:09:21] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-09 13:09:21] [INFO ] Invariant cache hit.
[2023-03-09 13:09:21] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:27] [INFO ] Implicit Places using invariants and state equation in 5888 ms returned []
Implicit Place search using SMT with State Equation took 6395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1289 places, 1866/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7270 ms. Remains : 996/1289 places, 1866/2177 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ s20 s291) (LEQ s712 s968)), p0:(LEQ s712 s968)], 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 479 reset in 627 ms.
Product exploration explored 100000 steps with 478 reset in 798 ms.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 13:09:28] [INFO ] Invariant cache hit.
[2023-03-09 13:09:29] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 254 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1866/1866 transitions.
Applied a total of 0 rules in 51 ms. Remains 996 /996 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2023-03-09 13:09:29] [INFO ] Invariant cache hit.
[2023-03-09 13:09:29] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-09 13:09:29] [INFO ] Invariant cache hit.
[2023-03-09 13:09:30] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:35] [INFO ] Implicit Places using invariants and state equation in 5842 ms returned []
Implicit Place search using SMT with State Equation took 6290 ms to find 0 implicit places.
[2023-03-09 13:09:35] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-09 13:09:35] [INFO ] Invariant cache hit.
[2023-03-09 13:09:36] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7111 ms. Remains : 996/996 places, 1866/1866 transitions.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Finished random walk after 5125 steps, including 24 resets, run visited all 1 properties in 29 ms. (steps per millisecond=176 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Product exploration explored 100000 steps with 477 reset in 538 ms.
Product exploration explored 100000 steps with 480 reset in 546 ms.
Built C files in :
/tmp/ltsmin9266822238482812537
[2023-03-09 13:09:37] [INFO ] Too many transitions (1866) to apply POR reductions. Disabling POR matrices.
[2023-03-09 13:09:38] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9266822238482812537
Running compilation step : cd /tmp/ltsmin9266822238482812537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9266822238482812537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9266822238482812537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1866/1866 transitions.
Applied a total of 0 rules in 83 ms. Remains 996 /996 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2023-03-09 13:09:41] [INFO ] Invariant cache hit.
[2023-03-09 13:09:41] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-03-09 13:09:41] [INFO ] Invariant cache hit.
[2023-03-09 13:09:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:47] [INFO ] Implicit Places using invariants and state equation in 5473 ms returned []
Implicit Place search using SMT with State Equation took 6053 ms to find 0 implicit places.
[2023-03-09 13:09:47] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-09 13:09:47] [INFO ] Invariant cache hit.
[2023-03-09 13:09:47] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6938 ms. Remains : 996/996 places, 1866/1866 transitions.
Built C files in :
/tmp/ltsmin4202416851339024595
[2023-03-09 13:09:47] [INFO ] Too many transitions (1866) to apply POR reductions. Disabling POR matrices.
[2023-03-09 13:09:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4202416851339024595
Running compilation step : cd /tmp/ltsmin4202416851339024595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2996 ms.
Running link step : cd /tmp/ltsmin4202416851339024595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin4202416851339024595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12402832701909209704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 13:10:03] [INFO ] Flatten gal took : 56 ms
[2023-03-09 13:10:03] [INFO ] Flatten gal took : 51 ms
[2023-03-09 13:10:03] [INFO ] Time to serialize gal into /tmp/LTL18431206057005203051.gal : 16 ms
[2023-03-09 13:10:03] [INFO ] Time to serialize properties into /tmp/LTL18081361300573915593.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18431206057005203051.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10947581326006784942.hoa' '-atoms' '/tmp/LTL18081361300573915593.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18081361300573915593.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10947581326006784942.hoa
Detected timeout of ITS tools.
[2023-03-09 13:10:18] [INFO ] Flatten gal took : 62 ms
[2023-03-09 13:10:18] [INFO ] Flatten gal took : 58 ms
[2023-03-09 13:10:18] [INFO ] Time to serialize gal into /tmp/LTL7498183765813517775.gal : 10 ms
[2023-03-09 13:10:18] [INFO ] Time to serialize properties into /tmp/LTL562986501698211388.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7498183765813517775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL562986501698211388.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node20GiveAnswer7<=Node29GiveAnswer1)")U("((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")))...157
Formula 0 simplified : GF(!"(Node20GiveAnswer7<=Node29GiveAnswer1)" R !"((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")
Detected timeout of ITS tools.
[2023-03-09 13:10:33] [INFO ] Flatten gal took : 72 ms
[2023-03-09 13:10:33] [INFO ] Applying decomposition
[2023-03-09 13:10:33] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15938923425414005973.txt' '-o' '/tmp/graph15938923425414005973.bin' '-w' '/tmp/graph15938923425414005973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15938923425414005973.bin' '-l' '-1' '-v' '-w' '/tmp/graph15938923425414005973.weights' '-q' '0' '-e' '0.001'
[2023-03-09 13:10:33] [INFO ] Decomposing Gal with order
[2023-03-09 13:10:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 13:10:34] [INFO ] Removed a total of 1773 redundant transitions.
[2023-03-09 13:10:34] [INFO ] Flatten gal took : 374 ms
[2023-03-09 13:10:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1674 labels/synchronizations in 81 ms.
[2023-03-09 13:10:34] [INFO ] Time to serialize gal into /tmp/LTL914788538309155654.gal : 11 ms
[2023-03-09 13:10:34] [INFO ] Time to serialize properties into /tmp/LTL3932871475536401715.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL914788538309155654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3932871475536401715.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu32.Node20GiveAnswer7<=gu32.Node29GiveAnswer1)")U("((gu31.Node5Bootstrap<=gu31.Node5requestsent23)||(gu32.Node20GiveAnswer7...187
Formula 0 simplified : GF(!"(gu32.Node20GiveAnswer7<=gu32.Node29GiveAnswer1)" R !"((gu31.Node5Bootstrap<=gu31.Node5requestsent23)||(gu32.Node20GiveAnswer7<...182
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14581074914717818194
[2023-03-09 13:10:49] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14581074914717818194
Running compilation step : cd /tmp/ltsmin14581074914717818194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14581074914717818194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14581074914717818194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-030-LTLCardinality-13 finished in 92992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1267 transition count 2134
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1267 transition count 2134
Applied a total of 44 rules in 110 ms. Remains 1267 /1289 variables (removed 22) and now considering 2134/2177 (removed 43) transitions.
// Phase 1: matrix 2134 rows 1267 cols
[2023-03-09 13:10:52] [INFO ] Computed 33 place invariants in 20 ms
[2023-03-09 13:10:53] [INFO ] Implicit Places using invariants in 622 ms returned [48, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 624 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1265/1289 places, 2134/2177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1263 transition count 2132
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1263 transition count 2132
Applied a total of 4 rules in 71 ms. Remains 1263 /1265 variables (removed 2) and now considering 2132/2134 (removed 2) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-09 13:10:53] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 13:10:54] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-09 13:10:54] [INFO ] Invariant cache hit.
[2023-03-09 13:10:54] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:11:00] [INFO ] Implicit Places using invariants and state equation in 6416 ms returned []
Implicit Place search using SMT with State Equation took 7000 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1289 places, 2132/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7806 ms. Remains : 1263/1289 places, 2132/2177 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s772 s364)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1086 ms.
Product exploration explored 100000 steps with 50000 reset in 1121 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-14 finished in 10171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||(F(p1)&&X(p2))))))'
Support contains 5 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1268 transition count 2136
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1268 transition count 2136
Applied a total of 42 rules in 74 ms. Remains 1268 /1289 variables (removed 21) and now considering 2136/2177 (removed 41) transitions.
// Phase 1: matrix 2136 rows 1268 cols
[2023-03-09 13:11:02] [INFO ] Computed 33 place invariants in 20 ms
[2023-03-09 13:11:03] [INFO ] Implicit Places using invariants in 567 ms returned [350]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 570 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1267/1289 places, 2136/2177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1266 transition count 2135
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1266 transition count 2135
Applied a total of 2 rules in 90 ms. Remains 1266 /1267 variables (removed 1) and now considering 2135/2136 (removed 1) transitions.
// Phase 1: matrix 2135 rows 1266 cols
[2023-03-09 13:11:03] [INFO ] Computed 32 place invariants in 14 ms
[2023-03-09 13:11:04] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-09 13:11:04] [INFO ] Invariant cache hit.
[2023-03-09 13:11:04] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:11:10] [INFO ] Implicit Places using invariants and state equation in 6535 ms returned []
Implicit Place search using SMT with State Equation took 7094 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1266/1289 places, 2135/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7831 ms. Remains : 1266/1289 places, 2135/2177 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ s453 s1032), p0:(LEQ 1 s607), p2:(GT s118 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-15 finished in 8176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
[2023-03-09 13:11:11] [INFO ] Flatten gal took : 72 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1854398153162043838
[2023-03-09 13:11:11] [INFO ] Too many transitions (2177) to apply POR reductions. Disabling POR matrices.
[2023-03-09 13:11:11] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1854398153162043838
Running compilation step : cd /tmp/ltsmin1854398153162043838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 13:11:11] [INFO ] Applying decomposition
[2023-03-09 13:11:11] [INFO ] Flatten gal took : 154 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3190234055796488520.txt' '-o' '/tmp/graph3190234055796488520.bin' '-w' '/tmp/graph3190234055796488520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3190234055796488520.bin' '-l' '-1' '-v' '-w' '/tmp/graph3190234055796488520.weights' '-q' '0' '-e' '0.001'
[2023-03-09 13:11:11] [INFO ] Decomposing Gal with order
[2023-03-09 13:11:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 13:11:12] [INFO ] Removed a total of 1814 redundant transitions.
[2023-03-09 13:11:12] [INFO ] Flatten gal took : 171 ms
[2023-03-09 13:11:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1666 labels/synchronizations in 171 ms.
[2023-03-09 13:11:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality7463747682245293024.gal : 29 ms
[2023-03-09 13:11:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality461852252862946607.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7463747682245293024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality461852252862946607.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu138.Node20GiveAnswer7<=gu138.Node29GiveAnswer1)")U("((gu25.Node5Bootstrap<=gu25.Node5requestsent23)||(gu138.Node20GiveAnsw...191
Formula 0 simplified : GF(!"(gu138.Node20GiveAnswer7<=gu138.Node29GiveAnswer1)" R !"((gu25.Node5Bootstrap<=gu25.Node5requestsent23)||(gu138.Node20GiveAnswe...186
Compilation finished in 3841 ms.
Running link step : cd /tmp/ltsmin1854398153162043838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1854398153162043838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 13:32:14] [INFO ] Flatten gal took : 134 ms
[2023-03-09 13:32:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality2053214460271994446.gal : 10 ms
[2023-03-09 13:32:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality9507941415584774674.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2053214460271994446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9507941415584774674.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node20GiveAnswer7<=Node29GiveAnswer1)")U("((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")))...157
Formula 0 simplified : GF(!"(Node20GiveAnswer7<=Node29GiveAnswer1)" R !"((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")
Detected timeout of ITS tools.
[2023-03-09 13:53:16] [INFO ] Flatten gal took : 161 ms
[2023-03-09 13:53:16] [INFO ] Input system was already deterministic with 2177 transitions.
[2023-03-09 13:53:16] [INFO ] Transformed 1289 places.
[2023-03-09 13:53:16] [INFO ] Transformed 2177 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 13:53:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality16154029300895042864.gal : 6 ms
[2023-03-09 13:53:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality8075320498755592720.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16154029300895042864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8075320498755592720.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(Node20GiveAnswer7<=Node29GiveAnswer1)")U("((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")))...157
Formula 0 simplified : GF(!"(Node20GiveAnswer7<=Node29GiveAnswer1)" R !"((Node5Bootstrap<=Node5requestsent23)||(Node20GiveAnswer7<=Node29GiveAnswer1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 5121644 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16035780 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-030, 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 r037-tajo-167813690600635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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