Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 144K May 18 16:43 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 NoC3x3-PT-4A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716690658813

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 02:31:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:31:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:31:00] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-26 02:31:00] [INFO ] Transformed 293 places.
[2024-05-26 02:31:00] [INFO ] Transformed 608 transitions.
[2024-05-26 02:31:00] [INFO ] Found NUPN structural information;
[2024-05-26 02:31:00] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 242 transition count 370
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 242 transition count 370
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 142 place count 242 transition count 330
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 149 place count 235 transition count 330
Applied a total of 149 rules in 51 ms. Remains 235 /293 variables (removed 58) and now considering 330/453 (removed 123) transitions.
// Phase 1: matrix 330 rows 235 cols
[2024-05-26 02:31:00] [INFO ] Computed 59 invariants in 15 ms
[2024-05-26 02:31:01] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-26 02:31:01] [INFO ] Invariant cache hit.
[2024-05-26 02:31:01] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2024-05-26 02:31:01] [INFO ] Invariant cache hit.
[2024-05-26 02:31:01] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/293 places, 330/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 947 ms. Remains : 235/293 places, 330/453 transitions.
Support contains 26 out of 235 places after structural reductions.
[2024-05-26 02:31:01] [INFO ] Flatten gal took : 56 ms
[2024-05-26 02:31:01] [INFO ] Flatten gal took : 22 ms
[2024-05-26 02:31:01] [INFO ] Input system was already deterministic with 330 transitions.
Support contains 24 out of 235 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 02:31:02] [INFO ] Invariant cache hit.
[2024-05-26 02:31:02] [INFO ] [Real]Absence check using 59 positive place invariants in 10 ms returned sat
[2024-05-26 02:31:02] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA NoC3x3-PT-4A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 785 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U !X((X(p1) U p0))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 229 transition count 325
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 229 transition count 325
Applied a total of 11 rules in 12 ms. Remains 229 /235 variables (removed 6) and now considering 325/330 (removed 5) transitions.
// Phase 1: matrix 325 rows 229 cols
[2024-05-26 02:31:02] [INFO ] Computed 58 invariants in 6 ms
[2024-05-26 02:31:02] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-26 02:31:02] [INFO ] Invariant cache hit.
[2024-05-26 02:31:02] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-26 02:31:02] [INFO ] Invariant cache hit.
[2024-05-26 02:31:02] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 325/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 229/235 places, 325/330 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s70 1)), p1:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33332 reset in 518 ms.
Product exploration explored 100000 steps with 33477 reset in 417 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 774 edges and 229 vertex of which 228 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/229 stabilizing places and 1/325 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Finished random walk after 798 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 325/325 transitions.
Applied a total of 0 rules in 9 ms. Remains 229 /229 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-26 02:31:04] [INFO ] Invariant cache hit.
[2024-05-26 02:31:05] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-26 02:31:05] [INFO ] Invariant cache hit.
[2024-05-26 02:31:05] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-26 02:31:05] [INFO ] Invariant cache hit.
[2024-05-26 02:31:05] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 229/229 places, 325/325 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 774 edges and 229 vertex of which 228 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/229 stabilizing places and 1/325 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Finished random walk after 466 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 33414 reset in 351 ms.
Product exploration explored 100000 steps with 33199 reset in 373 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 325/325 transitions.
Graph (trivial) has 137 edges and 229 vertex of which 73 / 229 are part of one of the 32 SCC in 5 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 243
Applied a total of 2 rules in 29 ms. Remains 188 /229 variables (removed 41) and now considering 243/325 (removed 82) transitions.
[2024-05-26 02:31:07] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-26 02:31:07] [INFO ] Flow matrix only has 212 transitions (discarded 31 similar events)
// Phase 1: matrix 212 rows 188 cols
[2024-05-26 02:31:07] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 02:31:07] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 188/229 places, 243/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 188/229 places, 243/325 transitions.
Built C files in :
/tmp/ltsmin865598513200560231
[2024-05-26 02:31:07] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin865598513200560231
Running compilation step : cd /tmp/ltsmin865598513200560231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 537 ms.
Running link step : cd /tmp/ltsmin865598513200560231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin865598513200560231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17576406801766326446.hoa' '--buchi-type=spotba'
LTSmin run took 755 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-4A-LTLCardinality-00 finished in 6433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 228 transition count 325
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 5 ms. Remains 228 /235 variables (removed 7) and now considering 325/330 (removed 5) transitions.
// Phase 1: matrix 325 rows 228 cols
[2024-05-26 02:31:08] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:31:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-26 02:31:09] [INFO ] Invariant cache hit.
[2024-05-26 02:31:09] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-26 02:31:09] [INFO ] Invariant cache hit.
[2024-05-26 02:31:09] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/235 places, 325/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 228/235 places, 325/330 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 310 ms.
Product exploration explored 100000 steps with 33333 reset in 325 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-4A-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4A-LTLCardinality-04 finished in 1201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 137 edges and 235 vertex of which 72 / 235 are part of one of the 32 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 705 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 184 transition count 222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 57 place count 164 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 160 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 160 transition count 218
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 90 place count 160 transition count 193
Applied a total of 90 rules in 26 ms. Remains 160 /235 variables (removed 75) and now considering 193/330 (removed 137) transitions.
// Phase 1: matrix 193 rows 160 cols
[2024-05-26 02:31:10] [INFO ] Computed 49 invariants in 2 ms
[2024-05-26 02:31:10] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-26 02:31:10] [INFO ] Invariant cache hit.
[2024-05-26 02:31:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-26 02:31:10] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-26 02:31:10] [INFO ] Redundant transitions in 65 ms returned []
[2024-05-26 02:31:10] [INFO ] Invariant cache hit.
[2024-05-26 02:31:10] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/235 places, 193/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 160/235 places, 193/330 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s95 1), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-05 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 137 edges and 235 vertex of which 73 / 235 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 704 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 182 transition count 217
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 65 place count 159 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 155 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 155 transition count 213
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 97 place count 155 transition count 189
Applied a total of 97 rules in 24 ms. Remains 155 /235 variables (removed 80) and now considering 189/330 (removed 141) transitions.
// Phase 1: matrix 189 rows 155 cols
[2024-05-26 02:31:10] [INFO ] Computed 48 invariants in 2 ms
[2024-05-26 02:31:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-26 02:31:10] [INFO ] Invariant cache hit.
[2024-05-26 02:31:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 02:31:10] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-26 02:31:10] [INFO ] Redundant transitions in 48 ms returned []
[2024-05-26 02:31:10] [INFO ] Invariant cache hit.
[2024-05-26 02:31:11] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/235 places, 189/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 347 ms. Remains : 155/235 places, 189/330 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s8 1) (AND (EQ s36 0) (EQ s83 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-06 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 229 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 229 transition count 326
Applied a total of 10 rules in 10 ms. Remains 229 /235 variables (removed 6) and now considering 326/330 (removed 4) transitions.
// Phase 1: matrix 326 rows 229 cols
[2024-05-26 02:31:11] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 02:31:11] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-26 02:31:11] [INFO ] Invariant cache hit.
[2024-05-26 02:31:11] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-26 02:31:11] [INFO ] Invariant cache hit.
[2024-05-26 02:31:11] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 326/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 229/235 places, 326/330 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s105 0) (EQ s164 1)), p1:(EQ s204 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 480 steps with 2 reset in 8 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-11 finished in 518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 133 edges and 235 vertex of which 70 / 235 are part of one of the 31 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Graph (complete) has 708 edges and 196 vertex of which 194 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 185 transition count 224
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 59 place count 164 transition count 224
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 159 transition count 219
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 159 transition count 219
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 95 place count 159 transition count 193
Applied a total of 95 rules in 34 ms. Remains 159 /235 variables (removed 76) and now considering 193/330 (removed 137) transitions.
// Phase 1: matrix 193 rows 159 cols
[2024-05-26 02:31:11] [INFO ] Computed 49 invariants in 2 ms
[2024-05-26 02:31:11] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-26 02:31:11] [INFO ] Invariant cache hit.
[2024-05-26 02:31:11] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 02:31:11] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-26 02:31:11] [INFO ] Redundant transitions in 54 ms returned []
[2024-05-26 02:31:11] [INFO ] Invariant cache hit.
[2024-05-26 02:31:12] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/235 places, 193/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 159/235 places, 193/330 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s150 0) (EQ s125 1) (EQ s27 0) (EQ s99 1))], 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 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-13 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p0) U p1) U p2))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 136 edges and 235 vertex of which 73 / 235 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 704 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 182 transition count 217
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 65 place count 159 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 156 transition count 214
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 156 transition count 214
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 94 place count 156 transition count 191
Applied a total of 94 rules in 19 ms. Remains 156 /235 variables (removed 79) and now considering 191/330 (removed 139) transitions.
// Phase 1: matrix 191 rows 156 cols
[2024-05-26 02:31:12] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 02:31:12] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-26 02:31:12] [INFO ] Invariant cache hit.
[2024-05-26 02:31:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 02:31:12] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-26 02:31:12] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-26 02:31:12] [INFO ] Invariant cache hit.
[2024-05-26 02:31:12] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/235 places, 191/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 372 ms. Remains : 156/235 places, 191/330 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s112 0) (EQ s104 1)), p1:(OR (EQ s103 0) (EQ s8 1)), p0:(OR (EQ s54 0) (EQ s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 166 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-14 finished in 689 ms.
All properties solved by simple procedures.
Total runtime 12520 ms.

BK_STOP 1716690673718

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-4A, 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 r263-tall-171654372700377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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