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.r267-smll-167863541700351.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 smartxred
Input is NoC3x3-PT-8B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541700351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 09:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678865396138

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 07:29:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 07:29:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:30:00] [INFO ] Load time of PNML (sax parser for PT used): 844 ms
[2023-03-15 07:30:00] [INFO ] Transformed 9140 places.
[2023-03-15 07:30:00] [INFO ] Transformed 14577 transitions.
[2023-03-15 07:30:00] [INFO ] Found NUPN structural information;
[2023-03-15 07:30:00] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 1148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1185 ms. (steps per millisecond=8 ) properties (out of 16) seen :3
FORMULA NoC3x3-PT-8B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 14577 rows 9140 cols
[2023-03-15 07:30:03] [INFO ] Computed 99 place invariants in 212 ms
[2023-03-15 07:30:08] [INFO ] After 5108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-15 07:30:13] [INFO ] [Nat]Absence check using 99 positive place invariants in 249 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:30:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:30:33] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 168 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 12517 edges and 9140 vertex of which 1415 / 9140 are part of one of the 31 SCC in 41 ms
Free SCC test removed 1384 places
Drop transitions removed 2143 transitions
Reduce isomorphic transitions removed 2143 transitions.
Graph (complete) has 13911 edges and 7756 vertex of which 7643 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.39 ms
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions removed 4520 transitions
Trivial Post-agglo rules discarded 4520 transitions
Performed 4520 trivial Post agglomeration. Transition count delta: 4520
Iterating post reduction 0 with 4624 rules applied. Total rules applied 4626 place count 7643 transition count 7730
Reduce places removed 4520 places and 0 transitions.
Ensure Unique test removed 2511 transitions
Reduce isomorphic transitions removed 2511 transitions.
Drop transitions removed 666 transitions
Trivial Post-agglo rules discarded 666 transitions
Performed 666 trivial Post agglomeration. Transition count delta: 666
Iterating post reduction 1 with 7697 rules applied. Total rules applied 12323 place count 3123 transition count 4553
Reduce places removed 666 places and 0 transitions.
Ensure Unique test removed 666 transitions
Reduce isomorphic transitions removed 666 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 1334 rules applied. Total rules applied 13657 place count 2457 transition count 3885
Reduce places removed 2 places and 0 transitions.
Performed 968 Post agglomeration using F-continuation condition.Transition count delta: 968
Iterating post reduction 3 with 970 rules applied. Total rules applied 14627 place count 2455 transition count 2917
Reduce places removed 968 places and 0 transitions.
Ensure Unique test removed 865 transitions
Reduce isomorphic transitions removed 865 transitions.
Iterating post reduction 4 with 1833 rules applied. Total rules applied 16460 place count 1487 transition count 2052
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 55 Pre rules applied. Total rules applied 16460 place count 1487 transition count 1997
Deduced a syphon composed of 55 places in 7 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 16570 place count 1432 transition count 1997
Discarding 339 places :
Symmetric choice reduction at 5 with 339 rule applications. Total rules 16909 place count 1093 transition count 1658
Iterating global reduction 5 with 339 rules applied. Total rules applied 17248 place count 1093 transition count 1658
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 17294 place count 1093 transition count 1612
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 59 Pre rules applied. Total rules applied 17294 place count 1093 transition count 1553
Deduced a syphon composed of 59 places in 21 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 17412 place count 1034 transition count 1553
Discarding 59 places :
Symmetric choice reduction at 6 with 59 rule applications. Total rules 17471 place count 975 transition count 1423
Iterating global reduction 6 with 59 rules applied. Total rules applied 17530 place count 975 transition count 1423
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 17537 place count 975 transition count 1416
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 3 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 7 with 480 rules applied. Total rules applied 18017 place count 735 transition count 1176
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 18034 place count 735 transition count 1159
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 18039 place count 730 transition count 1149
Iterating global reduction 8 with 5 rules applied. Total rules applied 18044 place count 730 transition count 1149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 18046 place count 729 transition count 1148
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 18052 place count 726 transition count 1169
Drop transitions removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 8 with 93 rules applied. Total rules applied 18145 place count 726 transition count 1076
Free-agglomeration rule applied 234 times.
Iterating global reduction 8 with 234 rules applied. Total rules applied 18379 place count 726 transition count 842
Reduce places removed 234 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1228 edges and 492 vertex of which 489 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 248 rules applied. Total rules applied 18627 place count 489 transition count 829
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 18630 place count 489 transition count 826
Drop transitions removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 10 with 153 rules applied. Total rules applied 18783 place count 489 transition count 673
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 1071 edges and 485 vertex of which 467 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 5 rules applied. Total rules applied 18788 place count 467 transition count 673
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 18806 place count 467 transition count 655
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 12 with 25 rules applied. Total rules applied 18831 place count 467 transition count 655
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 18832 place count 466 transition count 654
Applied a total of 18832 rules in 1748 ms. Remains 466 /9140 variables (removed 8674) and now considering 654/14577 (removed 13923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1748 ms. Remains : 466/9140 places, 654/14577 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 12) seen :7
FORMULA NoC3x3-PT-8B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 654 rows 466 cols
[2023-03-15 07:30:36] [INFO ] Computed 62 place invariants in 31 ms
[2023-03-15 07:30:36] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 07:30:36] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2023-03-15 07:30:37] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 07:30:37] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-15 07:30:37] [INFO ] After 267ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 07:30:37] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-15 07:30:38] [INFO ] After 1695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 70 ms.
Support contains 102 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 654/654 transitions.
Graph (trivial) has 134 edges and 466 vertex of which 20 / 466 are part of one of the 6 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 452 transition count 598
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 48 rules applied. Total rules applied 78 place count 423 transition count 579
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 98 place count 408 transition count 574
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 98 place count 408 transition count 569
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 403 transition count 569
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 402 transition count 568
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 402 transition count 568
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 138 place count 388 transition count 554
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 387 transition count 553
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 387 transition count 553
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 386 transition count 555
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 170 place count 386 transition count 527
Graph (complete) has 947 edges and 386 vertex of which 385 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 3 with 1 rules applied. Total rules applied 171 place count 385 transition count 527
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 385 transition count 526
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 189 place count 385 transition count 509
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 206 place count 368 transition count 509
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 217 place count 368 transition count 498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 218 place count 367 transition count 498
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 219 place count 367 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 220 place count 366 transition count 497
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 222 place count 366 transition count 497
Applied a total of 222 rules in 120 ms. Remains 366 /466 variables (removed 100) and now considering 497/654 (removed 157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 366/466 places, 497/654 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 497 rows 366 cols
[2023-03-15 07:30:38] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-15 07:30:38] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:30:38] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2023-03-15 07:30:39] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:30:39] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-15 07:30:39] [INFO ] After 162ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:30:39] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-15 07:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-15 07:30:39] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-15 07:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-15 07:30:39] [INFO ] After 512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-15 07:30:39] [INFO ] After 1129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 75 ms.
Support contains 82 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 497/497 transitions.
Graph (trivial) has 42 edges and 366 vertex of which 2 / 366 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 365 transition count 482
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 22 rules applied. Total rules applied 36 place count 352 transition count 473
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 45 place count 345 transition count 471
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 345 transition count 469
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 343 transition count 469
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 341 transition count 467
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 339 transition count 467
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 339 transition count 459
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 339 transition count 458
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 338 transition count 457
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 338 transition count 457
Applied a total of 69 rules in 62 ms. Remains 338 /366 variables (removed 28) and now considering 457/497 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 338/366 places, 457/497 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 457 rows 338 cols
[2023-03-15 07:30:40] [INFO ] Computed 61 place invariants in 7 ms
[2023-03-15 07:30:40] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 07:30:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 18 ms returned sat
[2023-03-15 07:30:40] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 07:30:40] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-15 07:30:40] [INFO ] After 93ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 07:30:41] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-15 07:30:41] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 36 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 457/457 transitions.
Graph (trivial) has 108 edges and 338 vertex of which 17 / 338 are part of one of the 7 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 824 edges and 328 vertex of which 327 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 327 transition count 412
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 33 rules applied. Total rules applied 62 place count 301 transition count 405
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 66 place count 300 transition count 402
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 297 transition count 402
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 69 place count 297 transition count 396
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 81 place count 291 transition count 396
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 290 transition count 395
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 290 transition count 395
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 290 transition count 393
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 111 place count 277 transition count 380
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 115 place count 277 transition count 376
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 116 place count 276 transition count 375
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 276 transition count 375
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 121 place count 274 transition count 375
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 133 place count 274 transition count 363
Free-agglomeration rule applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 153 place count 274 transition count 343
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 672 edges and 254 vertex of which 252 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 30 rules applied. Total rules applied 183 place count 252 transition count 334
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 185 place count 252 transition count 332
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 192 place count 252 transition count 325
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 662 edges and 250 vertex of which 249 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 8 with 3 rules applied. Total rules applied 195 place count 249 transition count 325
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 196 place count 249 transition count 324
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 202 place count 249 transition count 324
Applied a total of 202 rules in 74 ms. Remains 249 /338 variables (removed 89) and now considering 324/457 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 249/338 places, 324/457 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 324 rows 249 cols
[2023-03-15 07:30:41] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-15 07:30:41] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:30:41] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-15 07:30:41] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:30:41] [INFO ] State equation strengthened by 177 read => feed constraints.
[2023-03-15 07:30:41] [INFO ] After 60ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:30:41] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 07:30:41] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 26 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 324/324 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 249 transition count 318
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 243 transition count 317
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 243 transition count 316
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 242 transition count 316
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 238 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 238 transition count 310
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 238 transition count 308
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 238 transition count 306
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 236 transition count 305
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 236 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 235 transition count 304
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 8 rules applied. Total rules applied 42 place count 232 transition count 299
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 47 place count 227 transition count 299
Applied a total of 47 rules in 45 ms. Remains 227 /249 variables (removed 22) and now considering 299/324 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 227/249 places, 299/324 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 904594 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 904594 steps, saw 818483 distinct states, run finished after 3004 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 299 rows 227 cols
[2023-03-15 07:30:44] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-15 07:30:45] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:30:45] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2023-03-15 07:30:45] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:30:45] [INFO ] State equation strengthened by 167 read => feed constraints.
[2023-03-15 07:30:45] [INFO ] After 73ms SMT Verify possible using 167 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:30:45] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2023-03-15 07:30:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-15 07:30:45] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-15 07:30:45] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 177 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=88 )
FORMULA NoC3x3-PT-8B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 46529 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running NoC3x3 (PT), instance 8B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 9140 places, 14577 transitions, 30726 arcs.
Final Score: 5110147.185
Took : 102 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14206320 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100948 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is NoC3x3-PT-8B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-167863541700351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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