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.r041-tajo-167813695000686.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 ltsminxred
Input is CANConstruction-PT-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 22:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 22:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 22:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 22:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 25 22:42 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 12M 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-090-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678656773303

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:32:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:32:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:32:57] [INFO ] Load time of PNML (sax parser for PT used): 1031 ms
[2023-03-12 21:32:57] [INFO ] Transformed 17282 places.
[2023-03-12 21:32:57] [INFO ] Transformed 33120 transitions.
[2023-03-12 21:32:57] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 1380 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1422 ms. (steps per millisecond=7 ) properties (out of 16) seen :2
FORMULA CANConstruction-PT-090-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 33120 rows 17282 cols
[2023-03-12 21:33:01] [INFO ] Computed 181 place invariants in 478 ms
[2023-03-12 21:33:09] [INFO ] After 7888ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 21:33:15] [INFO ] [Nat]Absence check using 91 positive place invariants in 361 ms returned sat
[2023-03-12 21:33:15] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 149 ms returned sat
[2023-03-12 21:33:34] [INFO ] After 16367ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :9
[2023-03-12 21:33:34] [INFO ] State equation strengthened by 16110 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-12 21:33:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:33:34] [INFO ] After 25415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA CANConstruction-PT-090-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 115 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions removed 613 transitions
Trivial Post-agglo rules discarded 613 transitions
Performed 613 trivial Post agglomeration. Transition count delta: 613
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 17282 transition count 32507
Reduce places removed 613 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 619 rules applied. Total rules applied 1232 place count 16669 transition count 32501
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1238 place count 16663 transition count 32501
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1238 place count 16663 transition count 32499
Deduced a syphon composed of 2 places in 40 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1242 place count 16661 transition count 32499
Discarding 7862 places :
Symmetric choice reduction at 3 with 7862 rule applications. Total rules 9104 place count 8799 transition count 16775
Iterating global reduction 3 with 7862 rules applied. Total rules applied 16966 place count 8799 transition count 16775
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 22 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 17138 place count 8713 transition count 16689
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 17234 place count 8713 transition count 16593
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 17330 place count 8617 transition count 16593
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 17335 place count 8617 transition count 16588
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 17340 place count 8612 transition count 16588
Partial Free-agglomeration rule applied 84 times.
Drop transitions removed 84 transitions
Iterating global reduction 5 with 84 rules applied. Total rules applied 17424 place count 8612 transition count 16588
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 17425 place count 8612 transition count 16588
Applied a total of 17425 rules in 25036 ms. Remains 8612 /17282 variables (removed 8670) and now considering 16588/33120 (removed 16532) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25051 ms. Remains : 8612/17282 places, 16588/33120 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 1240 ms. (steps per millisecond=8 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 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 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Interrupted probabilistic random walk after 60443 steps, run timeout after 3008 ms. (steps per millisecond=20 ) properties seen :{5=1}
Probabilistic random walk after 60443 steps, saw 59275 distinct states, run finished after 3008 ms. (steps per millisecond=20 ) properties seen :1
FORMULA CANConstruction-PT-090-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 16588 rows 8612 cols
[2023-03-12 21:34:04] [INFO ] Computed 181 place invariants in 233 ms
[2023-03-12 21:34:07] [INFO ] After 2751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 21:34:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 270 ms returned sat
[2023-03-12 21:34:10] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 120 ms returned sat
[2023-03-12 21:34:32] [INFO ] After 20513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 21:34:32] [INFO ] State equation strengthened by 16236 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-12 21:34:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:34:32] [INFO ] After 25276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 421 ms.
Support contains 112 out of 8612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8612/8612 places, 16588/16588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8611 transition count 16587
Applied a total of 2 rules in 5857 ms. Remains 8611 /8612 variables (removed 1) and now considering 16587/16588 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5857 ms. Remains : 8611/8612 places, 16587/16588 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 1077 ms. (steps per millisecond=9 ) properties (out of 9) seen :2
FORMULA CANConstruction-PT-090-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 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 39 ms. (steps per millisecond=256 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 16587 rows 8611 cols
[2023-03-12 21:34:40] [INFO ] Computed 181 place invariants in 126 ms
[2023-03-12 21:34:43] [INFO ] After 2463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 21:34:45] [INFO ] [Nat]Absence check using 91 positive place invariants in 285 ms returned sat
[2023-03-12 21:34:45] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 115 ms returned sat
[2023-03-12 21:35:02] [INFO ] After 16026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 21:35:03] [INFO ] State equation strengthened by 16237 read => feed constraints.
[2023-03-12 21:35:08] [INFO ] After 5290ms SMT Verify possible using 16237 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 21:35:08] [INFO ] After 5294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 21:35:08] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANConstruction-PT-090-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 86 ms.
Support contains 56 out of 8611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8611/8611 places, 16587/16587 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 8609 transition count 16583
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 8609 transition count 16583
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 60 place count 8581 transition count 16555
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 8579 transition count 16555
Applied a total of 64 rules in 11362 ms. Remains 8579 /8611 variables (removed 32) and now considering 16555/16587 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11364 ms. Remains : 8579/8611 places, 16555/16587 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 3) seen :1
FORMULA CANConstruction-PT-090-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16555 rows 8579 cols
[2023-03-12 21:35:20] [INFO ] Computed 181 place invariants in 131 ms
[2023-03-12 21:35:22] [INFO ] After 1619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:35:23] [INFO ] [Nat]Absence check using 91 positive place invariants in 230 ms returned sat
[2023-03-12 21:35:23] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 113 ms returned sat
[2023-03-12 21:35:33] [INFO ] After 9768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:35:33] [INFO ] State equation strengthened by 16269 read => feed constraints.
[2023-03-12 21:35:37] [INFO ] After 3606ms SMT Verify possible using 16269 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 21:35:39] [INFO ] After 5094ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 907 ms.
[2023-03-12 21:35:39] [INFO ] After 17859ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA CANConstruction-PT-090-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 20 out of 8579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8579/8579 places, 16555/16555 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8579 transition count 16553
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8577 transition count 16553
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 9 place count 8572 transition count 16543
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 8572 transition count 16543
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 40 place count 8559 transition count 16530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 8555 transition count 16531
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 8555 transition count 16529
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 8553 transition count 16529
Applied a total of 52 rules in 14810 ms. Remains 8553 /8579 variables (removed 26) and now considering 16529/16555 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14811 ms. Remains : 8553/8579 places, 16529/16555 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 102256 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102256 steps, saw 91327 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16529 rows 8553 cols
[2023-03-12 21:35:58] [INFO ] Computed 181 place invariants in 167 ms
[2023-03-12 21:35:59] [INFO ] After 1446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:36:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 222 ms returned sat
[2023-03-12 21:36:01] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 100 ms returned sat
[2023-03-12 21:36:14] [INFO ] After 13599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:36:15] [INFO ] State equation strengthened by 16291 read => feed constraints.
[2023-03-12 21:36:18] [INFO ] After 3641ms SMT Verify possible using 16291 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:36:20] [INFO ] After 5374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1441 ms.
[2023-03-12 21:36:21] [INFO ] After 22210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 20 out of 8553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8553/8553 places, 16529/16529 transitions.
Applied a total of 0 rules in 3153 ms. Remains 8553 /8553 variables (removed 0) and now considering 16529/16529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3153 ms. Remains : 8553/8553 places, 16529/16529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8553/8553 places, 16529/16529 transitions.
Applied a total of 0 rules in 3177 ms. Remains 8553 /8553 variables (removed 0) and now considering 16529/16529 (removed 0) transitions.
[2023-03-12 21:36:28] [INFO ] Invariant cache hit.
[2023-03-12 21:36:29] [INFO ] Implicit Places using invariants in 1650 ms returned []
Implicit Place search using SMT only with invariants took 1658 ms to find 0 implicit places.
[2023-03-12 21:36:29] [INFO ] Invariant cache hit.
[2023-03-12 21:36:31] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6308 ms. Remains : 8553/8553 places, 16529/16529 transitions.
Graph (trivial) has 16171 edges and 8553 vertex of which 8119 / 8553 are part of one of the 89 SCC in 41 ms
Free SCC test removed 8030 places
Drop transitions removed 15932 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15944 transitions.
Graph (complete) has 1168 edges and 523 vertex of which 157 are kept as prefixes of interest. Removing 366 places using SCC suffix rule.1 ms
Discarding 366 places :
Also discarding 292 output transitions
Drop transitions removed 292 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 157 transition count 164
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 181 rules applied. Total rules applied 312 place count 67 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 315 place count 64 transition count 73
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 315 place count 64 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 327 place count 58 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 57 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 57 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 56 transition count 67
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 348 place count 56 transition count 67
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 363 place count 41 transition count 52
Iterating global reduction 3 with 15 rules applied. Total rules applied 378 place count 41 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 379 place count 40 transition count 51
Applied a total of 379 rules in 116 ms. Remains 40 /8553 variables (removed 8513) and now considering 51/16529 (removed 16478) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 40 cols
[2023-03-12 21:36:31] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 21:36:31] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:36:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-12 21:36:31] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:36:31] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 21:36:31] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:36:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 21:36:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8553 places, 16529 transitions and 66173 arcs took 81 ms.
[2023-03-12 21:36:33] [INFO ] Flatten gal took : 756 ms
Total runtime 216557 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/540/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 1170012 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16070164 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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-090"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CANConstruction-PT-090, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695000686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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