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

About the Execution of Smart+red for PolyORBNT-PT-S05J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4176.512 139431.00 165778.00 582.30 TTTTFFFFFF?FTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r299-tall-167873953400751.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 PolyORBNT-PT-S05J80, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953400751
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 50K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 257K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 00:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 285K Feb 26 00:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 25 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 578K Feb 25 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 PolyORBNT-PT-S05J80-ReachabilityFireability-00
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-01
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-02
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-03
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-04
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-05
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-06
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-07
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-08
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-09
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-10
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-11
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-12
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-13
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-14
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679544356823

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=PolyORBNT-PT-S05J80
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 04:05:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 04:05:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 04:05:58] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-23 04:05:58] [INFO ] Transformed 1189 places.
[2023-03-23 04:05:58] [INFO ] Transformed 2350 transitions.
[2023-03-23 04:05:58] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2023-03-23 04:05:58] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-23 04:05:58] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-23 04:05:58] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-23 04:05:58] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-23 04:05:58] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-23 04:05:58] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 710 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 16) seen :1
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 151 ms. (steps per millisecond=6 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 79160 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79160 steps, saw 25071 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-23 04:06:02] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-23 04:06:02] [INFO ] Computed 182 place invariants in 121 ms
[2023-03-23 04:06:06] [INFO ] [Real]Absence check using 157 positive place invariants in 40 ms returned sat
[2023-03-23 04:06:06] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-23 04:06:06] [INFO ] After 897ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-23 04:06:07] [INFO ] [Nat]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-23 04:06:07] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 66 ms returned sat
[2023-03-23 04:06:31] [INFO ] After 24128ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :4
[2023-03-23 04:06:31] [INFO ] State equation strengthened by 1 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-23 04:06:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 04:06:31] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:14
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 93 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 1184 transition count 1629
Reduce places removed 66 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 1118 transition count 1626
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 143 place count 1115 transition count 1626
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 143 place count 1115 transition count 1550
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 295 place count 1039 transition count 1550
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 296 place count 1038 transition count 1549
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 1038 transition count 1549
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 301 place count 1036 transition count 1547
Applied a total of 301 rules in 436 ms. Remains 1036 /1189 variables (removed 153) and now considering 1547/1695 (removed 148) transitions.
[2023-03-23 04:06:32] [INFO ] Flow matrix only has 1543 transitions (discarded 4 similar events)
// Phase 1: matrix 1543 rows 1036 cols
[2023-03-23 04:06:32] [INFO ] Computed 177 place invariants in 60 ms
[2023-03-23 04:06:34] [INFO ] Dead Transitions using invariants and state equation in 2561 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1036/1189 places, 1452/1695 transitions.
Applied a total of 0 rules in 73 ms. Remains 1036 /1036 variables (removed 0) and now considering 1452/1452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3073 ms. Remains : 1036/1189 places, 1452/1695 transitions.
Incomplete random walk after 10000 steps, including 436 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 6) seen :2
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :1
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :1
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-23 04:06:35] [INFO ] Flow matrix only has 1448 transitions (discarded 4 similar events)
// Phase 1: matrix 1448 rows 1036 cols
[2023-03-23 04:06:35] [INFO ] Computed 177 place invariants in 39 ms
[2023-03-23 04:06:35] [INFO ] [Real]Absence check using 155 positive place invariants in 32 ms returned sat
[2023-03-23 04:06:35] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 45 ms returned sat
[2023-03-23 04:06:35] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 04:06:35] [INFO ] [Nat]Absence check using 155 positive place invariants in 34 ms returned sat
[2023-03-23 04:06:35] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 52 ms returned sat
[2023-03-23 04:06:41] [INFO ] After 6091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 04:06:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:06:43] [INFO ] After 1509ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 04:06:46] [INFO ] After 4145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2437 ms.
[2023-03-23 04:06:48] [INFO ] After 13006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 35 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 1452/1452 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1036 transition count 1449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1033 transition count 1449
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 6 place count 1033 transition count 1434
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 1018 transition count 1434
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 1018 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 1017 transition count 1433
Applied a total of 38 rules in 249 ms. Remains 1017 /1036 variables (removed 19) and now considering 1433/1452 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1017/1036 places, 1433/1452 transitions.
Incomplete random walk after 10000 steps, including 494 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-23 04:06:48] [INFO ] Flow matrix only has 1429 transitions (discarded 4 similar events)
// Phase 1: matrix 1429 rows 1017 cols
[2023-03-23 04:06:48] [INFO ] Computed 177 place invariants in 47 ms
[2023-03-23 04:06:49] [INFO ] [Real]Absence check using 155 positive place invariants in 31 ms returned sat
[2023-03-23 04:06:49] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 48 ms returned sat
[2023-03-23 04:06:49] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 04:06:49] [INFO ] [Nat]Absence check using 155 positive place invariants in 30 ms returned sat
[2023-03-23 04:06:49] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 43 ms returned sat
[2023-03-23 04:06:54] [INFO ] After 5220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 04:06:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:07:03] [INFO ] After 9108ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-23 04:07:03] [INFO ] After 14588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 33 out of 1017 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1017/1017 places, 1433/1433 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1017 transition count 1432
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1016 transition count 1432
Applied a total of 2 rules in 62 ms. Remains 1016 /1017 variables (removed 1) and now considering 1432/1433 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1016/1017 places, 1432/1433 transitions.
Incomplete random walk after 10000 steps, including 487 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 118126 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118126 steps, saw 35456 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 04:07:07] [INFO ] Flow matrix only has 1428 transitions (discarded 4 similar events)
// Phase 1: matrix 1428 rows 1016 cols
[2023-03-23 04:07:07] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-23 04:07:07] [INFO ] [Real]Absence check using 155 positive place invariants in 32 ms returned sat
[2023-03-23 04:07:07] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 43 ms returned sat
[2023-03-23 04:07:07] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 04:07:07] [INFO ] [Nat]Absence check using 155 positive place invariants in 31 ms returned sat
[2023-03-23 04:07:07] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 41 ms returned sat
[2023-03-23 04:07:13] [INFO ] After 6338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 04:07:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:07:14] [INFO ] After 854ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 04:07:15] [INFO ] After 1572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 803 ms.
[2023-03-23 04:07:16] [INFO ] After 8947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 33 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1432/1432 transitions.
Applied a total of 0 rules in 54 ms. Remains 1016 /1016 variables (removed 0) and now considering 1432/1432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1016/1016 places, 1432/1432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1432/1432 transitions.
Applied a total of 0 rules in 50 ms. Remains 1016 /1016 variables (removed 0) and now considering 1432/1432 (removed 0) transitions.
[2023-03-23 04:07:16] [INFO ] Flow matrix only has 1428 transitions (discarded 4 similar events)
[2023-03-23 04:07:16] [INFO ] Invariant cache hit.
[2023-03-23 04:07:18] [INFO ] Implicit Places using invariants in 2118 ms returned []
[2023-03-23 04:07:18] [INFO ] Flow matrix only has 1428 transitions (discarded 4 similar events)
[2023-03-23 04:07:18] [INFO ] Invariant cache hit.
[2023-03-23 04:07:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:07:39] [INFO ] Implicit Places using invariants and state equation in 21303 ms returned []
Implicit Place search using SMT with State Equation took 23430 ms to find 0 implicit places.
[2023-03-23 04:07:39] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-23 04:07:39] [INFO ] Flow matrix only has 1428 transitions (discarded 4 similar events)
[2023-03-23 04:07:39] [INFO ] Invariant cache hit.
[2023-03-23 04:07:41] [INFO ] Dead Transitions using invariants and state equation in 2048 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25648 ms. Remains : 1016/1016 places, 1432/1432 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1016 transition count 1428
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1016 transition count 1427
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1015 transition count 1427
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1015 transition count 1426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1014 transition count 1426
Applied a total of 8 rules in 148 ms. Remains 1014 /1016 variables (removed 2) and now considering 1426/1432 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1426 rows 1014 cols
[2023-03-23 04:07:42] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-23 04:07:42] [INFO ] [Real]Absence check using 155 positive place invariants in 28 ms returned sat
[2023-03-23 04:07:42] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 39 ms returned sat
[2023-03-23 04:07:42] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 04:07:42] [INFO ] [Nat]Absence check using 155 positive place invariants in 66 ms returned sat
[2023-03-23 04:07:42] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 39 ms returned sat
[2023-03-23 04:07:45] [INFO ] After 2477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 04:07:45] [INFO ] After 3037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3702 ms.
[2023-03-23 04:07:49] [INFO ] After 7007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 04:07:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-23 04:07:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1016 places, 1432 transitions and 7221 arcs took 11 ms.
[2023-03-23 04:07:49] [INFO ] Flatten gal took : 188 ms
Total runtime 111703 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (PT), instance S05J80
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: 1016 places, 1432 transitions, 7221 arcs.
Final Score: 292765.838
Took : 25 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679544496254

--------------------
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
ERROR in file model.sm near line 9768:
syntax error

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="PolyORBNT-PT-S05J80"
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 PolyORBNT-PT-S05J80, 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 r299-tall-167873953400751"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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