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.r517-tall-167987243300070.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 Anderson-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 31 16:48 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 Anderson-PT-12-ReachabilityCardinality-00
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-01
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-02
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-03
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-04
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-05
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-06
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-07
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-08
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-09
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-10
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-11
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-12
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-13
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-14
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680852195709

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=Anderson-PT-12
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202304061127
[2023-04-07 07:23:17] [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-04-07 07:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 07:23:17] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-04-07 07:23:17] [INFO ] Transformed 889 places.
[2023-04-07 07:23:17] [INFO ] Transformed 4152 transitions.
[2023-04-07 07:23:17] [INFO ] Found NUPN structural information;
[2023-04-07 07:23:17] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 14) seen :7
FORMULA Anderson-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
[2023-04-07 07:23:18] [INFO ] Flatten gal took : 744 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 4152 rows 889 cols
[2023-04-07 07:23:18] [INFO ] Flatten gal took : 310 ms
[2023-04-07 07:23:18] [INFO ] Computed 27 invariants in 114 ms
[2023-04-07 07:23:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11873433027963265922.gal : 64 ms
[2023-04-07 07:23:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16433721986083896235.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11873433027963265922.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16433721986083896235.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16433721986083896235.prop.
[2023-04-07 07:23:20] [INFO ] After 1409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 07:23:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-04-07 07:23:20] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 23 ms returned sat
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :9 after 13
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :13 after 50
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :50 after 63
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :63 after 73
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :73 after 328
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :328 after 534
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :534 after 3610
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :3610 after 9038
[2023-04-07 07:23:28] [INFO ] After 7721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 07:23:28] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:23:32] [INFO ] After 4232ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 07:23:35] [INFO ] Deduced a trap composed of 279 places in 660 ms of which 9 ms to minimize.
[2023-04-07 07:23:36] [INFO ] Deduced a trap composed of 135 places in 675 ms of which 2 ms to minimize.
[2023-04-07 07:23:36] [INFO ] Deduced a trap composed of 138 places in 651 ms of which 1 ms to minimize.
[2023-04-07 07:23:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2413 ms
[2023-04-07 07:23:37] [INFO ] Deduced a trap composed of 163 places in 609 ms of which 2 ms to minimize.
[2023-04-07 07:23:38] [INFO ] Deduced a trap composed of 215 places in 621 ms of which 0 ms to minimize.
[2023-04-07 07:23:39] [INFO ] Deduced a trap composed of 358 places in 604 ms of which 1 ms to minimize.
[2023-04-07 07:23:39] [INFO ] Deduced a trap composed of 163 places in 618 ms of which 1 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :9038 after 60038
[2023-04-07 07:23:40] [INFO ] Deduced a trap composed of 333 places in 621 ms of which 1 ms to minimize.
[2023-04-07 07:23:41] [INFO ] Deduced a trap composed of 218 places in 616 ms of which 1 ms to minimize.
[2023-04-07 07:23:42] [INFO ] Deduced a trap composed of 134 places in 617 ms of which 1 ms to minimize.
[2023-04-07 07:23:42] [INFO ] Deduced a trap composed of 279 places in 613 ms of which 1 ms to minimize.
[2023-04-07 07:23:43] [INFO ] Deduced a trap composed of 198 places in 616 ms of which 1 ms to minimize.
[2023-04-07 07:23:44] [INFO ] Deduced a trap composed of 216 places in 645 ms of which 1 ms to minimize.
[2023-04-07 07:23:45] [INFO ] Deduced a trap composed of 338 places in 648 ms of which 1 ms to minimize.
[2023-04-07 07:23:46] [INFO ] Deduced a trap composed of 255 places in 704 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 07:23:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-07 07:23:46] [INFO ] After 25638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 99 ms.
Support contains 90 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 97 Pre rules applied. Total rules applied 0 place count 889 transition count 4055
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 792 transition count 4055
Discarding 225 places :
Symmetric choice reduction at 0 with 225 rule applications. Total rules 419 place count 567 transition count 1234
Iterating global reduction 0 with 225 rules applied. Total rules applied 644 place count 567 transition count 1234
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 684 place count 547 transition count 1214
Applied a total of 684 rules in 456 ms. Remains 547 /889 variables (removed 342) and now considering 1214/4152 (removed 2938) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 547/889 places, 1214/4152 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1214 rows 547 cols
[2023-04-07 07:23:47] [INFO ] Computed 27 invariants in 104 ms
[2023-04-07 07:23:47] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 07:23:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-04-07 07:23:47] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 25 ms returned sat
[2023-04-07 07:23:49] [INFO ] After 1402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 07:23:49] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:23:49] [INFO ] After 839ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 07:23:50] [INFO ] Deduced a trap composed of 276 places in 276 ms of which 0 ms to minimize.
[2023-04-07 07:23:50] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 0 ms to minimize.
[2023-04-07 07:23:51] [INFO ] Deduced a trap composed of 192 places in 465 ms of which 1 ms to minimize.
[2023-04-07 07:23:51] [INFO ] Deduced a trap composed of 112 places in 417 ms of which 0 ms to minimize.
[2023-04-07 07:23:52] [INFO ] Deduced a trap composed of 258 places in 456 ms of which 0 ms to minimize.
[2023-04-07 07:23:52] [INFO ] Deduced a trap composed of 308 places in 448 ms of which 5 ms to minimize.
[2023-04-07 07:23:53] [INFO ] Deduced a trap composed of 282 places in 269 ms of which 1 ms to minimize.
[2023-04-07 07:23:53] [INFO ] Deduced a trap composed of 286 places in 457 ms of which 2 ms to minimize.
[2023-04-07 07:23:54] [INFO ] Deduced a trap composed of 93 places in 423 ms of which 2 ms to minimize.
[2023-04-07 07:23:54] [INFO ] Deduced a trap composed of 194 places in 540 ms of which 1 ms to minimize.
[2023-04-07 07:23:55] [INFO ] Deduced a trap composed of 78 places in 461 ms of which 1 ms to minimize.
[2023-04-07 07:23:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5255 ms
[2023-04-07 07:23:55] [INFO ] After 6861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 572 ms.
[2023-04-07 07:23:56] [INFO ] After 9135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 62 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1214/1214 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 547 transition count 1211
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 544 transition count 1211
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 14 place count 536 transition count 1093
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 536 transition count 1093
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 18 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 32 place count 531 transition count 1088
Applied a total of 32 rules in 157 ms. Remains 531 /547 variables (removed 16) and now considering 1088/1214 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 531/547 places, 1088/1214 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 234763 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{3=1}
Probabilistic random walk after 234763 steps, saw 179512 distinct states, run finished after 3003 ms. (steps per millisecond=78 ) properties seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 1088 rows 531 cols
[2023-04-07 07:24:00] [INFO ] Computed 27 invariants in 26 ms
[2023-04-07 07:24:00] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 07:24:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-04-07 07:24:00] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 30 ms returned sat
[2023-04-07 07:24:01] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 07:24:01] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:24:02] [INFO ] After 571ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 07:24:02] [INFO ] Deduced a trap composed of 159 places in 237 ms of which 1 ms to minimize.
[2023-04-07 07:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-04-07 07:24:02] [INFO ] After 1367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 403 ms.
[2023-04-07 07:24:03] [INFO ] After 2791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 47 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 1088/1088 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 531 transition count 1085
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 528 transition count 1085
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 523 transition count 992
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 523 transition count 992
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 518 transition count 987
Applied a total of 26 rules in 58 ms. Remains 518 /531 variables (removed 13) and now considering 987/1088 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 518/531 places, 987/1088 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 987 rows 518 cols
[2023-04-07 07:24:03] [INFO ] Computed 27 invariants in 10 ms
[2023-04-07 07:24:03] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 07:24:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-04-07 07:24:03] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 18 ms returned sat
[2023-04-07 07:24:04] [INFO ] After 881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 07:24:04] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:24:05] [INFO ] After 404ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 07:24:05] [INFO ] After 738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 230 ms.
[2023-04-07 07:24:05] [INFO ] After 1991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 33 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 987/987 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 518 transition count 984
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 515 transition count 984
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 512 transition count 915
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 512 transition count 915
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 509 transition count 912
Applied a total of 18 rules in 57 ms. Remains 509 /518 variables (removed 9) and now considering 912/987 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 509/518 places, 912/987 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 372123 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 372123 steps, saw 289181 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 912 rows 509 cols
[2023-04-07 07:24:08] [INFO ] Computed 27 invariants in 24 ms
[2023-04-07 07:24:09] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 07:24:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-04-07 07:24:09] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 15 ms returned sat
[2023-04-07 07:24:09] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 07:24:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:24:10] [INFO ] After 436ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 07:24:10] [INFO ] Deduced a trap composed of 223 places in 227 ms of which 1 ms to minimize.
[2023-04-07 07:24:10] [INFO ] Deduced a trap composed of 237 places in 220 ms of which 1 ms to minimize.
[2023-04-07 07:24:11] [INFO ] Deduced a trap composed of 119 places in 231 ms of which 0 ms to minimize.
[2023-04-07 07:24:11] [INFO ] Deduced a trap composed of 264 places in 217 ms of which 1 ms to minimize.
[2023-04-07 07:24:11] [INFO ] Deduced a trap composed of 274 places in 235 ms of which 0 ms to minimize.
[2023-04-07 07:24:11] [INFO ] Deduced a trap composed of 272 places in 265 ms of which 1 ms to minimize.
[2023-04-07 07:24:12] [INFO ] Deduced a trap composed of 265 places in 209 ms of which 1 ms to minimize.
[2023-04-07 07:24:12] [INFO ] Deduced a trap composed of 263 places in 208 ms of which 0 ms to minimize.
[2023-04-07 07:24:12] [INFO ] Deduced a trap composed of 124 places in 226 ms of which 1 ms to minimize.
[2023-04-07 07:24:12] [INFO ] Deduced a trap composed of 207 places in 213 ms of which 2 ms to minimize.
[2023-04-07 07:24:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2727 ms
[2023-04-07 07:24:13] [INFO ] After 3476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-04-07 07:24:13] [INFO ] After 4363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Anderson-PT-12-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Support contains 31 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 912/912 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 509 transition count 911
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 508 transition count 911
Applied a total of 2 rules in 24 ms. Remains 508 /509 variables (removed 1) and now considering 911/912 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 508/509 places, 911/912 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :60038 after 379282
Interrupted probabilistic random walk after 852806 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 852806 steps, saw 652529 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 911 rows 508 cols
[2023-04-07 07:24:16] [INFO ] Computed 27 invariants in 13 ms
[2023-04-07 07:24:16] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 07:24:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-04-07 07:24:16] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 16 ms returned sat
[2023-04-07 07:24:17] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 07:24:17] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:24:17] [INFO ] After 303ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 07:24:17] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-04-07 07:24:18] [INFO ] After 1415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 911/911 transitions.
Applied a total of 0 rules in 17 ms. Remains 508 /508 variables (removed 0) and now considering 911/911 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 508/508 places, 911/911 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 911/911 transitions.
Applied a total of 0 rules in 62 ms. Remains 508 /508 variables (removed 0) and now considering 911/911 (removed 0) transitions.
[2023-04-07 07:24:18] [INFO ] Invariant cache hit.
[2023-04-07 07:24:18] [INFO ] Implicit Places using invariants in 565 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 568 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 507/508 places, 911/911 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 507 transition count 802
Reduce places removed 109 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 127 rules applied. Total rules applied 236 place count 398 transition count 784
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 254 place count 380 transition count 784
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 266 place count 380 transition count 772
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 278 place count 368 transition count 772
Applied a total of 278 rules in 38 ms. Remains 368 /507 variables (removed 139) and now considering 772/911 (removed 139) transitions.
// Phase 1: matrix 772 rows 368 cols
[2023-04-07 07:24:18] [INFO ] Computed 26 invariants in 10 ms
[2023-04-07 07:24:19] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-04-07 07:24:19] [INFO ] Invariant cache hit.
[2023-04-07 07:24:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:24:20] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 368/508 places, 772/911 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2396 ms. Remains : 368/508 places, 772/911 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 905318 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 905318 steps, saw 677053 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 07:24:23] [INFO ] Invariant cache hit.
[2023-04-07 07:24:23] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 07:24:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-04-07 07:24:23] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 07:24:24] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 07:24:24] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:24:24] [INFO ] After 193ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 07:24:24] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 0 ms to minimize.
[2023-04-07 07:24:24] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 1 ms to minimize.
[2023-04-07 07:24:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2023-04-07 07:24:24] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-04-07 07:24:25] [INFO ] After 1489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 772/772 transitions.
Applied a total of 0 rules in 18 ms. Remains 368 /368 variables (removed 0) and now considering 772/772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 368/368 places, 772/772 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 772/772 transitions.
Applied a total of 0 rules in 12 ms. Remains 368 /368 variables (removed 0) and now considering 772/772 (removed 0) transitions.
[2023-04-07 07:24:25] [INFO ] Invariant cache hit.
[2023-04-07 07:24:25] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-04-07 07:24:25] [INFO ] Invariant cache hit.
[2023-04-07 07:24:25] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:24:26] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
[2023-04-07 07:24:26] [INFO ] Redundant transitions in 52 ms returned []
[2023-04-07 07:24:26] [INFO ] Invariant cache hit.
[2023-04-07 07:24:27] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2316 ms. Remains : 368/368 places, 772/772 transitions.
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 130 Pre rules applied. Total rules applied 0 place count 368 transition count 642
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 238 transition count 642
Applied a total of 260 rules in 15 ms. Remains 238 /368 variables (removed 130) and now considering 642/772 (removed 130) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 642 rows 238 cols
[2023-04-07 07:24:27] [INFO ] Computed 26 invariants in 5 ms
[2023-04-07 07:24:27] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 07:24:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-04-07 07:24:27] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 7 ms returned sat
[2023-04-07 07:24:27] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 07:24:27] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-04-07 07:24:28] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-07 07:24:28] [INFO ] Flatten gal took : 29 ms
[2023-04-07 07:24:28] [INFO ] Flatten gal took : 26 ms
[2023-04-07 07:24:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4201462494663928964.gal : 5 ms
[2023-04-07 07:24:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11362688160670157131.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4201462494663928964.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11362688160670157131.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11362688160670157131.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 26
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 85
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :85 after 168
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :168 after 277
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :277 after 658
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :658 after 1323
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1323 after 2664
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2664 after 6059
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6059 after 17695
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :17695 after 43863
Detected timeout of ITS tools.
[2023-04-07 07:24:43] [INFO ] Flatten gal took : 23 ms
[2023-04-07 07:24:43] [INFO ] Applying decomposition
[2023-04-07 07:24:43] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17207006983717772012.txt' '-o' '/tmp/graph17207006983717772012.bin' '-w' '/tmp/graph17207006983717772012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17207006983717772012.bin' '-l' '-1' '-v' '-w' '/tmp/graph17207006983717772012.weights' '-q' '0' '-e' '0.001'
[2023-04-07 07:24:43] [INFO ] Decomposing Gal with order
[2023-04-07 07:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 07:24:43] [INFO ] Removed a total of 1254 redundant transitions.
[2023-04-07 07:24:43] [INFO ] Flatten gal took : 109 ms
[2023-04-07 07:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 22 ms.
[2023-04-07 07:24:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15317501219711542559.gal : 9 ms
[2023-04-07 07:24:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1597493687099772220.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15317501219711542559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1597493687099772220.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1597493687099772220.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2.96717e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12873714242682325445
[2023-04-07 07:24:58] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12873714242682325445
Running compilation step : cd /tmp/ltsmin12873714242682325445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1144 ms.
Running link step : cd /tmp/ltsmin12873714242682325445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12873714242682325445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AndersonPT12ReachabilityCardinality01==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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-04-07 07:25:13] [INFO ] Flatten gal took : 157 ms
[2023-04-07 07:25:13] [INFO ] Applying decomposition
[2023-04-07 07:25:14] [INFO ] Flatten gal took : 150 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18229374059765741174.txt' '-o' '/tmp/graph18229374059765741174.bin' '-w' '/tmp/graph18229374059765741174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18229374059765741174.bin' '-l' '-1' '-v' '-w' '/tmp/graph18229374059765741174.weights' '-q' '0' '-e' '0.001'
[2023-04-07 07:25:14] [INFO ] Decomposing Gal with order
[2023-04-07 07:25:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 07:25:14] [INFO ] Removed a total of 7516 redundant transitions.
[2023-04-07 07:25:15] [INFO ] Flatten gal took : 409 ms
[2023-04-07 07:25:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 751 labels/synchronizations in 117 ms.
[2023-04-07 07:25:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4064145102138278877.gal : 18 ms
[2023-04-07 07:25:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7424031171160875308.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4064145102138278877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7424031171160875308.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7424031171160875308.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 61
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :61 after 77
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :77 after 77
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :77 after 77
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :77 after 77
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :77 after 77
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :77 after 178
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :178 after 2817
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2817 after 187864
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :379282 after 4.15133e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :187864 after 4.22059e+06
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :4.15133e+06 after 3.74302e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.22059e+06 after 1.486e+07
ITS-tools command line returned an error code 137
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.486e+07 after 2.6691e+07
Detected timeout of ITS tools.
[2023-04-07 07:55:19] [INFO ] Flatten gal took : 254 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4372771176443405068
[2023-04-07 07:55:19] [INFO ] Computing symmetric may disable matrix : 772 transitions.
[2023-04-07 07:55:19] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 07:55:19] [INFO ] Computing symmetric may enable matrix : 772 transitions.
[2023-04-07 07:55:19] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 07:55:19] [INFO ] Applying decomposition
[2023-04-07 07:55:20] [INFO ] Flatten gal took : 204 ms
[2023-04-07 07:55:24] [INFO ] Computing Do-Not-Accords matrix : 772 transitions.
[2023-04-07 07:55:24] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 07:55:24] [INFO ] Built C files in 5131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4372771176443405068
Running compilation step : cd /tmp/ltsmin4372771176443405068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10235445884614288340.txt' '-o' '/tmp/graph10235445884614288340.bin' '-w' '/tmp/graph10235445884614288340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10235445884614288340.bin' '-l' '-1' '-v' '-w' '/tmp/graph10235445884614288340.weights' '-q' '0' '-e' '0.001'
[2023-04-07 07:55:24] [INFO ] Decomposing Gal with order
[2023-04-07 07:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 07:55:25] [INFO ] Removed a total of 1467 redundant transitions.
[2023-04-07 07:55:25] [INFO ] Flatten gal took : 199 ms
[2023-04-07 07:55:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 39 ms.
[2023-04-07 07:55:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15155219035844737466.gal : 42 ms
[2023-04-07 07:55:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18346323283725026891.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15155219035844737466.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18346323283725026891.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18346323283725026891.prop.
Compilation finished in 2403 ms.
Running link step : cd /tmp/ltsmin4372771176443405068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin4372771176443405068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT12ReachabilityCardinality01==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.105: Initializing POR dependencies: labels 773, guards 772
pins2lts-mc-linux64( 2/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.118: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 6.456: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 6.473: "AndersonPT12ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 6.472: "AndersonPT12ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 6.474: There are 773 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 6.474: State length is 368, there are 772 groups
pins2lts-mc-linux64( 0/ 8), 6.474: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 6.474: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 6.474: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 6.474: Visible groups: 0 / 772, labels: 1 / 773
pins2lts-mc-linux64( 0/ 8), 6.474: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 6.474: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 6.473: "AndersonPT12ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 6.473: "AndersonPT12ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 6.473: "AndersonPT12ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 6.473: "AndersonPT12ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 6.474: "AndersonPT12ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 6.474: "AndersonPT12ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 6.692: ~4 levels ~960 states ~10312 transitions
pins2lts-mc-linux64( 0/ 8), 6.930: ~4 levels ~1920 states ~20144 transitions
pins2lts-mc-linux64( 1/ 8), 7.326: ~2 levels ~3840 states ~37672 transitions
pins2lts-mc-linux64( 2/ 8), 7.960: ~4 levels ~7680 states ~64384 transitions
pins2lts-mc-linux64( 2/ 8), 9.149: ~4 levels ~15360 states ~121008 transitions
pins2lts-mc-linux64( 2/ 8), 11.201: ~4 levels ~30720 states ~234848 transitions
pins2lts-mc-linux64( 2/ 8), 14.926: ~5 levels ~61440 states ~455992 transitions
pins2lts-mc-linux64( 5/ 8), 21.247: ~4 levels ~122880 states ~969672 transitions
pins2lts-mc-linux64( 5/ 8), 30.324: ~4 levels ~245760 states ~1858392 transitions
pins2lts-mc-linux64( 5/ 8), 49.093: ~4 levels ~491520 states ~3634272 transitions
pins2lts-mc-linux64( 5/ 8), 83.314: ~5 levels ~983040 states ~6797752 transitions
pins2lts-mc-linux64( 5/ 8), 152.793: ~5 levels ~1966080 states ~12989336 transitions
pins2lts-mc-linux64( 5/ 8), 301.008: ~6 levels ~3932160 states ~25080104 transitions
pins2lts-mc-linux64( 5/ 8), 619.168: ~6 levels ~7864320 states ~46496128 transitions
pins2lts-mc-linux64( 2/ 8), 1415.471: ~8 levels ~15728640 states ~74892328 transitions
pins2lts-mc-linux64( 1/ 8), 1493.328: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1493.388:
pins2lts-mc-linux64( 0/ 8), 1493.389: mean standard work distribution: 10.1% (states) 5.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1493.389:
pins2lts-mc-linux64( 0/ 8), 1493.389: Explored 14503320 states 85187842 transitions, fanout: 5.874
pins2lts-mc-linux64( 0/ 8), 1493.389: Total exploration time 1486.910 sec (1486.850 sec minimum, 1486.878 sec on average)
pins2lts-mc-linux64( 0/ 8), 1493.389: States per second: 9754, Transitions per second: 57292
pins2lts-mc-linux64( 0/ 8), 1493.389: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 1493.389:
pins2lts-mc-linux64( 0/ 8), 1493.389: Queue width: 8B, total height: 52512990, memory: 400.64MB
pins2lts-mc-linux64( 0/ 8), 1493.389: Tree memory: 767.3MB, 12.0 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1493.389: Tree fill ratio (roots/leafs): 49.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1493.389: Stored 787 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1493.389: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1493.389: Est. total memory use: 1167.9MB (~1424.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4372771176443405068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT12ReachabilityCardinality01==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4372771176443405068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT12ReachabilityCardinality01==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9815924 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16058528 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="Anderson-PT-12"
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 Anderson-PT-12, 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 r517-tall-167987243300070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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