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

About the Execution of Marcie+red for CANInsertWithFailure-PT-090

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8449.052 3600000.00 3670026.00 497.40 TFF?T?TTTF?TT?T? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696200775.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANInsertWithFailure-PT-090, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696200775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 00:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49M 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 CANInsertWithFailure-PT-090-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678750531189

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 23:35:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 23:35:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:35:34] [INFO ] Load time of PNML (sax parser for PT used): 1054 ms
[2023-03-13 23:35:34] [INFO ] Transformed 17284 places.
[2023-03-13 23:35:34] [INFO ] Transformed 49140 transitions.
[2023-03-13 23:35:34] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1317 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 959 ms. (steps per millisecond=10 ) properties (out of 16) seen :6
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 49140 rows 17284 cols
[2023-03-13 23:35:49] [INFO ] Computed 93 place invariants in 13225 ms
[2023-03-13 23:35:54] [INFO ] [Real]Absence check using 91 positive place invariants in 255 ms returned sat
[2023-03-13 23:35:55] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 463 ms returned sat
[2023-03-13 23:35:57] [INFO ] After 7352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 23:36:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 232 ms returned sat
[2023-03-13 23:36:01] [INFO ] [Nat]Absence check using 91 positive and 2 generalized place invariants in 456 ms returned sat
[2023-03-13 23:36:22] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 166 out of 17284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Graph (complete) has 66151 edges and 17284 vertex of which 17283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.70 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 577 transitions
Trivial Post-agglo rules discarded 577 transitions
Performed 577 trivial Post agglomeration. Transition count delta: 577
Iterating post reduction 0 with 577 rules applied. Total rules applied 578 place count 17283 transition count 48563
Reduce places removed 577 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 580 rules applied. Total rules applied 1158 place count 16706 transition count 48560
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1161 place count 16703 transition count 48560
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1161 place count 16703 transition count 48543
Deduced a syphon composed of 17 places in 17 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1195 place count 16686 transition count 48543
Performed 7837 Post agglomeration using F-continuation condition.Transition count delta: 7837
Deduced a syphon composed of 7837 places in 48 ms
Reduce places removed 7837 places and 0 transitions.
Iterating global reduction 3 with 15674 rules applied. Total rules applied 16869 place count 8849 transition count 40706
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 16899 place count 8849 transition count 40676
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 16929 place count 8819 transition count 40676
Partial Free-agglomeration rule applied 8245 times.
Drop transitions removed 8245 transitions
Iterating global reduction 4 with 8245 rules applied. Total rules applied 25174 place count 8819 transition count 40676
Partial Free-agglomeration rule applied 1500 times.
Drop transitions removed 1500 transitions
Iterating global reduction 4 with 1500 rules applied. Total rules applied 26674 place count 8819 transition count 40676
Applied a total of 26674 rules in 28689 ms. Remains 8819 /17284 variables (removed 8465) and now considering 40676/49140 (removed 8464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28700 ms. Remains : 8819/17284 places, 40676/49140 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 10) seen :2
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-00 TRUE 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 23:36:51] [INFO ] Flow matrix only has 40632 transitions (discarded 44 similar events)
// Phase 1: matrix 40632 rows 8819 cols
[2023-03-13 23:36:56] [INFO ] Computed 92 place invariants in 4278 ms
[2023-03-13 23:36:58] [INFO ] [Real]Absence check using 90 positive place invariants in 132 ms returned sat
[2023-03-13 23:36:58] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 176 ms returned sat
[2023-03-13 23:37:21] [INFO ] After 21820ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-13 23:37:21] [INFO ] State equation strengthened by 39648 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: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-13 23:37:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:37:21] [INFO ] After 25534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 149 out of 8819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8819/8819 places, 40676/40676 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 8808 transition count 40665
Partial Free-agglomeration rule applied 182 times.
Drop transitions removed 182 transitions
Iterating global reduction 0 with 182 rules applied. Total rules applied 204 place count 8808 transition count 40665
Applied a total of 204 rules in 10414 ms. Remains 8808 /8819 variables (removed 11) and now considering 40665/40676 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10414 ms. Remains : 8808/8819 places, 40665/40676 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 8) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 23:37:32] [INFO ] Flow matrix only has 40624 transitions (discarded 41 similar events)
// Phase 1: matrix 40624 rows 8808 cols
[2023-03-13 23:37:35] [INFO ] Computed 92 place invariants in 3249 ms
[2023-03-13 23:37:38] [INFO ] [Real]Absence check using 90 positive place invariants in 126 ms returned sat
[2023-03-13 23:37:38] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 173 ms returned sat
[2023-03-13 23:38:00] [INFO ] After 22261ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-13 23:38:01] [INFO ] State equation strengthened by 39851 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: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-13 23:38:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:38:01] [INFO ] After 25428ms 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 0 ms.
Support contains 147 out of 8808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8808/8808 places, 40665/40665 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8807 transition count 40664
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 8807 transition count 40664
Applied a total of 3 rules in 9188 ms. Remains 8807 /8808 variables (removed 1) and now considering 40664/40665 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9189 ms. Remains : 8807/8808 places, 40664/40665 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 7) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-04 TRUE 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 23:38:11] [INFO ] Flow matrix only has 40624 transitions (discarded 40 similar events)
// Phase 1: matrix 40624 rows 8807 cols
[2023-03-13 23:38:14] [INFO ] Computed 92 place invariants in 3581 ms
[2023-03-13 23:38:16] [INFO ] [Real]Absence check using 90 positive place invariants in 133 ms returned sat
[2023-03-13 23:38:16] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 180 ms returned sat
[2023-03-13 23:38:17] [INFO ] After 2255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 23:38:18] [INFO ] [Nat]Absence check using 90 positive place invariants in 79 ms returned sat
[2023-03-13 23:38:18] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 127 ms returned sat
[2023-03-13 23:38:42] [INFO ] After 22615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 23:38:42] [INFO ] State equation strengthened by 39855 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-13 23:38:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:38:42] [INFO ] After 25382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 146 out of 8807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8807/8807 places, 40664/40664 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8806 transition count 40663
Applied a total of 2 rules in 6175 ms. Remains 8806 /8807 variables (removed 1) and now considering 40663/40664 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6175 ms. Remains : 8806/8807 places, 40663/40664 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 6) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 23:38:49] [INFO ] Flow matrix only has 40623 transitions (discarded 40 similar events)
// Phase 1: matrix 40623 rows 8806 cols
[2023-03-13 23:38:52] [INFO ] Computed 92 place invariants in 3163 ms
[2023-03-13 23:38:53] [INFO ] [Real]Absence check using 90 positive place invariants in 83 ms returned sat
[2023-03-13 23:38:53] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 123 ms returned sat
[2023-03-13 23:38:54] [INFO ] After 1687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 23:38:55] [INFO ] [Nat]Absence check using 90 positive place invariants in 122 ms returned sat
[2023-03-13 23:38:55] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 171 ms returned sat
[2023-03-13 23:39:19] [INFO ] After 22615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 23:39:19] [INFO ] State equation strengthened by 39857 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-13 23:39:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:39:19] [INFO ] After 25471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 145 out of 8806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8806/8806 places, 40663/40663 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8805 transition count 40662
Applied a total of 2 rules in 6088 ms. Remains 8805 /8806 variables (removed 1) and now considering 40662/40663 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6089 ms. Remains : 8805/8806 places, 40662/40663 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 69323 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69323 steps, saw 63949 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 23:39:29] [INFO ] Flow matrix only has 40622 transitions (discarded 40 similar events)
// Phase 1: matrix 40622 rows 8805 cols
[2023-03-13 23:39:33] [INFO ] Computed 92 place invariants in 3935 ms
[2023-03-13 23:39:34] [INFO ] [Real]Absence check using 90 positive place invariants in 91 ms returned sat
[2023-03-13 23:39:35] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 178 ms returned sat
[2023-03-13 23:39:35] [INFO ] After 2049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 23:39:37] [INFO ] [Nat]Absence check using 90 positive place invariants in 134 ms returned sat
[2023-03-13 23:39:37] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 174 ms returned sat
[2023-03-13 23:40:00] [INFO ] After 22273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 23:40:00] [INFO ] State equation strengthened by 39859 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-13 23:40:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:40:00] [INFO ] After 25479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 145 out of 8805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8805/8805 places, 40662/40662 transitions.
Applied a total of 0 rules in 3209 ms. Remains 8805 /8805 variables (removed 0) and now considering 40662/40662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3210 ms. Remains : 8805/8805 places, 40662/40662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8805/8805 places, 40662/40662 transitions.
Applied a total of 0 rules in 3185 ms. Remains 8805 /8805 variables (removed 0) and now considering 40662/40662 (removed 0) transitions.
[2023-03-13 23:40:07] [INFO ] Flow matrix only has 40622 transitions (discarded 40 similar events)
[2023-03-13 23:40:07] [INFO ] Invariant cache hit.
[2023-03-13 23:40:08] [INFO ] Implicit Places using invariants in 946 ms returned []
Implicit Place search using SMT only with invariants took 948 ms to find 0 implicit places.
[2023-03-13 23:40:08] [INFO ] Flow matrix only has 40622 transitions (discarded 40 similar events)
[2023-03-13 23:40:08] [INFO ] Invariant cache hit.
[2023-03-13 23:40:31] [INFO ] Dead Transitions using invariants and state equation in 22881 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27020 ms. Remains : 8805/8805 places, 40662/40662 transitions.
Graph (trivial) has 36678 edges and 8805 vertex of which 6704 / 8805 are part of one of the 1 SCC in 13 ms
Free SCC test removed 6703 places
Drop transitions removed 24981 transitions
Ensure Unique test removed 7760 transitions
Reduce isomorphic transitions removed 32741 transitions.
Graph (complete) has 8568 edges and 2102 vertex of which 1917 are kept as prefixes of interest. Removing 185 places using SCC suffix rule.2 ms
Discarding 185 places :
Also discarding 61 output transitions
Drop transitions removed 61 transitions
Drop transitions removed 1066 transitions
Reduce isomorphic transitions removed 1066 transitions.
Iterating post reduction 0 with 1066 rules applied. Total rules applied 1068 place count 1917 transition count 6794
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 1068 place count 1917 transition count 6784
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1088 place count 1907 transition count 6784
Discarding 1202 places :
Symmetric choice reduction at 1 with 1202 rule applications. Total rules 2290 place count 705 transition count 3080
Iterating global reduction 1 with 1202 rules applied. Total rules applied 3492 place count 705 transition count 3080
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 1 with 999 rules applied. Total rules applied 4491 place count 705 transition count 2081
Discarding 143 places :
Symmetric choice reduction at 2 with 143 rule applications. Total rules 4634 place count 562 transition count 1795
Iterating global reduction 2 with 143 rules applied. Total rules applied 4777 place count 562 transition count 1795
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 2 with 143 rules applied. Total rules applied 4920 place count 562 transition count 1652
Drop transitions removed 265 transitions
Redundant transition composition rules discarded 265 transitions
Iterating global reduction 3 with 265 rules applied. Total rules applied 5185 place count 562 transition count 1387
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 5200 place count 562 transition count 1372
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 5215 place count 547 transition count 1372
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 5260 place count 502 transition count 1282
Iterating global reduction 5 with 45 rules applied. Total rules applied 5305 place count 502 transition count 1282
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 5 with 222 rules applied. Total rules applied 5527 place count 391 transition count 1171
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 5 with 151 rules applied. Total rules applied 5678 place count 391 transition count 1020
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 5768 place count 346 transition count 1020
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 6 with 90 rules applied. Total rules applied 5858 place count 346 transition count 930
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 7 with 49 rules applied. Total rules applied 5907 place count 346 transition count 881
Free-agglomeration rule applied 48 times.
Iterating global reduction 7 with 48 rules applied. Total rules applied 5955 place count 346 transition count 833
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 7 with 93 rules applied. Total rules applied 6048 place count 298 transition count 788
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 6050 place count 298 transition count 786
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 6064 place count 298 transition count 786
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 6065 place count 297 transition count 785
Iterating global reduction 8 with 1 rules applied. Total rules applied 6066 place count 297 transition count 785
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 6072 place count 297 transition count 779
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 6076 place count 297 transition count 779
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 6080 place count 293 transition count 775
Iterating global reduction 8 with 4 rules applied. Total rules applied 6084 place count 293 transition count 775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 6085 place count 293 transition count 774
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 6091 place count 293 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 6092 place count 292 transition count 767
Applied a total of 6092 rules in 7313 ms. Remains 292 /8805 variables (removed 8513) and now considering 767/40662 (removed 39895) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 767 rows 292 cols
[2023-03-13 23:40:38] [INFO ] Computed 28 place invariants in 6 ms
[2023-03-13 23:40:38] [INFO ] [Real]Absence check using 28 positive place invariants in 4 ms returned sat
[2023-03-13 23:40:38] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 23:40:38] [INFO ] [Nat]Absence check using 28 positive place invariants in 2 ms returned sat
[2023-03-13 23:40:39] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 23:40:39] [INFO ] After 763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-13 23:40:39] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-13 23:40:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 23:40:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8805 places, 40662 transitions and 162108 arcs took 151 ms.
[2023-03-13 23:40:41] [INFO ] Flatten gal took : 986 ms
Total runtime 307962 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 8805 NrTr: 40662 NrArc: 162108)

parse formulas
formulas created successfully
place and transition orderings generation:1m33.800sec

net check time: 0m 0.028sec

init dd package: 0m 2.945sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 7614052 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16015684 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 4.541sec

528412

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="CANInsertWithFailure-PT-090"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CANInsertWithFailure-PT-090, 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 r042-tajo-167813696200775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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