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

About the Execution of ITS-Tools for StigmergyCommit-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16224.527 1001995.00 2084648.00 18464.60 TFTFFTFTTFTFFFFF 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.r453-smll-167912645500470.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 itstools
Input is StigmergyCommit-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645500470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 10:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:12 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 3.7M 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 StigmergyCommit-PT-06b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679357058389

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-21 00:04:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 00:04:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:04:21] [INFO ] Load time of PNML (sax parser for PT used): 597 ms
[2023-03-21 00:04:21] [INFO ] Transformed 2140 places.
[2023-03-21 00:04:21] [INFO ] Transformed 6760 transitions.
[2023-03-21 00:04:21] [INFO ] Found NUPN structural information;
[2023-03-21 00:04:21] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 924 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 78 resets, run finished after 961 ms. (steps per millisecond=10 ) properties (out of 15) seen :2
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
[2023-03-21 00:04:24] [INFO ] Flatten gal took : 1231 ms
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 6760 rows 2140 cols
[2023-03-21 00:04:24] [INFO ] Flatten gal took : 808 ms
[2023-03-21 00:04:25] [INFO ] Computed 8 place invariants in 308 ms
[2023-03-21 00:04:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11139690084386451602.gal : 205 ms
[2023-03-21 00:04:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2726973626160223432.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11139690084386451602.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2726973626160223432.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2023-03-21 00:04:27] [INFO ] After 1684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-21 00:04:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 28 ms returned sat
Loading property file /tmp/ReachabilityCardinality2726973626160223432.prop.
[2023-03-21 00:04:36] [INFO ] After 7395ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :7
[2023-03-21 00:04:41] [INFO ] Deduced a trap composed of 401 places in 4380 ms of which 33 ms to minimize.
[2023-03-21 00:04:46] [INFO ] Deduced a trap composed of 400 places in 4928 ms of which 3 ms to minimize.
[2023-03-21 00:04:51] [INFO ] Deduced a trap composed of 402 places in 4326 ms of which 3 ms to minimize.
[2023-03-21 00:04:55] [INFO ] Deduced a trap composed of 401 places in 3930 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.Application.startNoEx(Application.java:902)
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-21 00:04:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 00:04:55] [INFO ] After 28215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 329 ms.
Support contains 100 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Graph (trivial) has 1946 edges and 2140 vertex of which 127 / 2140 are part of one of the 19 SCC in 18 ms
Free SCC test removed 108 places
Drop transitions removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 3348 edges and 2032 vertex of which 2018 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.52 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1419 transitions
Trivial Post-agglo rules discarded 1419 transitions
Performed 1419 trivial Post agglomeration. Transition count delta: 1419
Iterating post reduction 0 with 1426 rules applied. Total rules applied 1428 place count 2018 transition count 5189
Reduce places removed 1419 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 1452 rules applied. Total rules applied 2880 place count 599 transition count 5156
Reduce places removed 13 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 2 with 80 rules applied. Total rules applied 2960 place count 586 transition count 5089
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 69 rules applied. Total rules applied 3029 place count 519 transition count 5087
Reduce places removed 1 places and 0 transitions.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 2
Iterating post reduction 4 with 1 rules applied. Total rules applied 3030 place count 518 transition count 5087
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :2 after 7
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 79 Pre rules applied. Total rules applied 3030 place count 518 transition count 5008
Deduced a syphon composed of 79 places in 4 ms
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :7 after 10
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 5 with 158 rules applied. Total rules applied 3188 place count 439 transition count 5008
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :14 after 20
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :20 after 22
Discarding 62 places :
Symmetric choice reduction at 5 with 62 rule applications. Total rules 3250 place count 377 transition count 4946
Iterating global reduction 5 with 62 rules applied. Total rules applied 3312 place count 377 transition count 4946
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :22 after 228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3312 place count 377 transition count 4945
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3314 place count 376 transition count 4945
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :228 after 4439
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 3339 place count 351 transition count 1104
Iterating global reduction 5 with 25 rules applied. Total rules applied 3364 place count 351 transition count 1104
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3372 place count 351 transition count 1096
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3376 place count 347 transition count 1092
Iterating global reduction 6 with 4 rules applied. Total rules applied 3380 place count 347 transition count 1092
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3384 place count 343 transition count 1088
Iterating global reduction 6 with 4 rules applied. Total rules applied 3388 place count 343 transition count 1088
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3390 place count 343 transition count 1086
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 3446 place count 315 transition count 1058
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3452 place count 309 transition count 1052
Iterating global reduction 7 with 6 rules applied. Total rules applied 3458 place count 309 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3462 place count 305 transition count 1048
Iterating global reduction 7 with 4 rules applied. Total rules applied 3466 place count 305 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 3469 place count 302 transition count 1045
Iterating global reduction 7 with 3 rules applied. Total rules applied 3472 place count 302 transition count 1045
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3474 place count 301 transition count 1048
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 3481 place count 301 transition count 1041
Free-agglomeration rule applied 59 times.
Iterating global reduction 7 with 59 rules applied. Total rules applied 3540 place count 301 transition count 982
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 7 with 59 rules applied. Total rules applied 3599 place count 242 transition count 982
Drop transitions removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 8 with 119 rules applied. Total rules applied 3718 place count 242 transition count 863
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 3722 place count 242 transition count 863
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3725 place count 242 transition count 860
Applied a total of 3725 rules in 1989 ms. Remains 242 /2140 variables (removed 1898) and now considering 860/6760 (removed 5900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1991 ms. Remains : 242/2140 places, 860/6760 transitions.
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :4439 after 37184
Incomplete random walk after 10000 steps, including 409 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 7) seen :3
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :37184 after 38398
// Phase 1: matrix 860 rows 242 cols
[2023-03-21 00:04:58] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-21 00:04:58] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 00:04:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :38398 after 39690
[2023-03-21 00:04:59] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 00:04:59] [INFO ] State equation strengthened by 491 read => feed constraints.
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :39690 after 141188
[2023-03-21 00:04:59] [INFO ] After 458ms SMT Verify possible using 491 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 00:05:00] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 1 ms to minimize.
[2023-03-21 00:05:00] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 1 ms to minimize.
[2023-03-21 00:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 735 ms
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :141188 after 759388
[2023-03-21 00:05:01] [INFO ] Deduced a trap composed of 45 places in 520 ms of which 1 ms to minimize.
[2023-03-21 00:05:01] [INFO ] Deduced a trap composed of 31 places in 444 ms of which 2 ms to minimize.
[2023-03-21 00:05:01] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 1 ms to minimize.
[2023-03-21 00:05:02] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 0 ms to minimize.
[2023-03-21 00:05:02] [INFO ] Deduced a trap composed of 40 places in 326 ms of which 1 ms to minimize.
[2023-03-21 00:05:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2261 ms
[2023-03-21 00:05:03] [INFO ] Deduced a trap composed of 44 places in 422 ms of which 1 ms to minimize.
[2023-03-21 00:05:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2023-03-21 00:05:04] [INFO ] Deduced a trap composed of 48 places in 462 ms of which 1 ms to minimize.
[2023-03-21 00:05:04] [INFO ] Deduced a trap composed of 33 places in 421 ms of which 0 ms to minimize.
[2023-03-21 00:05:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1013 ms
[2023-03-21 00:05:04] [INFO ] After 5384ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 282 ms.
[2023-03-21 00:05:04] [INFO ] After 6427ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 48 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 860/860 transitions.
Graph (trivial) has 100 edges and 242 vertex of which 4 / 242 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 240 transition count 815
Reduce places removed 41 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 199 transition count 812
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 196 transition count 812
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 89 place count 196 transition count 805
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 103 place count 189 transition count 805
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 113 place count 179 transition count 795
Iterating global reduction 3 with 10 rules applied. Total rules applied 123 place count 179 transition count 795
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 177 transition count 793
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 177 transition count 793
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 176 transition count 792
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 176 transition count 792
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 149 place count 166 transition count 782
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 151 place count 166 transition count 780
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 160 place count 157 transition count 771
Iterating global reduction 4 with 9 rules applied. Total rules applied 169 place count 157 transition count 771
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 174 place count 152 transition count 766
Iterating global reduction 4 with 5 rules applied. Total rules applied 179 place count 152 transition count 766
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 182 place count 149 transition count 763
Iterating global reduction 4 with 3 rules applied. Total rules applied 185 place count 149 transition count 763
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 186 place count 149 transition count 762
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 148 transition count 765
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 207 place count 148 transition count 746
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 217 place count 148 transition count 736
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 228 place count 138 transition count 735
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 235 place count 131 transition count 728
Iterating global reduction 6 with 7 rules applied. Total rules applied 242 place count 131 transition count 728
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 247 place count 131 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 248 place count 131 transition count 727
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 131 transition count 726
Applied a total of 249 rules in 423 ms. Remains 131 /242 variables (removed 111) and now considering 726/860 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 131/242 places, 726/860 transitions.
Incomplete random walk after 10000 steps, including 242 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :759388 after 1.74159e+08
Interrupted probabilistic random walk after 606409 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 606409 steps, saw 100078 distinct states, run finished after 3004 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 726 rows 131 cols
[2023-03-21 00:05:08] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-21 00:05:08] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 00:05:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-21 00:05:09] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 00:05:09] [INFO ] State equation strengthened by 578 read => feed constraints.
[2023-03-21 00:05:10] [INFO ] After 554ms SMT Verify possible using 578 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 00:05:10] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 1 ms to minimize.
[2023-03-21 00:05:10] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 0 ms to minimize.
[2023-03-21 00:05:11] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 0 ms to minimize.
[2023-03-21 00:05:11] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 1 ms to minimize.
[2023-03-21 00:05:11] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 0 ms to minimize.
[2023-03-21 00:05:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1611 ms
[2023-03-21 00:05:12] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 1 ms to minimize.
[2023-03-21 00:05:12] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2023-03-21 00:05:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 601 ms
[2023-03-21 00:05:12] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 1 ms to minimize.
[2023-03-21 00:05:13] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 1 ms to minimize.
[2023-03-21 00:05:13] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 1 ms to minimize.
[2023-03-21 00:05:13] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 1 ms to minimize.
[2023-03-21 00:05:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1371 ms
[2023-03-21 00:05:13] [INFO ] After 4457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 330 ms.
[2023-03-21 00:05:14] [INFO ] After 5390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 48 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 726/726 transitions.
Applied a total of 0 rules in 51 ms. Remains 131 /131 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 131/131 places, 726/726 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 726/726 transitions.
Applied a total of 0 rules in 45 ms. Remains 131 /131 variables (removed 0) and now considering 726/726 (removed 0) transitions.
[2023-03-21 00:05:14] [INFO ] Invariant cache hit.
[2023-03-21 00:05:14] [INFO ] Implicit Places using invariants in 194 ms returned [130]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/131 places, 726/726 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 130 transition count 721
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 125 transition count 718
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 122 transition count 718
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 16 place count 122 transition count 713
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 117 transition count 713
Performed 20 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 66 place count 97 transition count 601
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 83 place count 97 transition count 584
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 95 transition count 296
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 95 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 94 transition count 301
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 118 place count 94 transition count 272
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 94 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 92 transition count 270
Applied a total of 122 rules in 82 ms. Remains 92 /130 variables (removed 38) and now considering 270/726 (removed 456) transitions.
// Phase 1: matrix 270 rows 92 cols
[2023-03-21 00:05:14] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-21 00:05:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-21 00:05:14] [INFO ] Invariant cache hit.
[2023-03-21 00:05:14] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-21 00:05:14] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 92/131 places, 270/726 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 621 ms. Remains : 92/131 places, 270/726 transitions.
Incomplete random walk after 10000 steps, including 323 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-04 does not hold.
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :1.74159e+08 after 1.63172e+09
Interrupted probabilistic random walk after 1058135 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :{}
Probabilistic random walk after 1058135 steps, saw 151637 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 00:05:18] [INFO ] Invariant cache hit.
[2023-03-21 00:05:18] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 00:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-21 00:05:18] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 00:05:18] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-21 00:05:18] [INFO ] After 113ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 00:05:18] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-21 00:05:18] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2023-03-21 00:05:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 377 ms
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 7 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 409 ms
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2023-03-21 00:05:19] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2023-03-21 00:05:20] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2023-03-21 00:05:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 584 ms
[2023-03-21 00:05:20] [INFO ] After 1549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-21 00:05:20] [INFO ] After 1847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 48 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 270/270 transitions.
Applied a total of 0 rules in 22 ms. Remains 92 /92 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 92/92 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 270/270 transitions.
Applied a total of 0 rules in 10 ms. Remains 92 /92 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-21 00:05:20] [INFO ] Invariant cache hit.
[2023-03-21 00:05:20] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-21 00:05:20] [INFO ] Invariant cache hit.
[2023-03-21 00:05:20] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-21 00:05:20] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-21 00:05:20] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-21 00:05:20] [INFO ] Invariant cache hit.
[2023-03-21 00:05:20] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 92/92 places, 270/270 transitions.
Graph (trivial) has 7 edges and 92 vertex of which 2 / 92 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 18 ms. Remains 91 /92 variables (removed 1) and now considering 268/270 (removed 2) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 268 rows 91 cols
[2023-03-21 00:05:20] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-21 00:05:20] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 00:05:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-21 00:05:21] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 00:05:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 00:05:21] [INFO ] After 58ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 00:05:21] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-21 00:05:21] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2023-03-21 00:05:21] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2023-03-21 00:05:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 301 ms
[2023-03-21 00:05:21] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-21 00:05:21] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 00:05:21] [INFO ] Flatten gal took : 23 ms
[2023-03-21 00:05:21] [INFO ] Flatten gal took : 18 ms
[2023-03-21 00:05:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6396753413585550124.gal : 7 ms
[2023-03-21 00:05:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8772700028643576047.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6396753413585550124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8772700028643576047.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8772700028643576047.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 29
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :29 after 40
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :40 after 905
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :905 after 993
Reachability property StigmergyCommit-PT-06b-ReachabilityCardinality-10 is true.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :993 after 7589
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7589 after 43639
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :43639 after 320536
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :320536 after 408409
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-15 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :408409 after 695768
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-13 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.33279e+06,0.617705,19968,2,5294,18,50824,6,0,634,35430,0
Total reachable state count : 2332787

Verifying 3 reachability properties.
Reachability property StigmergyCommit-PT-06b-ReachabilityCardinality-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-06b-ReachabilityCardinality-10,180,0.61948,20232,2,168,18,50824,7,0,653,35430,0
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-13 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-06b-ReachabilityCardinality-13,20332,0.620485,20232,2,653,18,50824,8,0,662,35430,0
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-06b-ReachabilityCardinality-15,252,0.623436,20232,2,210,18,50824,9,0,725,35430,0
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 00:05:22] [INFO ] Flatten gal took : 493 ms
[2023-03-21 00:05:22] [INFO ] Applying decomposition
[2023-03-21 00:05:23] [INFO ] Flatten gal took : 416 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11034817244150585994.txt' '-o' '/tmp/graph11034817244150585994.bin' '-w' '/tmp/graph11034817244150585994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11034817244150585994.bin' '-l' '-1' '-v' '-w' '/tmp/graph11034817244150585994.weights' '-q' '0' '-e' '0.001'
[2023-03-21 00:05:25] [INFO ] Decomposing Gal with order
[2023-03-21 00:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 00:05:28] [INFO ] Removed a total of 31827 redundant transitions.
[2023-03-21 00:05:28] [INFO ] Flatten gal took : 1300 ms
[2023-03-21 00:05:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 328 ms.
[2023-03-21 00:05:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12692858353478879174.gal : 71 ms
[2023-03-21 00:05:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3678146748678783406.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12692858353478879174.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3678146748678783406.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3678146748678783406.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3 after 562
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :1.63172e+09 after 4.22247e+09
SDD proceeding with computation,12 properties remain. new max is 131072
SDD size :4.22247e+09 after 5.5642e+09
SDD proceeding with computation,12 properties remain. new max is 262144
SDD size :5.5642e+09 after 9.18396e+09
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.20898e+15 after 2.66084e+15
ITS-tools command line returned an error code 137
[2023-03-21 00:20:53] [INFO ] Flatten gal took : 553 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16776725281971576848
[2023-03-21 00:20:54] [INFO ] Applying decomposition
[2023-03-21 00:20:54] [INFO ] Flatten gal took : 678 ms
[2023-03-21 00:20:55] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2023-03-21 00:20:55] [INFO ] Computation of Complete disable matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 00:20:55] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2023-03-21 00:20:55] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 00:20:55] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2023-03-21 00:20:55] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 00:20:55] [INFO ] Built C files in 919ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16776725281971576848
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6826974125203170217.txt' '-o' '/tmp/graph6826974125203170217.bin' '-w' '/tmp/graph6826974125203170217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6826974125203170217.bin' '-l' '-1' '-v' '-w' '/tmp/graph6826974125203170217.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin16776725281971576848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-21 00:20:56] [INFO ] Decomposing Gal with order
[2023-03-21 00:20:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 00:20:56] [INFO ] Removed a total of 1328 redundant transitions.
[2023-03-21 00:20:57] [INFO ] Flatten gal took : 673 ms
[2023-03-21 00:20:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 132 ms.
[2023-03-21 00:20:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12128805781770190603.gal : 34 ms
[2023-03-21 00:20:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6926423079804169542.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12128805781770190603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6926423079804169542.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6926423079804169542.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 38531
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :674047 after 674071
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-15 does not hold.
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-13 does not hold.
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property StigmergyCommit-PT-06b-ReachabilityCardinality-10 is true.
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.14288e+06,0.181019,5448,247,22,1665,186,468,1916,58,342,0
Total reachable state count : 2142877

Verifying 3 reachability properties.
Reachability property StigmergyCommit-PT-06b-ReachabilityCardinality-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-06b-ReachabilityCardinality-10,150,0.184761,5448,50,16,1665,186,503,1916,68,342,0
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-13 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-06b-ReachabilityCardinality-13,10500,0.196043,5448,67,19,1665,186,515,1916,69,342,0
Invariant property StigmergyCommit-PT-06b-ReachabilityCardinality-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-06b-ReachabilityCardinality-15,91728,0.199191,5448,71,20,1665,186,653,1916,77,342,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 997117 ms.

BK_STOP 1679358060384

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="StigmergyCommit-PT-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-06b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645500470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06b.tgz
mv StigmergyCommit-PT-06b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;