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.r037-tajo-167813690700694.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 itstools
Input is CANConstruction-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690700694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 22:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 22:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:32 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 15M 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-100-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678373377671

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 14:49:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 14:49:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:49:40] [INFO ] Load time of PNML (sax parser for PT used): 621 ms
[2023-03-09 14:49:40] [INFO ] Transformed 21202 places.
[2023-03-09 14:49:40] [INFO ] Transformed 40800 transitions.
[2023-03-09 14:49:40] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 847 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 67 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1354 ms. (steps per millisecond=7 ) properties (out of 16) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
[2023-03-09 14:49:42] [INFO ] Flatten gal took : 1486 ms
[2023-03-09 14:49:43] [INFO ] Flatten gal took : 967 ms
[2023-03-09 14:49:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7046871249188147610.gal : 226 ms
[2023-03-09 14:49:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18256742741906380551.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7046871249188147610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18256742741906380551.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Interrupted probabilistic random walk after 67764 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67764 steps, saw 66898 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-09 14:49:46] [INFO ] Computed 201 place invariants in 748 ms
[2023-03-09 14:49:53] [INFO ] After 7590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
Loading property file /tmp/ReachabilityCardinality18256742741906380551.prop.
[2023-03-09 14:50:01] [INFO ] [Nat]Absence check using 101 positive place invariants in 551 ms returned sat
[2023-03-09 14:50:01] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 146 ms returned sat
[2023-03-09 14:50:18] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
FORMULA CANConstruction-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 244 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 669 transitions
Trivial Post-agglo rules discarded 669 transitions
Performed 669 trivial Post agglomeration. Transition count delta: 669
Iterating post reduction 0 with 669 rules applied. Total rules applied 669 place count 21202 transition count 40131
Reduce places removed 669 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 682 rules applied. Total rules applied 1351 place count 20533 transition count 40118
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1364 place count 20520 transition count 40118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1364 place count 20520 transition count 40111
Deduced a syphon composed of 7 places in 19 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1378 place count 20513 transition count 40111
Discarding 9673 places :
Symmetric choice reduction at 3 with 9673 rule applications. Total rules 11051 place count 10840 transition count 20765
Iterating global reduction 3 with 9673 rules applied. Total rules applied 20724 place count 10840 transition count 20765
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 9 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 20904 place count 10750 transition count 20675
Free-agglomeration rule applied 52 times.
Iterating global reduction 3 with 52 rules applied. Total rules applied 20956 place count 10750 transition count 20623
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 21008 place count 10698 transition count 20623
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 21012 place count 10698 transition count 20619
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 21016 place count 10694 transition count 20619
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 5 with 149 rules applied. Total rules applied 21165 place count 10694 transition count 20619
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 21166 place count 10694 transition count 20619
Applied a total of 21166 rules in 17328 ms. Remains 10694 /21202 variables (removed 10508) and now considering 20619/40800 (removed 20181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17333 ms. Remains : 10694/21202 places, 20619/40800 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 792 ms. (steps per millisecond=12 ) properties (out of 13) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) 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 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 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 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) 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 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 79888 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{4=1, 8=1}
Probabilistic random walk after 79888 steps, saw 78422 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :2
FORMULA CANConstruction-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 20619 rows 10694 cols
[2023-03-09 14:50:40] [INFO ] Computed 201 place invariants in 153 ms
[2023-03-09 14:50:43] [INFO ] After 2902ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 14:50:46] [INFO ] [Nat]Absence check using 101 positive place invariants in 359 ms returned sat
[2023-03-09 14:50:46] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 165 ms returned sat
[2023-03-09 14:51:08] [INFO ] After 19983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-09 14:51:08] [INFO ] State equation strengthened by 20059 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-09 14:51:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:51:08] [INFO ] After 25342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 158 out of 10694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10694/10694 places, 20619/20619 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 10694 transition count 20618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10693 transition count 20618
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 10685 transition count 20602
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 10685 transition count 20602
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 80 place count 10654 transition count 20571
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 94 place count 10647 transition count 20572
Applied a total of 94 rules in 14799 ms. Remains 10647 /10694 variables (removed 47) and now considering 20572/20619 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14799 ms. Remains : 10647/10694 places, 20572/20619 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 10) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 20572 rows 10647 cols
[2023-03-09 14:51:24] [INFO ] Computed 201 place invariants in 158 ms
[2023-03-09 14:51:27] [INFO ] After 2268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 14:51:30] [INFO ] [Nat]Absence check using 101 positive place invariants in 293 ms returned sat
[2023-03-09 14:51:30] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 156 ms returned sat
[2023-03-09 14:51:52] [INFO ] After 20485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 14:51:52] [INFO ] State equation strengthened by 20105 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-09 14:51:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:51:52] [INFO ] After 25272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 156 out of 10647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10647/10647 places, 20572/20572 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10646 transition count 20571
Applied a total of 2 rules in 7258 ms. Remains 10646 /10647 variables (removed 1) and now considering 20571/20572 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7259 ms. Remains : 10646/10647 places, 20571/20572 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 9) seen :2
FORMULA CANConstruction-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 20571 rows 10646 cols
[2023-03-09 14:52:00] [INFO ] Computed 201 place invariants in 145 ms
[2023-03-09 14:52:02] [INFO ] After 2298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 14:52:05] [INFO ] [Nat]Absence check using 101 positive place invariants in 294 ms returned sat
[2023-03-09 14:52:05] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 148 ms returned sat
[2023-03-09 14:52:27] [INFO ] After 21228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 14:52:28] [INFO ] State equation strengthened by 20106 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-09 14:52:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:52:28] [INFO ] After 25381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 139 out of 10646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10646/10646 places, 20571/20571 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 10646 transition count 20570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10645 transition count 20570
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 10637 transition count 20562
Applied a total of 18 rules in 7088 ms. Remains 10637 /10646 variables (removed 9) and now considering 20562/20571 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7090 ms. Remains : 10637/10646 places, 20562/20571 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 7) 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 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 30 ms. (steps per millisecond=333 ) 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 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 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 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 117623 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{5=1}
Probabilistic random walk after 117623 steps, saw 115356 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 20562 rows 10637 cols
[2023-03-09 14:52:39] [INFO ] Computed 201 place invariants in 133 ms
[2023-03-09 14:52:40] [INFO ] After 1893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:52:43] [INFO ] [Nat]Absence check using 101 positive place invariants in 281 ms returned sat
[2023-03-09 14:52:43] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 115 ms returned sat
[2023-03-09 14:53:02] [INFO ] After 17931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 14:53:02] [INFO ] State equation strengthened by 20114 read => feed constraints.
[2023-03-09 14:53:06] [INFO ] After 3508ms SMT Verify possible using 20114 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 14:53:06] [INFO ] After 3511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 14:53:06] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 125 out of 10637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10637/10637 places, 20562/20562 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 10630 transition count 20555
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 10630 transition count 20555
Applied a total of 15 rules in 10488 ms. Remains 10630 /10637 variables (removed 7) and now considering 20555/20562 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10490 ms. Remains : 10630/10637 places, 20555/20562 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 6) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 27 ms. (steps per millisecond=370 ) 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
Running SMT prover for 5 properties.
// Phase 1: matrix 20555 rows 10630 cols
[2023-03-09 14:53:17] [INFO ] Computed 201 place invariants in 168 ms
[2023-03-09 14:53:19] [INFO ] After 1735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 14:53:21] [INFO ] [Nat]Absence check using 101 positive place invariants in 313 ms returned sat
[2023-03-09 14:53:21] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 149 ms returned sat
[2023-03-09 14:53:41] [INFO ] After 18882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 14:53:41] [INFO ] State equation strengthened by 20121 read => feed constraints.
[2023-03-09 14:53:44] [INFO ] After 2754ms SMT Verify possible using 20121 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 14:53:44] [INFO ] After 2756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 14:53:44] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 123 out of 10630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10630/10630 places, 20555/20555 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10629 transition count 20554
Applied a total of 2 rules in 7293 ms. Remains 10629 /10630 variables (removed 1) and now considering 20554/20555 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7294 ms. Remains : 10629/10630 places, 20554/20555 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) 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
Probabilistic random walk after 180907 steps, saw 178048 distinct states, run finished after 3003 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 20554 rows 10629 cols
[2023-03-09 14:53:55] [INFO ] Computed 201 place invariants in 127 ms
[2023-03-09 14:53:56] [INFO ] After 1531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 14:53:58] [INFO ] [Nat]Absence check using 101 positive place invariants in 281 ms returned sat
[2023-03-09 14:53:58] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 153 ms returned sat
[2023-03-09 14:54:15] [INFO ] After 16251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 14:54:15] [INFO ] State equation strengthened by 20122 read => feed constraints.
[2023-03-09 14:54:20] [INFO ] After 5026ms SMT Verify possible using 20122 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 14:54:21] [INFO ] After 6014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:54:21] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 123 out of 10629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10629/10629 places, 20554/20554 transitions.
Applied a total of 0 rules in 3522 ms. Remains 10629 /10629 variables (removed 0) and now considering 20554/20554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3523 ms. Remains : 10629/10629 places, 20554/20554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10629/10629 places, 20554/20554 transitions.
Applied a total of 0 rules in 3457 ms. Remains 10629 /10629 variables (removed 0) and now considering 20554/20554 (removed 0) transitions.
[2023-03-09 14:54:28] [INFO ] Invariant cache hit.
[2023-03-09 14:54:29] [INFO ] Implicit Places using invariants in 1069 ms returned []
Implicit Place search using SMT only with invariants took 1083 ms to find 0 implicit places.
[2023-03-09 14:54:29] [INFO ] Invariant cache hit.
[2023-03-09 14:54:30] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5481 ms. Remains : 10629/10629 places, 20554/20554 transitions.
Graph (trivial) has 19870 edges and 10629 vertex of which 9426 / 10629 are part of one of the 94 SCC in 19 ms
Free SCC test removed 9332 places
Drop transitions removed 18530 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 18544 transitions.
Graph (complete) has 2690 edges and 1297 vertex of which 972 are kept as prefixes of interest. Removing 325 places using SCC suffix rule.1 ms
Discarding 325 places :
Also discarding 142 output transitions
Drop transitions removed 142 transitions
Drop transitions removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Drop transitions removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 781 rules applied. Total rules applied 783 place count 972 transition count 1087
Reduce places removed 587 places and 0 transitions.
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 579 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 1188 rules applied. Total rules applied 1971 place count 385 transition count 486
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1993 place count 363 transition count 486
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 1993 place count 363 transition count 460
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 2046 place count 336 transition count 460
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2054 place count 328 transition count 452
Iterating global reduction 3 with 8 rules applied. Total rules applied 2062 place count 328 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 2066 place count 327 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2067 place count 326 transition count 449
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 2067 place count 326 transition count 443
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2079 place count 320 transition count 443
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2080 place count 319 transition count 442
Iterating global reduction 5 with 1 rules applied. Total rules applied 2081 place count 319 transition count 442
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2093 place count 313 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2101 place count 309 transition count 444
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2105 place count 309 transition count 440
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 2106 place count 308 transition count 440
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2107 place count 307 transition count 439
Iterating global reduction 6 with 1 rules applied. Total rules applied 2108 place count 307 transition count 439
Free-agglomeration rule applied 35 times.
Iterating global reduction 6 with 35 rules applied. Total rules applied 2143 place count 307 transition count 404
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 2178 place count 272 transition count 404
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2180 place count 272 transition count 402
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 2221 place count 272 transition count 402
Discarding 32 places :
Symmetric choice reduction at 7 with 32 rule applications. Total rules 2253 place count 240 transition count 370
Iterating global reduction 7 with 32 rules applied. Total rules applied 2285 place count 240 transition count 370
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 2308 place count 217 transition count 347
Applied a total of 2308 rules in 319 ms. Remains 217 /10629 variables (removed 10412) and now considering 347/20554 (removed 20207) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 347 rows 217 cols
[2023-03-09 14:54:31] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-09 14:54:31] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 14:54:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 1 ms returned sat
[2023-03-09 14:54:31] [INFO ] [Nat]Absence check using 15 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-09 14:54:31] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 14:54:31] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-09 14:54:32] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-09 14:54:32] [INFO ] Flatten gal took : 6 ms
[2023-03-09 14:54:32] [INFO ] Flatten gal took : 8 ms
[2023-03-09 14:54:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15927610657191227686.gal : 2 ms
[2023-03-09 14:54:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6254183626631344655.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15927610657191227686.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6254183626631344655.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6254183626631344655.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 27
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :27 after 243
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :243 after 23328
Invariant property CANConstruction-PT-100-ReachabilityCardinality-05 does not hold.
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :23328 after 2.68739e+08
Detected timeout of ITS tools.
[2023-03-09 14:54:47] [INFO ] Flatten gal took : 5 ms
[2023-03-09 14:54:47] [INFO ] Applying decomposition
[2023-03-09 14:54:47] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10530950800874974857.txt' '-o' '/tmp/graph10530950800874974857.bin' '-w' '/tmp/graph10530950800874974857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10530950800874974857.bin' '-l' '-1' '-v' '-w' '/tmp/graph10530950800874974857.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:54:47] [INFO ] Decomposing Gal with order
[2023-03-09 14:54:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:54:47] [INFO ] Removed a total of 23 redundant transitions.
[2023-03-09 14:54:47] [INFO ] Flatten gal took : 48 ms
[2023-03-09 14:54:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 5 ms.
[2023-03-09 14:54:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13253217104923267614.gal : 13 ms
[2023-03-09 14:54:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11082704838455065832.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13253217104923267614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11082704838455065832.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11082704838455065832.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :18 after 81
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :81 after 5832
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :5832 after 2.68739e+08
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2.68739e+08 after 6.31929e+16
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6736633367871268472
[2023-03-09 14:55:02] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6736633367871268472
Running compilation step : cd /tmp/ltsmin6736633367871268472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 487 ms.
Running link step : cd /tmp/ltsmin6736633367871268472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6736633367871268472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'CANConstructionPT100ReachabilityCardinality00==true'
LTSmin run took 3170 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin6736633367871268472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'CANConstructionPT100ReachabilityCardinality03==true'
LTSmin run took 53 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin6736633367871268472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'CANConstructionPT100ReachabilityCardinality07==true'
LTSmin run took 4067 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin6736633367871268472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'CANConstructionPT100ReachabilityCardinality11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 14:55:18] [INFO ] Flatten gal took : 1112 ms
[2023-03-09 14:55:18] [INFO ] Applying decomposition
[2023-03-09 14:55:19] [INFO ] Flatten gal took : 964 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10428605516012803749.txt' '-o' '/tmp/graph10428605516012803749.bin' '-w' '/tmp/graph10428605516012803749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10428605516012803749.bin' '-l' '-1' '-v' '-w' '/tmp/graph10428605516012803749.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:55:22] [INFO ] Decomposing Gal with order
[2023-03-09 14:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:55:31] [INFO ] Removed a total of 25495 redundant transitions.
[2023-03-09 14:55:32] [INFO ] Flatten gal took : 3405 ms
[2023-03-09 14:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 3989 labels/synchronizations in 1485 ms.
[2023-03-09 14:55:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16988301685456334362.gal : 536 ms
[2023-03-09 14:55:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14833458842733766954.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16988301685456334362.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14833458842733766954.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14833458842733766954.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 102
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 58
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-09 15:25:44] [INFO ] Flatten gal took : 575 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4527750151042628572
[2023-03-09 15:25:44] [INFO ] Too many transitions (20554) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:25:44] [INFO ] Applying decomposition
[2023-03-09 15:25:44] [INFO ] Built C files in 449ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4527750151042628572
Running compilation step : cd /tmp/ltsmin4527750151042628572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 15:25:45] [INFO ] Flatten gal took : 415 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3016487962066052894.txt' '-o' '/tmp/graph3016487962066052894.bin' '-w' '/tmp/graph3016487962066052894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3016487962066052894.bin' '-l' '-1' '-v' '-w' '/tmp/graph3016487962066052894.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:25:46] [INFO ] Decomposing Gal with order
[2023-03-09 15:25:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:25:50] [INFO ] Removed a total of 20236 redundant transitions.
[2023-03-09 15:25:50] [INFO ] Flatten gal took : 3121 ms
[2023-03-09 15:25:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 19614 labels/synchronizations in 4353 ms.
[2023-03-09 15:25:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17481015152847483277.gal : 74 ms
[2023-03-09 15:25:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14706085311417359666.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17481015152847483277.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14706085311417359666.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14706085311417359666.prop.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4527750151042628572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 144 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4527750151042628572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 144 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 53
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :53 after 54
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :54 after 152
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :152 after 153
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :153 after 155
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :155 after 6352
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :6352 after 6441
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :6441 after 6454
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :6454 after 11466
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4288204 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16053392 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CANConstruction-PT-100, 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 r037-tajo-167813690700694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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