About the Execution of 2021-gold for HirschbergSinclair-PT-35
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
480.527 | 67323.00 | 100670.00 | 488.30 | TFTTFTTFFFFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r125-smll-165264482000119.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is HirschbergSinclair-PT-35, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-smll-165264482000119
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K Apr 29 16:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 16:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 16:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 16:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 29 16:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 29 16:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 544K May 10 09:34 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 HirschbergSinclair-PT-35-ReachabilityCardinality-00
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-01
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-02
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-03
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-04
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-05
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-06
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-07
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-08
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-09
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-10
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-11
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-12
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-13
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-14
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1655073144465
Running Version 0
[2022-06-12 22:32:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:32:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:32:27] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2022-06-12 22:32:27] [INFO ] Transformed 998 places.
[2022-06-12 22:32:27] [INFO ] Transformed 922 transitions.
[2022-06-12 22:32:27] [INFO ] Parsed PT model containing 998 places and 922 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 16) seen :5
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 922 rows 998 cols
[2022-06-12 22:32:28] [INFO ] Computed 76 place invariants in 53 ms
[2022-06-12 22:32:29] [INFO ] [Real]Absence check using 70 positive place invariants in 67 ms returned sat
[2022-06-12 22:32:29] [INFO ] [Real]Absence check using 70 positive and 6 generalized place invariants in 7 ms returned sat
[2022-06-12 22:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:30] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2022-06-12 22:32:31] [INFO ] Deduced a trap composed of 18 places in 1157 ms of which 8 ms to minimize.
[2022-06-12 22:32:32] [INFO ] Deduced a trap composed of 19 places in 819 ms of which 3 ms to minimize.
[2022-06-12 22:32:33] [INFO ] Deduced a trap composed of 97 places in 683 ms of which 2 ms to minimize.
[2022-06-12 22:32:33] [INFO ] Deduced a trap composed of 176 places in 619 ms of which 9 ms to minimize.
[2022-06-12 22:32:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 22:32:34] [INFO ] [Real]Absence check using 70 positive place invariants in 54 ms returned unsat
[2022-06-12 22:32:34] [INFO ] [Real]Absence check using 70 positive place invariants in 62 ms returned sat
[2022-06-12 22:32:34] [INFO ] [Real]Absence check using 70 positive and 6 generalized place invariants in 13 ms returned sat
[2022-06-12 22:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:35] [INFO ] [Real]Absence check using state equation in 935 ms returned unsat
[2022-06-12 22:32:35] [INFO ] [Real]Absence check using 70 positive place invariants in 25 ms returned unsat
[2022-06-12 22:32:36] [INFO ] [Real]Absence check using 70 positive place invariants in 47 ms returned unsat
[2022-06-12 22:32:36] [INFO ] [Real]Absence check using 70 positive place invariants in 24 ms returned unsat
[2022-06-12 22:32:36] [INFO ] [Real]Absence check using 70 positive place invariants in 41 ms returned unsat
[2022-06-12 22:32:36] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned unsat
[2022-06-12 22:32:36] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned unsat
[2022-06-12 22:32:37] [INFO ] [Real]Absence check using 70 positive place invariants in 52 ms returned sat
[2022-06-12 22:32:37] [INFO ] [Real]Absence check using 70 positive and 6 generalized place invariants in 7 ms returned sat
[2022-06-12 22:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:38] [INFO ] [Real]Absence check using state equation in 1169 ms returned sat
[2022-06-12 22:32:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:32:38] [INFO ] [Nat]Absence check using 70 positive place invariants in 53 ms returned sat
[2022-06-12 22:32:38] [INFO ] [Nat]Absence check using 70 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-12 22:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:39] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2022-06-12 22:32:39] [INFO ] Deduced a trap composed of 25 places in 606 ms of which 2 ms to minimize.
[2022-06-12 22:32:40] [INFO ] Deduced a trap composed of 15 places in 728 ms of which 1 ms to minimize.
[2022-06-12 22:32:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1532 ms
[2022-06-12 22:32:40] [INFO ] Computed and/alt/rep : 429/435/429 causal constraints (skipped 458 transitions) in 238 ms.
[2022-06-12 22:32:43] [INFO ] Added : 150 causal constraints over 30 iterations in 2616 ms. Result :unknown
[2022-06-12 22:32:43] [INFO ] [Real]Absence check using 70 positive place invariants in 86 ms returned sat
[2022-06-12 22:32:43] [INFO ] [Real]Absence check using 70 positive and 6 generalized place invariants in 45 ms returned sat
[2022-06-12 22:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:44] [INFO ] [Real]Absence check using state equation in 1234 ms returned unsat
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 46400 steps, including 542 resets, run finished after 302 ms. (steps per millisecond=153 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 83 out of 998 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 967 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.17 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 313 rules applied. Total rules applied 314 place count 967 transition count 609
Reduce places removed 312 places and 0 transitions.
Graph (complete) has 1213 edges and 655 vertex of which 581 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.2 ms
Discarding 74 places :
Also discarding 0 output transitions
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 337 rules applied. Total rules applied 651 place count 581 transition count 585
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 98 rules applied. Total rules applied 749 place count 557 transition count 511
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 753 place count 553 transition count 507
Iterating global reduction 3 with 4 rules applied. Total rules applied 757 place count 553 transition count 507
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 760 place count 550 transition count 504
Iterating global reduction 3 with 3 rules applied. Total rules applied 763 place count 550 transition count 504
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 789 place count 550 transition count 478
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 815 place count 524 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 523 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 817 place count 522 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 818 place count 521 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 819 place count 520 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 820 place count 519 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 821 place count 518 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 822 place count 517 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 823 place count 516 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 824 place count 515 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 825 place count 514 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 826 place count 513 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 827 place count 512 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 828 place count 511 transition count 465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 829 place count 510 transition count 464
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 830 place count 509 transition count 463
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 831 place count 508 transition count 462
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 832 place count 507 transition count 461
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 833 place count 506 transition count 460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 505 transition count 459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 835 place count 504 transition count 458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 503 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 502 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 838 place count 501 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 839 place count 500 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 840 place count 499 transition count 453
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 841 place count 498 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 842 place count 497 transition count 451
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 843 place count 496 transition count 450
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 844 place count 495 transition count 449
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 845 place count 494 transition count 448
Applied a total of 845 rules in 1537 ms. Remains 494 /998 variables (removed 504) and now considering 448/922 (removed 474) transitions.
Finished structural reductions, in 1 iterations. Remains : 494/998 places, 448/922 transitions.
[2022-06-12 22:32:47] [INFO ] Flatten gal took : 132 ms
[2022-06-12 22:32:47] [INFO ] Flatten gal took : 71 ms
[2022-06-12 22:32:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14639942673553180813.gal : 48 ms
[2022-06-12 22:32:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12426886235228386717.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14639942673553180813.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12426886235228386717.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14639942673553180813.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12426886235228386717.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12426886235228386717.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 144
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :144 after 8640
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8640 after 347328
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :347328 after 2.00179e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.00179e+08 after 4.64493e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.30373e+10 after 3.93021e+10
Detected timeout of ITS tools.
[2022-06-12 22:33:02] [INFO ] Flatten gal took : 64 ms
[2022-06-12 22:33:02] [INFO ] Applying decomposition
[2022-06-12 22:33:02] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15689175020583098188.txt, -o, /tmp/graph15689175020583098188.bin, -w, /tmp/graph15689175020583098188.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15689175020583098188.bin, -l, -1, -v, -w, /tmp/graph15689175020583098188.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:33:03] [INFO ] Decomposing Gal with order
[2022-06-12 22:33:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:33:03] [INFO ] Removed a total of 283 redundant transitions.
[2022-06-12 22:33:03] [INFO ] Flatten gal took : 198 ms
[2022-06-12 22:33:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 48 ms.
[2022-06-12 22:33:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17893614415200799162.gal : 26 ms
[2022-06-12 22:33:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3777338455887442045.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17893614415200799162.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3777338455887442045.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17893614415200799162.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3777338455887442045.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3777338455887442045.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 144
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :144 after 2304
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2304 after 115776
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :115776 after 2.12565e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.12565e+08 after 9.91969e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9.91969e+08 after 7.77046e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7.77046e+09 after 1.98157e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15999886994299598132
[2022-06-12 22:33:18] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15999886994299598132
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15999886994299598132]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15999886994299598132] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15999886994299598132] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2198 resets, run finished after 2141 ms. (steps per millisecond=467 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 586 resets, run finished after 1377 ms. (steps per millisecond=726 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 615 resets, run finished after 3353 ms. (steps per millisecond=298 ) properties (out of 2) seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 448 rows 494 cols
[2022-06-12 22:33:26] [INFO ] Computed 46 place invariants in 11 ms
[2022-06-12 22:33:26] [INFO ] [Real]Absence check using 7 positive place invariants in 29 ms returned sat
[2022-06-12 22:33:26] [INFO ] [Real]Absence check using 7 positive and 39 generalized place invariants in 105 ms returned sat
[2022-06-12 22:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:33:27] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-06-12 22:33:27] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-12 22:33:27] [INFO ] [Real]Added 27 Read/Feed constraints in 145 ms returned sat
[2022-06-12 22:33:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:33:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2022-06-12 22:33:27] [INFO ] [Nat]Absence check using 7 positive and 39 generalized place invariants in 100 ms returned sat
[2022-06-12 22:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:33:27] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2022-06-12 22:33:28] [INFO ] [Nat]Added 27 Read/Feed constraints in 77 ms returned sat
[2022-06-12 22:33:28] [INFO ] Computed and/alt/rep : 421/559/421 causal constraints (skipped 12 transitions) in 36 ms.
[2022-06-12 22:33:30] [INFO ] Added : 239 causal constraints over 48 iterations in 2249 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Incomplete Parikh walk after 25600 steps, including 581 resets, run finished after 164 ms. (steps per millisecond=156 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 13 out of 494 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 494/494 places, 448/448 transitions.
Graph (complete) has 961 edges and 494 vertex of which 447 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 447 transition count 356
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 488 edges and 376 vertex of which 323 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 1 with 181 rules applied. Total rules applied 274 place count 323 transition count 216
Reduce places removed 105 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 126 rules applied. Total rules applied 400 place count 218 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 403 place count 215 transition count 195
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 403 place count 215 transition count 119
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 557 place count 137 transition count 119
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 559 place count 136 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 560 place count 135 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 560 place count 135 transition count 117
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 562 place count 134 transition count 117
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 563 place count 133 transition count 116
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 133 transition count 116
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 565 place count 133 transition count 115
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 221 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 2 rules applied. Total rules applied 567 place count 131 transition count 115
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 568 place count 131 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 570 place count 130 transition count 113
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 572 place count 130 transition count 111
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 5 rules applied. Total rules applied 577 place count 126 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 578 place count 125 transition count 110
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 14 Pre rules applied. Total rules applied 578 place count 125 transition count 96
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 11 with 28 rules applied. Total rules applied 606 place count 111 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 607 place count 110 transition count 95
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 609 place count 109 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 610 place count 108 transition count 94
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 7 Pre rules applied. Total rules applied 610 place count 108 transition count 87
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 624 place count 101 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 625 place count 100 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 626 place count 99 transition count 85
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 2 rules applied. Total rules applied 628 place count 98 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 629 place count 97 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 7 Pre rules applied. Total rules applied 629 place count 97 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 15 with 14 rules applied. Total rules applied 643 place count 90 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 644 place count 89 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 645 place count 88 transition count 76
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 7 Pre rules applied. Total rules applied 645 place count 88 transition count 69
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 16 with 14 rules applied. Total rules applied 659 place count 81 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 660 place count 80 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 661 place count 79 transition count 68
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 5 Pre rules applied. Total rules applied 661 place count 79 transition count 63
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 671 place count 74 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 672 place count 73 transition count 62
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 17 with 2 rules applied. Total rules applied 674 place count 72 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 675 place count 71 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 5 Pre rules applied. Total rules applied 675 place count 71 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 19 with 10 rules applied. Total rules applied 685 place count 66 transition count 56
Applied a total of 685 rules in 74 ms. Remains 66 /494 variables (removed 428) and now considering 56/448 (removed 392) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/494 places, 56/448 transitions.
[2022-06-12 22:33:30] [INFO ] Flatten gal took : 12 ms
[2022-06-12 22:33:30] [INFO ] Flatten gal took : 6 ms
[2022-06-12 22:33:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7827415531850768396.gal : 3 ms
[2022-06-12 22:33:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4410078371688913728.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7827415531850768396.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4410078371688913728.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7827415531850768396.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4410078371688913728.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4410078371688913728.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 54
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :54 after 216
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1080 after 2016
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2016 after 4320
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4320 after 10782
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,37638,0.029163,4552,2,380,13,2626,7,0,322,1885,0
Total reachable state count : 37638
Verifying 1 reachability properties.
Reachability property HirschbergSinclair-PT-35-ReachabilityCardinality-02 is true.
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HirschbergSinclair-PT-35-ReachabilityCardinality-02,396,0.03128,4552,2,128,13,2626,7,0,350,1885,0
All properties solved without resorting to model-checking.
BK_STOP 1655073211788
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="HirschbergSinclair-PT-35"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is HirschbergSinclair-PT-35, 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 r125-smll-165264482000119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 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 '
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 ;