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

About the Execution of Smart+red for JoinFreeModules-PT-5000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16147.052 3600000.00 3596252.00 71499.50 FFT?T?F?T??FTTFF 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.r235-tall-167856421400230.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 JoinFreeModules-PT-5000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421400230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 12:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:07 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 4.3K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 12:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 JoinFreeModules-PT-5000-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678643924996

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-5000
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 17:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:58:47] [INFO ] Load time of PNML (sax parser for PT used): 708 ms
[2023-03-12 17:58:47] [INFO ] Transformed 25001 places.
[2023-03-12 17:58:47] [INFO ] Transformed 40001 transitions.
[2023-03-12 17:58:47] [INFO ] Parsed PT model containing 25001 places and 40001 transitions and 115002 arcs in 898 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 12505 steps, including 2 resets, run finished after 2551 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2662 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2388 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2273 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2358 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2252 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2203 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2166 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2146 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 84023 steps, saw 83970 distinct states, run finished after 64505 ms. (steps per millisecond=1 ) properties seen :1
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-12 18:00:14] [INFO ] Computed 5000 place invariants in 513 ms
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-12 18:01:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 18:01:09] [INFO ] After 54273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 123 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 610 are kept as prefixes of interest. Removing 24390 places using SCC suffix rule.117 ms
Discarding 24390 places :
Also discarding 39024 output transitions
Drop transitions removed 39024 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 610 transition count 976
Applied a total of 2 rules in 795 ms. Remains 610 /25000 variables (removed 24390) and now considering 976/40001 (removed 39025) transitions.
// Phase 1: matrix 976 rows 610 cols
[2023-03-12 18:01:10] [INFO ] Computed 122 place invariants in 17 ms
[2023-03-12 18:01:10] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1379 ms. Remains : 610/25000 places, 976/40001 transitions.
Incomplete random walk after 10003 steps, including 1 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1649 ms. (steps per millisecond=6 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :1
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
[2023-03-12 18:01:13] [INFO ] Invariant cache hit.
[2023-03-12 18:01:13] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 18:01:13] [INFO ] [Nat]Absence check using 122 positive place invariants in 22 ms returned sat
[2023-03-12 18:01:18] [INFO ] After 5106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 18:01:18] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-12 18:01:25] [INFO ] After 7137ms SMT Verify possible using 122 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 3 places in 2905 ms of which 7 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3485 ms
[2023-03-12 18:01:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-12 18:01:32] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-12 18:01:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-12 18:01:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-12 18:01:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-12 18:01:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 565 ms
[2023-03-12 18:01:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-12 18:01:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-12 18:01:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-03-12 18:01:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-12 18:01:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-12 18:01:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
[2023-03-12 18:01:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-12 18:01:37] [INFO ] After 18746ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 862 ms.
[2023-03-12 18:01:38] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 13772 ms.
Support contains 117 out of 610 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 610/610 places, 976/976 transitions.
Graph (complete) has 1464 edges and 610 vertex of which 580 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 31 ms. Remains 580 /610 variables (removed 30) and now considering 928/976 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 580/610 places, 928/976 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 87659 steps, run timeout after 3046 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 87659 steps, saw 87104 distinct states, run finished after 3047 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 928 rows 580 cols
[2023-03-12 18:01:55] [INFO ] Computed 116 place invariants in 16 ms
[2023-03-12 18:01:55] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 18:01:55] [INFO ] [Nat]Absence check using 116 positive place invariants in 45 ms returned sat
[2023-03-12 18:02:16] [INFO ] After 20800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 18:02:16] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 18:02:20] [INFO ] After 3757ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 18:02:20] [INFO ] After 4000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 18:02:20] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8003 ms.
Support contains 117 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 928/928 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 928/928 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 580/580 places, 928/928 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 928/928 transitions.
Applied a total of 0 rules in 16 ms. Remains 580 /580 variables (removed 0) and now considering 928/928 (removed 0) transitions.
[2023-03-12 18:02:28] [INFO ] Invariant cache hit.
[2023-03-12 18:02:28] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-12 18:02:28] [INFO ] Invariant cache hit.
[2023-03-12 18:02:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 18:02:29] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-12 18:02:29] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-12 18:02:29] [INFO ] Invariant cache hit.
[2023-03-12 18:02:29] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 580/580 places, 928/928 transitions.
Applied a total of 0 rules in 29 ms. Remains 580 /580 variables (removed 0) and now considering 928/928 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-12 18:02:29] [INFO ] Invariant cache hit.
[2023-03-12 18:02:29] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 18:02:29] [INFO ] [Nat]Absence check using 116 positive place invariants in 18 ms returned sat
[2023-03-12 18:02:33] [INFO ] After 3771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 18:02:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-12 18:02:37] [INFO ] After 4095ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 18:02:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-12 18:02:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-12 18:02:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2023-03-12 18:02:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-12 18:02:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-12 18:02:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-12 18:02:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-12 18:02:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-12 18:02:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-12 18:02:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-12 18:02:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 654 ms
[2023-03-12 18:02:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-12 18:02:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-12 18:02:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-12 18:02:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-12 18:02:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 481 ms
[2023-03-12 18:02:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-12 18:02:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-12 18:02:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-12 18:02:43] [INFO ] After 9809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2340 ms.
[2023-03-12 18:02:45] [INFO ] After 16091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 18:02:45] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-12 18:02:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 580 places, 928 transitions and 2436 arcs took 6 ms.
[2023-03-12 18:02:46] [INFO ] Flatten gal took : 77 ms
Total runtime 239881 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running JoinFreeModules (PT), instance 5000
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 580 places, 928 transitions, 2436 arcs.
Final Score: 3107.107
Took : 23 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: JoinFreeModules-PT-5000-ReachabilityCardinality-03 (reachable & potential(( ( ( 1275 ) <= (tk(P41)) ) & ( ( ( ( 1675 ) <= (tk(P63)) ) | ( ( (! ( (tk(P422)) <= ( 1209 ) )) & ( ( 1898 ) <= (tk(P274)) ) ) & ( ( (! ( (tk(P143)) <= (tk(P365)) )) | (! ( (tk(P197)) <= ( 807 ) )) ) & ( (! ( ( 1276 ) <= (tk(P111)) )) | (! ( ( 801 ) <= (tk(P572)) )) ) ) ) ) | ( ( ( (! ( (tk(P428)) <= ( 1235 ) )) & (! ( ( 1690 ) <= (tk(P387)) )) ) & ( (! ( ( 1496 ) <= (tk(P371)) )) & ( (! ( (tk(P503)) <= (tk(P283)) )) | (! ( ( 520 ) <= (tk(P202)) )) ) ) ) | ( ( ( (tk(P296)) <= ( 4795 ) ) & (! ( ( 1864 ) <= (tk(P107)) )) ) & ( (! ( ( 2183 ) <= (tk(P569)) )) & ( (! ( (tk(P308)) <= (tk(P556)) )) | (! ( (tk(P167)) <= (tk(P19)) )) ) ) ) ) ) )))
PROPERTY: JoinFreeModules-PT-5000-ReachabilityCardinality-05 (reachable & potential(( ( (! ( ( 297 ) <= (tk(P438)) )) & ( (! ( ( 3426 ) <= (tk(P309)) )) & ( ( ( (tk(P195)) <= ( 4444 ) ) & ( ( 167 ) <= (tk(P262)) ) ) | ( ( (tk(P116)) <= ( 3832 ) ) & ( (! ( ( 2980 ) <= (tk(P345)) )) | ( ( (tk(P531)) <= ( 2401 ) ) | ( (tk(P14)) <= ( 4723 ) ) ) ) ) ) ) ) & ( ( ( (! ( ( 453 ) <= (tk(P34)) )) | ( (tk(P229)) <= (tk(P406)) ) ) | ( (! ( ( 603 ) <= (tk(P233)) )) | ( (! ( (tk(P270)) <= (tk(P152)) )) | ( (tk(P468)) <= ( 2904 ) ) ) ) ) & ( ( ( ( 1827 ) <= (tk(P522)) ) | ( ( 3370 ) <= (tk(P339)) ) ) & ( ( ( ( ( (tk(P225)) <= ( 1131 ) ) & ( (tk(P545)) <= (tk(P490)) ) ) & ( (! ( ( 3510 ) <= (tk(P174)) )) & ( (tk(P383)) <= ( 1967 ) ) ) ) & ( ( ( ( (tk(P355)) <= (tk(P546)) ) | ( ( ( ( 2614 ) <= (tk(P540)) ) & ( (tk(P209)) <= ( 3763 ) ) ) | ( ( (tk(P520)) <= (tk(P356)) ) & ( (tk(P27)) <= (tk(P334)) ) ) ) ) & ( (! ( ( 4840 ) <= (tk(P383)) )) | ( (tk(P579)) <= ( 4028 ) ) ) ) & ( ( (! ( (tk(P318)) <= ( 4496 ) )) | ( ( (tk(P553)) <= ( 1390 ) ) & ( (tk(P131)) <= ( 584 ) ) ) ) & ( ( ( ( 4527 ) <= (tk(P70)) ) | ( (tk(P511)) <= ( 67 ) ) ) | ( ( (tk(P122)) <= (tk(P249)) ) | ( (tk(P393)) <= ( 2287 ) ) ) ) ) ) ) | ( ( ( (tk(P164)) <= (tk(P473)) ) & ( ( (! ( (tk(P480)) <= ( 331 ) )) | (! ( (tk(P506)) <= ( 4391 ) )) ) | ( ( (tk(P71)) <= ( 2740 ) ) | ( ( (! ( (tk(P217)) <= ( 4110 ) )) & (! ( (tk(P89)) <= ( 2003 ) )) ) | ( (! ( (tk(P156)) <= ( 1676 ) )) & ( (! ( (tk(P126)) <= (tk(P498)) )) & ( (! ( (tk(P23)) <= ( 483 ) )) | (! ( (tk(P54)) <= (tk(P100)) )) ) ) ) ) ) ) ) & ( ( (! ( (tk(P441)) <= ( 1126 ) )) | ( (tk(P448)) <= (tk(P245)) ) ) & ( ( (tk(P301)) <= ( 1603 ) ) | ( ( (tk(P315)) <= ( 1238 ) ) & ( (! ( (tk(P81)) <= (tk(P138)) )) | (! ( (tk(P177)) <= ( 4783 ) )) ) ) ) ) ) ) ) ) )))
PROPERTY: JoinFreeModules-PT-5000-ReachabilityCardinality-07 (reachable &!potential( ( ( ( 1945 ) <= (tk(P188)) ) | ( (! ( (tk(P59)) <= ( 147 ) )) | ( ( (tk(P287)) <= ( 230 ) ) & ( ( ( 3220 ) <= (tk(P327)) ) | ( ( ( (tk(P3)) <= (tk(P419)) ) & ( (tk(P464)) <= (tk(P9)) ) ) & ( ( (tk(P397)) <= (tk(P91)) ) & ( ( (tk(P252)) <= (tk(P378)) ) & ( ( ( 4773 ) <= (tk(P349)) ) | ( ( 1052 ) <= (tk(P258)) ) ) ) ) ) ) ) ) )))
PROPERTY: JoinFreeModules-PT-5000-ReachabilityCardinality-09 (reachable &!potential( ( ( (! ( (tk(P401)) <= ( 3102 ) )) | ( (tk(P493)) <= (tk(P366)) ) ) | ( ( (! ( (tk(P413)) <= ( 920 ) )) & ( (! ( (tk(P238)) <= ( 970 ) )) & ( (! ( (tk(P527)) <= ( 3618 ) )) | ( ( (tk(P481)) <= ( 3460 ) ) & ( (! ( (tk(P150)) <= (tk(P321)) )) & ( (! ( ( 116 ) <= (tk(P36)) )) | ( (! ( (tk(P101)) <= (tk(P181)) )) | ( (! ( (tk(P280)) <= (tk(P435)) )) & (! ( ( 2802 ) <= (tk(P46)) )) ) ) ) ) ) ) ) ) | ( ( (tk(P214)) <= ( 737 ) ) & ( (tk(P291)) <= ( 3549 ) ) ) ) )))
PROPERTY: JoinFreeModules-PT-5000-ReachabilityCardinality-10 (reachable & potential(( ( (tk(P563)) <= ( 4897 ) ) & ( (! ( (tk(P451)) <= ( 2908 ) )) & ( (tk(P458)) <= (tk(P77)) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15576616 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16145004 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 ReachabilityCardinality -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="JoinFreeModules-PT-5000"
export BK_EXAMINATION="ReachabilityCardinality"
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 JoinFreeModules-PT-5000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856421400230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-5000.tgz
mv JoinFreeModules-PT-5000 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;