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-167813696100679.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 CANConstruction-PT-080, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100679
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 9.5M 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 CANConstruction-PT-080-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678740142617

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=CANConstruction-PT-080
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:42:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:42:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:42:24] [INFO ] Load time of PNML (sax parser for PT used): 469 ms
[2023-03-13 20:42:24] [INFO ] Transformed 13762 places.
[2023-03-13 20:42:24] [INFO ] Transformed 26240 transitions.
[2023-03-13 20:42:24] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 624 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1045 ms. (steps per millisecond=9 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-080-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-13 20:42:27] [INFO ] Computed 161 place invariants in 416 ms
[2023-03-13 20:42:33] [INFO ] [Real]Absence check using 81 positive place invariants in 367 ms returned sat
[2023-03-13 20:42:33] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 121 ms returned sat
[2023-03-13 20:42:33] [INFO ] After 6395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 20:42:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 320 ms returned sat
[2023-03-13 20:42:38] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 137 ms returned sat
[2023-03-13 20:42:58] [INFO ] After 17158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-13 20:42:59] [INFO ] State equation strengthened by 12720 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 20:42:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:42:59] [INFO ] After 25294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 274 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 455 transitions
Trivial Post-agglo rules discarded 455 transitions
Performed 455 trivial Post agglomeration. Transition count delta: 455
Iterating post reduction 0 with 455 rules applied. Total rules applied 455 place count 13762 transition count 25785
Reduce places removed 455 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 458 rules applied. Total rules applied 913 place count 13307 transition count 25782
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 916 place count 13304 transition count 25782
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 916 place count 13304 transition count 25745
Deduced a syphon composed of 37 places in 10 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 990 place count 13267 transition count 25745
Discarding 6133 places :
Symmetric choice reduction at 3 with 6133 rule applications. Total rules 7123 place count 7134 transition count 13479
Iterating global reduction 3 with 6133 rules applied. Total rules applied 13256 place count 7134 transition count 13479
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 13340 place count 7092 transition count 13437
Free-agglomeration rule applied 40 times.
Iterating global reduction 3 with 40 rules applied. Total rules applied 13380 place count 7092 transition count 13397
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 13420 place count 7052 transition count 13397
Free-agglomeration rule (complex) applied 59 times.
Iterating global reduction 4 with 59 rules applied. Total rules applied 13479 place count 7052 transition count 13338
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 4 with 59 rules applied. Total rules applied 13538 place count 6993 transition count 13338
Partial Free-agglomeration rule applied 157 times.
Drop transitions removed 157 transitions
Iterating global reduction 5 with 157 rules applied. Total rules applied 13695 place count 6993 transition count 13338
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 13722 place count 6993 transition count 13338
Applied a total of 13722 rules in 13245 ms. Remains 6993 /13762 variables (removed 6769) and now considering 13338/26240 (removed 12902) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13249 ms. Remains : 6993/13762 places, 13338/26240 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 769 ms. (steps per millisecond=13 ) properties (out of 13) seen :1
FORMULA CANConstruction-PT-080-ReachabilityFireability-14 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) seen :0
Interrupted probabilistic random walk after 66542 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{7=1, 8=1, 9=1}
Probabilistic random walk after 66542 steps, saw 53410 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :3
FORMULA CANConstruction-PT-080-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 13338 rows 6993 cols
[2023-03-13 20:43:16] [INFO ] Computed 161 place invariants in 197 ms
[2023-03-13 20:43:19] [INFO ] [Real]Absence check using 81 positive place invariants in 188 ms returned sat
[2023-03-13 20:43:19] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 90 ms returned sat
[2023-03-13 20:43:19] [INFO ] After 2445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 20:43:21] [INFO ] [Nat]Absence check using 81 positive place invariants in 210 ms returned sat
[2023-03-13 20:43:21] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 95 ms returned sat
[2023-03-13 20:43:33] [INFO ] After 10704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 20:43:33] [INFO ] State equation strengthened by 12854 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
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 20:43:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:43:44] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 226 ms.
Support contains 223 out of 6993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6993/6993 places, 13338/13338 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6991 transition count 13334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6991 transition count 13334
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 60 place count 6963 transition count 13306
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 6961 transition count 13306
Applied a total of 64 rules in 7153 ms. Remains 6961 /6993 variables (removed 32) and now considering 13306/13338 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7153 ms. Remains : 6961/6993 places, 13306/13338 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 9) seen :1
FORMULA CANConstruction-PT-080-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 26 ms. (steps per millisecond=384 ) properties (out of 8) 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 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 24 ms. (steps per millisecond=416 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 13306 rows 6961 cols
[2023-03-13 20:43:52] [INFO ] Computed 161 place invariants in 161 ms
[2023-03-13 20:43:55] [INFO ] [Real]Absence check using 81 positive place invariants in 200 ms returned sat
[2023-03-13 20:43:55] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 83 ms returned sat
[2023-03-13 20:43:55] [INFO ] After 2162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 20:43:57] [INFO ] [Nat]Absence check using 81 positive place invariants in 202 ms returned sat
[2023-03-13 20:43:57] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 131 ms returned sat
[2023-03-13 20:44:07] [INFO ] After 9645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 20:44:08] [INFO ] State equation strengthened by 12881 read => feed constraints.
[2023-03-13 20:44:19] [INFO ] After 11810ms SMT Verify possible using 12881 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 20:44:20] [INFO ] After 12118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-13 20:44:20] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CANConstruction-PT-080-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 187 ms.
Support contains 176 out of 6961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6961/6961 places, 13306/13306 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6961 transition count 13305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6960 transition count 13305
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 6957 transition count 13299
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 6957 transition count 13299
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 52 place count 6935 transition count 13277
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 6932 transition count 13277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 6932 transition count 13276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 6931 transition count 13276
Applied a total of 60 rules in 7991 ms. Remains 6931 /6961 variables (removed 30) and now considering 13276/13306 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7992 ms. Remains : 6931/6961 places, 13276/13306 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 7) seen :2
FORMULA CANConstruction-PT-080-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) 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 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 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 13276 rows 6931 cols
[2023-03-13 20:44:29] [INFO ] Computed 161 place invariants in 120 ms
[2023-03-13 20:44:31] [INFO ] [Real]Absence check using 81 positive place invariants in 215 ms returned sat
[2023-03-13 20:44:31] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 87 ms returned sat
[2023-03-13 20:44:31] [INFO ] After 1940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 20:44:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 204 ms returned sat
[2023-03-13 20:44:33] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 90 ms returned sat
[2023-03-13 20:44:41] [INFO ] After 8092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 20:44:42] [INFO ] State equation strengthened by 12901 read => feed constraints.
[2023-03-13 20:44:48] [INFO ] After 6771ms SMT Verify possible using 12901 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 20:44:54] [INFO ] After 12029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
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 20:44:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:44:56] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 104 ms.
Support contains 129 out of 6931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6931/6931 places, 13276/13276 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6929 transition count 13272
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6929 transition count 13272
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 62 place count 6900 transition count 13243
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 6898 transition count 13243
Applied a total of 66 rules in 6514 ms. Remains 6898 /6931 variables (removed 33) and now considering 13243/13276 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6514 ms. Remains : 6898/6931 places, 13243/13276 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 76381 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76381 steps, saw 66082 distinct states, run finished after 3005 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 13243 rows 6898 cols
[2023-03-13 20:45:06] [INFO ] Computed 161 place invariants in 136 ms
[2023-03-13 20:45:08] [INFO ] [Real]Absence check using 81 positive place invariants in 209 ms returned sat
[2023-03-13 20:45:08] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 133 ms returned sat
[2023-03-13 20:45:08] [INFO ] After 1886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 20:45:10] [INFO ] [Nat]Absence check using 81 positive place invariants in 207 ms returned sat
[2023-03-13 20:45:10] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 88 ms returned sat
[2023-03-13 20:45:19] [INFO ] After 8621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 20:45:20] [INFO ] State equation strengthened by 12928 read => feed constraints.
[2023-03-13 20:45:28] [INFO ] After 8732ms SMT Verify possible using 12928 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 20:45:52] [INFO ] Deduced a trap composed of 3 places in 19161 ms of which 22 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 20:45:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:45:52] [INFO ] After 44191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA CANConstruction-PT-080-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 102 ms.
Support contains 106 out of 6898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6898/6898 places, 13243/13243 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6898 transition count 13242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6897 transition count 13242
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 6887 transition count 13232
Applied a total of 22 rules in 3551 ms. Remains 6887 /6898 variables (removed 11) and now considering 13232/13243 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3552 ms. Remains : 6887/6898 places, 13232/13243 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 79179 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79179 steps, saw 66991 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 13232 rows 6887 cols
[2023-03-13 20:46:00] [INFO ] Computed 161 place invariants in 66 ms
[2023-03-13 20:46:01] [INFO ] [Real]Absence check using 81 positive place invariants in 189 ms returned sat
[2023-03-13 20:46:02] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 130 ms returned sat
[2023-03-13 20:46:02] [INFO ] After 1706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:46:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 166 ms returned sat
[2023-03-13 20:46:03] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 152 ms returned sat
[2023-03-13 20:46:11] [INFO ] After 7838ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:46:12] [INFO ] State equation strengthened by 12937 read => feed constraints.
[2023-03-13 20:46:18] [INFO ] After 6778ms SMT Verify possible using 12937 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:46:23] [INFO ] After 11344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3795 ms.
[2023-03-13 20:46:27] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 106 out of 6887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6887/6887 places, 13232/13232 transitions.
Applied a total of 0 rules in 1648 ms. Remains 6887 /6887 variables (removed 0) and now considering 13232/13232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1649 ms. Remains : 6887/6887 places, 13232/13232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6887/6887 places, 13232/13232 transitions.
Applied a total of 0 rules in 1663 ms. Remains 6887 /6887 variables (removed 0) and now considering 13232/13232 (removed 0) transitions.
[2023-03-13 20:46:30] [INFO ] Invariant cache hit.
[2023-03-13 20:46:35] [INFO ] Implicit Places using invariants in 5099 ms returned []
Implicit Place search using SMT only with invariants took 5104 ms to find 0 implicit places.
[2023-03-13 20:46:35] [INFO ] Invariant cache hit.
[2023-03-13 20:46:43] [INFO ] Dead Transitions using invariants and state equation in 8225 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14997 ms. Remains : 6887/6887 places, 13232/13232 transitions.
Graph (trivial) has 11515 edges and 6887 vertex of which 5186 / 6887 are part of one of the 64 SCC in 18 ms
Free SCC test removed 5122 places
Drop transitions removed 10136 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 10154 transitions.
Graph (complete) has 3620 edges and 1765 vertex of which 1607 are kept as prefixes of interest. Removing 158 places using SCC suffix rule.4 ms
Discarding 158 places :
Also discarding 81 output transitions
Drop transitions removed 81 transitions
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Performed 1247 Post agglomeration using F-continuation condition.Transition count delta: 1247
Iterating post reduction 0 with 1341 rules applied. Total rules applied 1343 place count 1603 transition count 1660
Reduce places removed 1247 places and 0 transitions.
Ensure Unique test removed 1222 transitions
Reduce isomorphic transitions removed 1222 transitions.
Iterating post reduction 1 with 2469 rules applied. Total rules applied 3812 place count 356 transition count 438
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 3812 place count 356 transition count 427
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 3834 place count 345 transition count 427
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 3849 place count 330 transition count 407
Iterating global reduction 2 with 15 rules applied. Total rules applied 3864 place count 330 transition count 407
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 3874 place count 329 transition count 398
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 3888 place count 322 transition count 391
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3892 place count 320 transition count 393
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 3907 place count 320 transition count 378
Free-agglomeration rule applied 47 times.
Iterating global reduction 3 with 47 rules applied. Total rules applied 3954 place count 320 transition count 331
Ensure Unique test removed 10 places
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 75 rules applied. Total rules applied 4029 place count 263 transition count 313
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4039 place count 263 transition count 303
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 4049 place count 253 transition count 303
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 4068 place count 253 transition count 303
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 4083 place count 238 transition count 288
Iterating global reduction 5 with 15 rules applied. Total rules applied 4098 place count 238 transition count 288
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4100 place count 236 transition count 286
Applied a total of 4100 rules in 478 ms. Remains 236 /6887 variables (removed 6651) and now considering 286/13232 (removed 12946) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 286 rows 236 cols
[2023-03-13 20:46:44] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-13 20:46:44] [INFO ] [Real]Absence check using 73 positive place invariants in 26 ms returned sat
[2023-03-13 20:46:44] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:46:44] [INFO ] [Nat]Absence check using 73 positive place invariants in 9 ms returned sat
[2023-03-13 20:46:44] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:46:45] [INFO ] After 328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-13 20:46:45] [INFO ] After 539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:46:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 20:46:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6887 places, 13232 transitions and 52860 arcs took 112 ms.
[2023-03-13 20:46:46] [INFO ] Flatten gal took : 732 ms
Total runtime 262195 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: 6887 NrTr: 13232 NrArc: 52860)

parse formulas
formulas created successfully
place and transition orderings generation:0m11.059sec

net check time: 0m 0.013sec

init dd package: 0m 3.248sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6751408 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16078752 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 0.301sec

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="CANConstruction-PT-080"
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 CANConstruction-PT-080, 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-167813696100679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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