fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r457-smll-167912649700707
Last Updated
May 14, 2023

About the Execution of LTSMin+red for StigmergyElection-PT-11b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15579.224 3600000.00 3766655.00 10316.30 FFTTTFTFFT?FTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r457-smll-167912649700707.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is StigmergyElection-PT-11b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649700707
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 413M
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 413M Mar 5 18:23 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 StigmergyElection-PT-11b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-11b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679613910474

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 23:25:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 23:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 23:25:33] [INFO ] Load time of PNML (sax parser for PT used): 19983 ms
[2023-03-23 23:25:34] [INFO ] Transformed 1515 places.
[2023-03-23 23:25:35] [INFO ] Transformed 357966 transitions.
[2023-03-23 23:25:35] [INFO ] Found NUPN structural information;
[2023-03-23 23:25:35] [INFO ] Parsed PT model containing 1515 places and 357966 transitions and 7842915 arcs in 22196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyElection-PT-11b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 357966/357966 transitions.
Discarding 188 places :
Symmetric choice reduction at 0 with 188 rule applications. Total rules 188 place count 1327 transition count 357778
Iterating global reduction 0 with 188 rules applied. Total rules applied 376 place count 1327 transition count 357778
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 475 place count 1228 transition count 357679
Iterating global reduction 0 with 99 rules applied. Total rules applied 574 place count 1228 transition count 357679
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 596 place count 1206 transition count 357657
Iterating global reduction 0 with 22 rules applied. Total rules applied 618 place count 1206 transition count 357657
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 629 place count 1195 transition count 357646
Iterating global reduction 0 with 11 rules applied. Total rules applied 640 place count 1195 transition count 357646
Applied a total of 640 rules in 52252 ms. Remains 1195 /1515 variables (removed 320) and now considering 357646/357966 (removed 320) transitions.
// Phase 1: matrix 357646 rows 1195 cols
[2023-03-23 23:26:50] [INFO ] Computed 12 place invariants in 18453 ms
[2023-03-23 23:27:23] [INFO ] Performed 243/1195 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2023-03-23 23:27:54] [INFO ] Performed 502/1195 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2023-03-23 23:28:25] [INFO ] Performed 810/1195 implicitness test of which 0 returned IMPLICIT in 95 seconds.
[2023-03-23 23:28:56] [INFO ] Performed 1128/1195 implicitness test of which 0 returned IMPLICIT in 126 seconds.
[2023-03-23 23:28:56] [INFO ] Timeout of Implicit test with SMT after 126 seconds.
[2023-03-23 23:28:56] [INFO ] Implicit Places using invariants in 145560 ms returned []
Implicit Place search using SMT only with invariants took 145604 ms to find 0 implicit places.
[2023-03-23 23:28:57] [INFO ] Invariant cache hit.
[2023-03-23 23:29:27] [INFO ] Performed 32608/357646 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 23:29:57] [INFO ] Dead Transitions using invariants and state equation in 60452 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1195/1515 places, 357646/357966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258344 ms. Remains : 1195/1515 places, 357646/357966 transitions.
Support contains 12 out of 1195 places after structural reductions.
[2023-03-23 23:30:54] [INFO ] Flatten gal took : 49919 ms
[2023-03-23 23:31:41] [INFO ] Flatten gal took : 47265 ms
[2023-03-23 23:33:01] [INFO ] Input system was already deterministic with 357646 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 4094 ms. (steps per millisecond=2 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 23:33:13] [INFO ] Invariant cache hit.
[2023-03-23 23:33:14] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-23 23:33:14] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 23:33:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 23:33:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 23:33:39] [INFO ] After 25228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1195/1195 places, 357646/357646 transitions.
Graph (trivial) has 1217 edges and 1195 vertex of which 187 / 1195 are part of one of the 33 SCC in 64 ms
Free SCC test removed 154 places
Drop transitions removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 3728 edges and 1041 vertex of which 1030 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1492 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 729 transitions
Trivial Post-agglo rules discarded 729 transitions
Performed 729 trivial Post agglomeration. Transition count delta: 729
Iterating post reduction 0 with 740 rules applied. Total rules applied 742 place count 1030 transition count 356698
Reduce places removed 729 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 749 rules applied. Total rules applied 1491 place count 301 transition count 356678
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 1503 place count 291 transition count 356676
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1505 place count 289 transition count 356676
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1505 place count 289 transition count 356620
Deduced a syphon composed of 56 places in 390 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1617 place count 233 transition count 356620
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1618 place count 233 transition count 356619
Performed 11 Post agglomeration using F-continuation condition.
Performed 15 Post agglomeration using F-continuation condition.
Performed 19 Post agglomeration using F-continuation condition.
Performed 23 Post agglomeration using F-continuation condition.
Performed 27 Post agglomeration using F-continuation condition.
Performed 31 Post agglomeration using F-continuation condition.
Performed 35 Post agglomeration using F-continuation condition.
Performed 41 Post agglomeration using F-continuation condition.
Performed 44 Post agglomeration using F-continuation condition.
Performed 48 Post agglomeration using F-continuation condition.
Performed 52 Post agglomeration using F-continuation condition.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 232 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 1730 place count 177 transition count 356563
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1750 place count 177 transition count 356543
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 1792 place count 135 transition count 7327
Iterating global reduction 6 with 42 rules applied. Total rules applied 1834 place count 135 transition count 7327
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1856 place count 135 transition count 7305
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1865 place count 126 transition count 7296
Iterating global reduction 7 with 9 rules applied. Total rules applied 1874 place count 126 transition count 7296
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1896 place count 115 transition count 7285
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1910 place count 108 transition count 7301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1911 place count 108 transition count 7300
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1921 place count 108 transition count 7290
Free-agglomeration rule applied 57 times.
Iterating global reduction 8 with 57 rules applied. Total rules applied 1978 place count 108 transition count 7233
Reduce places removed 57 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 8 with 570 rules applied. Total rules applied 2548 place count 51 transition count 6720
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 2558 place count 41 transition count 6710
Iterating global reduction 9 with 10 rules applied. Total rules applied 2568 place count 41 transition count 6710
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 9 with 511 rules applied. Total rules applied 3079 place count 41 transition count 6199
Drop transitions removed 1023 transitions
Redundant transition composition rules discarded 1023 transitions
Iterating global reduction 10 with 1023 rules applied. Total rules applied 4102 place count 41 transition count 5176
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 4104 place count 41 transition count 5176
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 4106 place count 41 transition count 5174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 4110 place count 39 transition count 5172
Applied a total of 4110 rules in 1198532 ms. Remains 39 /1195 variables (removed 1156) and now considering 5172/357646 (removed 352474) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1198536 ms. Remains : 39/1195 places, 5172/357646 transitions.
Computed a total of 165 stabilizing places and 176 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' '!(X(X(X((p0 U (p1||G(p0)))))))'
Support contains 3 out of 1195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1195/1195 places, 357646/357646 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1194 transition count 357645
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1194 transition count 357645
Applied a total of 2 rules in 30520 ms. Remains 1194 /1195 variables (removed 1) and now considering 357645/357646 (removed 1) transitions.
// Phase 1: matrix 357645 rows 1194 cols
[2023-03-23 23:54:30] [INFO ] Computed 12 place invariants in 15604 ms
[2023-03-23 23:55:01] [INFO ] Performed 254/1194 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2023-03-23 23:55:32] [INFO ] Performed 502/1194 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2023-03-23 23:56:03] [INFO ] Performed 784/1194 implicitness test of which 0 returned IMPLICIT in 93 seconds.
[2023-03-23 23:56:35] [INFO ] Performed 1032/1194 implicitness test of which 0 returned IMPLICIT in 125 seconds.
[2023-03-23 23:56:35] [INFO ] Timeout of Implicit test with SMT after 125 seconds.
[2023-03-23 23:56:35] [INFO ] Implicit Places using invariants in 141430 ms returned []
Implicit Place search using SMT only with invariants took 141431 ms to find 0 implicit places.
[2023-03-23 23:56:36] [INFO ] Invariant cache hit.
[2023-03-23 23:57:06] [INFO ] Performed 33973/357645 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 23:57:36] [INFO ] Dead Transitions using invariants and state equation in 60470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1194/1195 places, 357645/357646 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232446 ms. Remains : 1194/1195 places, 357645/357646 transitions.
Stuttering acceptance computed with spot in 471 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-11b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (EQ s16 1) (OR (EQ s650 0) (EQ s63 1))), p0:(OR (EQ s650 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 38 ms.
FORMULA StigmergyElection-PT-11b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11b-LTLCardinality-00 finished in 235310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 1195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1195/1195 places, 357646/357646 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1192 transition count 357643
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1192 transition count 357643
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1191 transition count 357642
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1191 transition count 357642
Applied a total of 8 rules in 47957 ms. Remains 1191 /1195 variables (removed 4) and now considering 357642/357646 (removed 4) transitions.
// Phase 1: matrix 357642 rows 1191 cols
[2023-03-23 23:58:41] [INFO ] Computed 12 place invariants in 14288 ms
[2023-03-23 23:59:12] [INFO ] Performed 251/1191 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 23:59:43] [INFO ] Performed 499/1191 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2023-03-24 00:00:14] [INFO ] Performed 781/1191 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2023-03-24 00:00:44] [INFO ] Performed 1056/1191 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2023-03-24 00:00:44] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2023-03-24 00:00:44] [INFO ] Implicit Places using invariants in 137416 ms returned []
Implicit Place search using SMT only with invariants took 137419 ms to find 0 implicit places.
[2023-03-24 00:00:45] [INFO ] Invariant cache hit.
[2023-03-24 00:01:15] [INFO ] Performed 29088/357642 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-24 00:01:45] [INFO ] Dead Transitions using invariants and state equation in 60468 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1191/1195 places, 357642/357646 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245863 ms. Remains : 1191/1195 places, 357642/357646 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-11b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s815 0) (EQ s1012 1)), p1:(OR (EQ s923 0) (EQ s788 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 30500 steps with 15250 reset in 10001 ms.
Product exploration timeout after 31210 steps with 15605 reset in 10002 ms.
Computed a total of 165 stabilizing places and 176 stable transitions
Computed a total of 165 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-11b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-11b-LTLCardinality-03 finished in 277358 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) U (G(F(p0))||(!p1&&X(X(p2)))))))'
Support contains 5 out of 1195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1195/1195 places, 357646/357646 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1193 transition count 357644
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1193 transition count 357644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1192 transition count 357643
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1192 transition count 357643
Applied a total of 6 rules in 44230 ms. Remains 1192 /1195 variables (removed 3) and now considering 357643/357646 (removed 3) transitions.
// Phase 1: matrix 357643 rows 1192 cols
[2023-03-24 00:03:15] [INFO ] Computed 12 place invariants in 14525 ms
[2023-03-24 00:03:46] [INFO ] Performed 251/1192 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-24 00:04:16] [INFO ] Performed 499/1192 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-24 00:04:47] [INFO ] Performed 771/1192 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2023-03-24 00:05:18] [INFO ] Performed 1019/1192 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2023-03-24 00:05:18] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2023-03-24 00:05:18] [INFO ] Implicit Places using invariants in 137464 ms returned []
Implicit Place search using SMT only with invariants took 137466 ms to find 0 implicit places.
[2023-03-24 00:05:18] [INFO ] Invariant cache hit.
[2023-03-24 00:05:49] [INFO ] Performed 33225/357643 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-24 00:06:18] [INFO ] Dead Transitions using invariants and state equation in 60463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1192/1195 places, 357643/357646 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242173 ms. Remains : 1192/1195 places, 357643/357646 transitions.
Stuttering acceptance computed with spot in 701 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}, { cond=p0, acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 11}], [{ cond=(NOT p2), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 12}], [{ cond=true, acceptance={} source=11 dest: 11}, { cond=(NOT p0), acceptance={} source=11 dest: 12}], [{ cond=(NOT p0), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p1:(OR (EQ s835 0) (EQ s287 1)), p0:(OR (EQ s683 0) (EQ s725 1)), p2:(NEQ s542 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 45400 steps with 250 reset in 10001 ms.
Product exploration timeout after 46500 steps with 251 reset in 10002 ms.
Computed a total of 165 stabilizing places and 176 stable transitions
Computed a total of 165 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 602 ms. Reduced automaton from 13 states, 32 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1653 steps, including 8 resets, run visited all 1 properties in 508 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 401 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1192/1192 places, 357643/357643 transitions.
Graph (trivial) has 1215 edges and 1192 vertex of which 187 / 1192 are part of one of the 33 SCC in 15 ms
Free SCC test removed 154 places
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 705 transitions
Trivial Post-agglo rules discarded 705 transitions
Performed 705 trivial Post agglomeration. Transition count delta: 705
Iterating post reduction 0 with 705 rules applied. Total rules applied 706 place count 1037 transition count 356761
Reduce places removed 705 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 725 rules applied. Total rules applied 1431 place count 332 transition count 356741
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 1443 place count 322 transition count 356739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1445 place count 320 transition count 356739
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1445 place count 320 transition count 356693
Deduced a syphon composed of 46 places in 344 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1537 place count 274 transition count 356693
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1547 place count 264 transition count 356683
Iterating global reduction 4 with 10 rules applied. Total rules applied 1557 place count 264 transition count 356683
Performed 11 Post agglomeration using F-continuation condition.
Performed 15 Post agglomeration using F-continuation condition.
Performed 19 Post agglomeration using F-continuation condition.
Performed 23 Post agglomeration using F-continuation condition.
Performed 27 Post agglomeration using F-continuation condition.
Performed 31 Post agglomeration using F-continuation condition.
Performed 35 Post agglomeration using F-continuation condition.
Performed 39 Post agglomeration using F-continuation condition.
Performed 42 Post agglomeration using F-continuation condition.
Performed 46 Post agglomeration using F-continuation condition.
Performed 50 Post agglomeration using F-continuation condition.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 172 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1663 place count 211 transition count 356630
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 523964 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15726208 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="StigmergyElection-PT-11b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyElection-PT-11b, 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 r457-smll-167912649700707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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